/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/parallel-lamport.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:02:54,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:02:54,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:02:54,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:02:54,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:02:54,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:02:54,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:02:54,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:02:54,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:02:54,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:02:54,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:02:54,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:02:54,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:02:54,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:02:54,266 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:54,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:54,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:54,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:02:54,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:02:54,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:02:54,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:02:54,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:02:54,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:02:54,477 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:02:54,478 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 18:02:55,775 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c96b3841/8c3631b946ff4428921d30599327eadd/FLAGe2b3cbfd3 [2025-04-13 18:02:56,005 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:02:56,006 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-lamport.wvr.c [2025-04-13 18:02:56,012 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c96b3841/8c3631b946ff4428921d30599327eadd/FLAGe2b3cbfd3 [2025-04-13 18:02:56,975 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c96b3841/8c3631b946ff4428921d30599327eadd [2025-04-13 18:02:56,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:02:56,978 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:02:56,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:56,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:02:56,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:02:56,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:56" (1/1) ... [2025-04-13 18:02:56,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595b1ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:56, skipping insertion in model container [2025-04-13 18:02:56,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:02:56" (1/1) ... [2025-04-13 18:02:56,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:02:57,175 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 18:02:57,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:57,198 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:02:57,234 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 18:02:57,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:02:57,253 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:02:57,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57 WrapperNode [2025-04-13 18:02:57,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:02:57,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:57,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:02:57,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:02:57,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,284 INFO L138 Inliner]: procedures = 22, calls = 29, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 204 [2025-04-13 18:02:57,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:02:57,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:02:57,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:02:57,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:02:57,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,312 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 18:02:57,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,320 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:02:57,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:02:57,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:02:57,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:02:57,338 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (1/1) ... [2025-04-13 18:02:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:02:57,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:57,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:02:57,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:02:57,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:02:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:02:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:02:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:02:57,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:02:57,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:02:57,386 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:02:57,462 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:02:57,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:02:57,672 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:02:57,672 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:02:57,672 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:02:57,847 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:02:57,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:57 BoogieIcfgContainer [2025-04-13 18:02:57,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:02:57,849 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:02:57,849 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:02:57,852 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:02:57,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:02:56" (1/3) ... [2025-04-13 18:02:57,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:57, skipping insertion in model container [2025-04-13 18:02:57,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:02:57" (2/3) ... [2025-04-13 18:02:57,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5752b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:02:57, skipping insertion in model container [2025-04-13 18:02:57,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:02:57" (3/3) ... [2025-04-13 18:02:57,857 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2025-04-13 18:02:57,867 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:02:57,868 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 18:02:57,868 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:02:57,924 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:02:57,945 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 59 transitions, 139 flow [2025-04-13 18:02:58,041 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 18:02:58,059 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:02:58,065 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;@286edca5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:02:58,065 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:02:58,073 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 18:02:58,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 18:02:58,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:58,096 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 18:02:58,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:02:58,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1734767589, now seen corresponding path program 1 times [2025-04-13 18:02:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:58,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039501504] [2025-04-13 18:02:58,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:58,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:58,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-13 18:02:58,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 18:02:58,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:58,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:02:58,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:58,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039501504] [2025-04-13 18:02:58,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039501504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:02:58,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:02:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:02:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26475469] [2025-04-13 18:02:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:02:58,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:02:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:02:58,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:02:58,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:02:58,529 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 18:02:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:02:58,659 INFO L93 Difference]: Finished difference Result 4265 states and 13117 transitions. [2025-04-13 18:02:58,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:02:58,660 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 18:02:58,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:02:58,688 INFO L225 Difference]: With dead ends: 4265 [2025-04-13 18:02:58,688 INFO L226 Difference]: Without dead ends: 2139 [2025-04-13 18:02:58,694 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 18:02:58,700 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:02:58,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:02:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-04-13 18:02:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2025-04-13 18:02:58,798 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 18:02:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 6565 transitions. [2025-04-13 18:02:58,815 INFO L79 Accepts]: Start accepts. Automaton has 2139 states and 6565 transitions. Word has length 54 [2025-04-13 18:02:58,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:02:58,815 INFO L485 AbstractCegarLoop]: Abstraction has 2139 states and 6565 transitions. [2025-04-13 18:02:58,815 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 18:02:58,815 INFO L278 IsEmpty]: Start isEmpty. Operand 2139 states and 6565 transitions. [2025-04-13 18:02:58,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:02:58,821 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:02:58,821 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 18:02:58,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:02:58,822 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:02:58,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:02:58,822 INFO L85 PathProgramCache]: Analyzing trace with hash -502319787, now seen corresponding path program 1 times [2025-04-13 18:02:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:02:58,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144562808] [2025-04-13 18:02:58,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:02:58,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:02:58,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:02:58,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:58,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:02:59,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:02:59,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144562808] [2025-04-13 18:02:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144562808] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:02:59,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872230563] [2025-04-13 18:02:59,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:02:59,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:02:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:02:59,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:02:59,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:02:59,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:02:59,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:02:59,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:02:59,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:02:59,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:02:59,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:02:59,726 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 18:03:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:00,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872230563] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:00,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 13] total 32 [2025-04-13 18:03:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681655529] [2025-04-13 18:03:00,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:00,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:00,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:00,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:00,756 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 18:03:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:01,978 INFO L93 Difference]: Finished difference Result 2962 states and 8877 transitions. [2025-04-13 18:03:01,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:03:01,979 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 18:03:01,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:01,993 INFO L225 Difference]: With dead ends: 2962 [2025-04-13 18:03:01,993 INFO L226 Difference]: Without dead ends: 2790 [2025-04-13 18:03:01,995 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 18:03:01,996 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 371 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:01,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 687 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:03:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-04-13 18:03:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2265. [2025-04-13 18:03:02,044 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 18:03:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 6919 transitions. [2025-04-13 18:03:02,054 INFO L79 Accepts]: Start accepts. Automaton has 2265 states and 6919 transitions. Word has length 55 [2025-04-13 18:03:02,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:02,054 INFO L485 AbstractCegarLoop]: Abstraction has 2265 states and 6919 transitions. [2025-04-13 18:03:02,054 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 18:03:02,054 INFO L278 IsEmpty]: Start isEmpty. Operand 2265 states and 6919 transitions. [2025-04-13 18:03:02,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:02,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:02,059 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 18:03:02,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 18:03:02,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:02,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:02,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2130325001, now seen corresponding path program 2 times [2025-04-13 18:03:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:02,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413722491] [2025-04-13 18:03:02,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:02,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:02,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:02,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:02,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:02,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:02,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413722491] [2025-04-13 18:03:02,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413722491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:02,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:02,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:03:02,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787109653] [2025-04-13 18:03:02,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:02,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:03:02,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:03:02,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:03:02,371 INFO L87 Difference]: Start difference. First operand 2265 states and 6919 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 18:03:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:02,482 INFO L93 Difference]: Finished difference Result 3947 states and 11975 transitions. [2025-04-13 18:03:02,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:02,483 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 18:03:02,483 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:02,497 INFO L225 Difference]: With dead ends: 3947 [2025-04-13 18:03:02,497 INFO L226 Difference]: Without dead ends: 2688 [2025-04-13 18:03:02,500 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 18:03:02,502 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 71 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:02,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 117 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:02,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2025-04-13 18:03:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2405. [2025-04-13 18:03:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2404 states have (on average 3.0287021630615643) internal successors, (7281), 2404 states have internal predecessors, (7281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7281 transitions. [2025-04-13 18:03:02,559 INFO L79 Accepts]: Start accepts. Automaton has 2405 states and 7281 transitions. Word has length 55 [2025-04-13 18:03:02,561 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:02,561 INFO L485 AbstractCegarLoop]: Abstraction has 2405 states and 7281 transitions. [2025-04-13 18:03:02,561 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 18:03:02,561 INFO L278 IsEmpty]: Start isEmpty. Operand 2405 states and 7281 transitions. [2025-04-13 18:03:02,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:02,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:02,567 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 18:03:02,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:03:02,567 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:02,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -378217101, now seen corresponding path program 3 times [2025-04-13 18:03:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:02,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942629304] [2025-04-13 18:03:02,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:02,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:02,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:02,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:02,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:02,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942629304] [2025-04-13 18:03:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942629304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295480323] [2025-04-13 18:03:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:02,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:02,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:02,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:02,859 INFO L87 Difference]: Start difference. First operand 2405 states and 7281 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 18:03:03,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:03,528 INFO L93 Difference]: Finished difference Result 3417 states and 10236 transitions. [2025-04-13 18:03:03,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:03:03,528 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 18:03:03,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:03,546 INFO L225 Difference]: With dead ends: 3417 [2025-04-13 18:03:03,546 INFO L226 Difference]: Without dead ends: 3305 [2025-04-13 18:03:03,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:03,548 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 308 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:03,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 534 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2025-04-13 18:03:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 2576. [2025-04-13 18:03:03,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2575 states have (on average 3.0380582524271844) internal successors, (7823), 2575 states have internal predecessors, (7823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 7823 transitions. [2025-04-13 18:03:03,604 INFO L79 Accepts]: Start accepts. Automaton has 2576 states and 7823 transitions. Word has length 55 [2025-04-13 18:03:03,604 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:03,604 INFO L485 AbstractCegarLoop]: Abstraction has 2576 states and 7823 transitions. [2025-04-13 18:03:03,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 18:03:03,604 INFO L278 IsEmpty]: Start isEmpty. Operand 2576 states and 7823 transitions. [2025-04-13 18:03:03,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:03,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:03,609 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 18:03:03,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:03:03,609 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:03,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1515867159, now seen corresponding path program 4 times [2025-04-13 18:03:03,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:03,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145762654] [2025-04-13 18:03:03,610 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:03,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:03,624 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 18:03:03,624 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:03:03,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:03,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145762654] [2025-04-13 18:03:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145762654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274209764] [2025-04-13 18:03:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:03,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:03,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:03,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:03,771 INFO L87 Difference]: Start difference. First operand 2576 states and 7823 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 18:03:04,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:04,606 INFO L93 Difference]: Finished difference Result 3484 states and 10410 transitions. [2025-04-13 18:03:04,606 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:03:04,607 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 18:03:04,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:04,622 INFO L225 Difference]: With dead ends: 3484 [2025-04-13 18:03:04,622 INFO L226 Difference]: Without dead ends: 3180 [2025-04-13 18:03:04,624 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:03:04,624 INFO L437 NwaCegarLoop]: 113 mSDtfsCounter, 372 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:04,625 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 808 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2025-04-13 18:03:04,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2556. [2025-04-13 18:03:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2555 states have (on average 3.0250489236790608) internal successors, (7729), 2555 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 7729 transitions. [2025-04-13 18:03:04,687 INFO L79 Accepts]: Start accepts. Automaton has 2556 states and 7729 transitions. Word has length 55 [2025-04-13 18:03:04,688 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:04,688 INFO L485 AbstractCegarLoop]: Abstraction has 2556 states and 7729 transitions. [2025-04-13 18:03:04,688 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 18:03:04,688 INFO L278 IsEmpty]: Start isEmpty. Operand 2556 states and 7729 transitions. [2025-04-13 18:03:04,695 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:04,695 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:04,695 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 18:03:04,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:03:04,695 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:04,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 183115093, now seen corresponding path program 5 times [2025-04-13 18:03:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:04,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986628188] [2025-04-13 18:03:04,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:04,706 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:04,723 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:04,723 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:04,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:05,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:05,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986628188] [2025-04-13 18:03:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986628188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:05,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640976155] [2025-04-13 18:03:05,411 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:05,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:05,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:05,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:05,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:03:05,458 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:05,482 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:05,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:05,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:05,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:03:05,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:05,505 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 18:03:05,998 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 18:03:05,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 24 [2025-04-13 18:03:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:06,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:06,854 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 70 treesize of output 62 [2025-04-13 18:03:06,874 INFO L325 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-04-13 18:03:06,874 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 87 [2025-04-13 18:03:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640976155] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:07,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2025-04-13 18:03:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25299930] [2025-04-13 18:03:07,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:07,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 18:03:07,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:07,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 18:03:07,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:03:07,417 INFO L87 Difference]: Start difference. First operand 2556 states and 7729 transitions. Second operand has 36 states, 35 states have (on average 3.6) internal successors, (126), 36 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:15,395 INFO L93 Difference]: Finished difference Result 8247 states and 24232 transitions. [2025-04-13 18:03:15,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-04-13 18:03:15,398 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.6) internal successors, (126), 36 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have 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 18:03:15,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:15,424 INFO L225 Difference]: With dead ends: 8247 [2025-04-13 18:03:15,424 INFO L226 Difference]: Without dead ends: 6992 [2025-04-13 18:03:15,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10078 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3917, Invalid=26883, Unknown=0, NotChecked=0, Total=30800 [2025-04-13 18:03:15,432 INFO L437 NwaCegarLoop]: 146 mSDtfsCounter, 2583 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 6810 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2583 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 7103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 6810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:15,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2583 Valid, 2862 Invalid, 7103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 6810 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 18:03:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2025-04-13 18:03:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 3755. [2025-04-13 18:03:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 3.0183803942461376) internal successors, (11331), 3754 states have internal predecessors, (11331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 11331 transitions. [2025-04-13 18:03:15,520 INFO L79 Accepts]: Start accepts. Automaton has 3755 states and 11331 transitions. Word has length 55 [2025-04-13 18:03:15,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,521 INFO L485 AbstractCegarLoop]: Abstraction has 3755 states and 11331 transitions. [2025-04-13 18:03:15,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.6) internal successors, (126), 36 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,521 INFO L278 IsEmpty]: Start isEmpty. Operand 3755 states and 11331 transitions. [2025-04-13 18:03:15,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:15,527 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,528 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 18:03:15,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:03:15,728 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 18:03:15,728 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:15,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1085693449, now seen corresponding path program 6 times [2025-04-13 18:03:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595755919] [2025-04-13 18:03:15,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,737 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:15,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:15,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:15,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:15,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:15,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595755919] [2025-04-13 18:03:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595755919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:15,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731986934] [2025-04-13 18:03:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:15,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:15,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:15,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:15,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:15,803 INFO L87 Difference]: Start difference. First operand 3755 states and 11331 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 18:03:15,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:15,859 INFO L93 Difference]: Finished difference Result 5634 states and 16936 transitions. [2025-04-13 18:03:15,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:15,859 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 18:03:15,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:15,871 INFO L225 Difference]: With dead ends: 5634 [2025-04-13 18:03:15,871 INFO L226 Difference]: Without dead ends: 3755 [2025-04-13 18:03:15,874 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 18:03:15,875 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:15,875 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 60 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2025-04-13 18:03:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2025-04-13 18:03:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 3.005594033031433) internal successors, (11283), 3754 states have internal predecessors, (11283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 11283 transitions. [2025-04-13 18:03:15,961 INFO L79 Accepts]: Start accepts. Automaton has 3755 states and 11283 transitions. Word has length 55 [2025-04-13 18:03:15,961 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:15,961 INFO L485 AbstractCegarLoop]: Abstraction has 3755 states and 11283 transitions. [2025-04-13 18:03:15,961 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 18:03:15,961 INFO L278 IsEmpty]: Start isEmpty. Operand 3755 states and 11283 transitions. [2025-04-13 18:03:15,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:15,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:15,968 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 18:03:15,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:03:15,968 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:15,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1649330155, now seen corresponding path program 7 times [2025-04-13 18:03:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:15,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465558069] [2025-04-13 18:03:15,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:15,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:15,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:15,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:15,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:16,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465558069] [2025-04-13 18:03:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465558069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:16,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345737552] [2025-04-13 18:03:16,285 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:16,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:16,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:16,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:16,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:03:16,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:16,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:16,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:16,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:16,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 18:03:16,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:16,374 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 18:03:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:17,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:17,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345737552] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:17,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:17,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 14] total 32 [2025-04-13 18:03:17,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225030812] [2025-04-13 18:03:17,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:17,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:17,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:17,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:17,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:17,536 INFO L87 Difference]: Start difference. First operand 3755 states and 11283 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 18:03:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:19,072 INFO L93 Difference]: Finished difference Result 4924 states and 14589 transitions. [2025-04-13 18:03:19,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:03:19,072 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 18:03:19,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:19,105 INFO L225 Difference]: With dead ends: 4924 [2025-04-13 18:03:19,105 INFO L226 Difference]: Without dead ends: 4814 [2025-04-13 18:03:19,117 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=3541, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:03:19,118 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 442 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1664 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:19,118 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 644 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:03:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-04-13 18:03:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 3853. [2025-04-13 18:03:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3852 states have (on average 2.9963655244029077) internal successors, (11542), 3852 states have internal predecessors, (11542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 11542 transitions. [2025-04-13 18:03:19,333 INFO L79 Accepts]: Start accepts. Automaton has 3853 states and 11542 transitions. Word has length 55 [2025-04-13 18:03:19,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:19,334 INFO L485 AbstractCegarLoop]: Abstraction has 3853 states and 11542 transitions. [2025-04-13 18:03:19,334 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 18:03:19,334 INFO L278 IsEmpty]: Start isEmpty. Operand 3853 states and 11542 transitions. [2025-04-13 18:03:19,361 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:19,361 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:19,361 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 18:03:19,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:03:19,563 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 18:03:19,563 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:19,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1652818923, now seen corresponding path program 8 times [2025-04-13 18:03:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:19,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518204959] [2025-04-13 18:03:19,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:19,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:19,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:19,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:19,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:20,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518204959] [2025-04-13 18:03:20,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518204959] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:20,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052998200] [2025-04-13 18:03:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:20,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:20,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:20,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:20,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:20,076 INFO L87 Difference]: Start difference. First operand 3853 states and 11542 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 18:03:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:21,434 INFO L93 Difference]: Finished difference Result 4865 states and 14432 transitions. [2025-04-13 18:03:21,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:03:21,434 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 18:03:21,434 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:21,470 INFO L225 Difference]: With dead ends: 4865 [2025-04-13 18:03:21,471 INFO L226 Difference]: Without dead ends: 4645 [2025-04-13 18:03:21,473 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:03:21,478 INFO L437 NwaCegarLoop]: 112 mSDtfsCounter, 386 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 805 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.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:21,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 805 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:03:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-04-13 18:03:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3901. [2025-04-13 18:03:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3900 states have (on average 2.99025641025641) internal successors, (11662), 3900 states have internal predecessors, (11662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 11662 transitions. [2025-04-13 18:03:21,702 INFO L79 Accepts]: Start accepts. Automaton has 3901 states and 11662 transitions. Word has length 55 [2025-04-13 18:03:21,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:21,702 INFO L485 AbstractCegarLoop]: Abstraction has 3901 states and 11662 transitions. [2025-04-13 18:03:21,702 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 18:03:21,702 INFO L278 IsEmpty]: Start isEmpty. Operand 3901 states and 11662 transitions. [2025-04-13 18:03:21,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:21,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:21,716 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 18:03:21,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:03:21,716 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:21,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2064686029, now seen corresponding path program 9 times [2025-04-13 18:03:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:21,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917568290] [2025-04-13 18:03:21,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:21,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:21,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:21,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:21,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:21,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:21,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917568290] [2025-04-13 18:03:21,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917568290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:21,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:21,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:03:21,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528504044] [2025-04-13 18:03:21,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:21,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:03:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:21,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:03:21,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:03:21,977 INFO L87 Difference]: Start difference. First operand 3901 states and 11662 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:23,169 INFO L93 Difference]: Finished difference Result 5346 states and 15887 transitions. [2025-04-13 18:03:23,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 18:03:23,169 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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 18:03:23,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:23,205 INFO L225 Difference]: With dead ends: 5346 [2025-04-13 18:03:23,205 INFO L226 Difference]: Without dead ends: 5108 [2025-04-13 18:03:23,212 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:03:23,216 INFO L437 NwaCegarLoop]: 107 mSDtfsCounter, 426 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:23,217 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 619 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:03:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2025-04-13 18:03:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 4133. [2025-04-13 18:03:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4133 states, 4132 states have (on average 2.9869312681510163) internal successors, (12342), 4132 states have internal predecessors, (12342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4133 states to 4133 states and 12342 transitions. [2025-04-13 18:03:23,352 INFO L79 Accepts]: Start accepts. Automaton has 4133 states and 12342 transitions. Word has length 55 [2025-04-13 18:03:23,353 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:23,353 INFO L485 AbstractCegarLoop]: Abstraction has 4133 states and 12342 transitions. [2025-04-13 18:03:23,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:23,353 INFO L278 IsEmpty]: Start isEmpty. Operand 4133 states and 12342 transitions. [2025-04-13 18:03:23,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:23,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:23,359 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 18:03:23,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:03:23,359 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:23,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash 483357675, now seen corresponding path program 10 times [2025-04-13 18:03:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:23,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481856548] [2025-04-13 18:03:23,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:23,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:23,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:23,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:03:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:23,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:23,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481856548] [2025-04-13 18:03:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481856548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:23,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:03:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590978250] [2025-04-13 18:03:23,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:23,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:03:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:23,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:03:23,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:03:23,570 INFO L87 Difference]: Start difference. First operand 4133 states and 12342 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 18:03:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:23,687 INFO L93 Difference]: Finished difference Result 4999 states and 14655 transitions. [2025-04-13 18:03:23,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:03:23,688 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 18:03:23,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:23,698 INFO L225 Difference]: With dead ends: 4999 [2025-04-13 18:03:23,698 INFO L226 Difference]: Without dead ends: 3213 [2025-04-13 18:03:23,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:03:23,702 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 68 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:23,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:03:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2025-04-13 18:03:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 2957. [2025-04-13 18:03:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2956 states have (on average 2.8596075778078482) internal successors, (8453), 2956 states have internal predecessors, (8453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 8453 transitions. [2025-04-13 18:03:23,777 INFO L79 Accepts]: Start accepts. Automaton has 2957 states and 8453 transitions. Word has length 55 [2025-04-13 18:03:23,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:23,778 INFO L485 AbstractCegarLoop]: Abstraction has 2957 states and 8453 transitions. [2025-04-13 18:03:23,778 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 18:03:23,778 INFO L278 IsEmpty]: Start isEmpty. Operand 2957 states and 8453 transitions. [2025-04-13 18:03:23,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:23,791 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 18:03:23,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:03:23,791 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:23,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1051993497, now seen corresponding path program 11 times [2025-04-13 18:03:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:23,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401516058] [2025-04-13 18:03:23,791 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:23,797 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:23,811 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:23,811 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:24,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:24,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401516058] [2025-04-13 18:03:24,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401516058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:24,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869373854] [2025-04-13 18:03:24,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:24,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:24,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:24,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:24,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:03:24,816 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:24,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:24,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:24,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:24,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:03:24,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:24,882 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 18:03:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:25,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:26,674 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 55 treesize of output 49 [2025-04-13 18:03:26,685 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:03:26,685 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 64 treesize of output 49 [2025-04-13 18:03:26,752 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 18:03:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869373854] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:26,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 33 [2025-04-13 18:03:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617836481] [2025-04-13 18:03:26,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:26,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 18:03:26,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:26,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 18:03:26,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:26,789 INFO L87 Difference]: Start difference. First operand 2957 states and 8453 transitions. Second operand has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:29,095 INFO L93 Difference]: Finished difference Result 4251 states and 12035 transitions. [2025-04-13 18:03:29,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:03:29,096 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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 18:03:29,096 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:29,117 INFO L225 Difference]: With dead ends: 4251 [2025-04-13 18:03:29,117 INFO L226 Difference]: Without dead ends: 3703 [2025-04-13 18:03:29,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=639, Invalid=3267, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 18:03:29,124 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 913 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:29,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1035 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:03:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2025-04-13 18:03:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 2488. [2025-04-13 18:03:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 2.8886208283071975) internal successors, (7184), 2487 states have internal predecessors, (7184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 7184 transitions. [2025-04-13 18:03:29,180 INFO L79 Accepts]: Start accepts. Automaton has 2488 states and 7184 transitions. Word has length 55 [2025-04-13 18:03:29,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:29,180 INFO L485 AbstractCegarLoop]: Abstraction has 2488 states and 7184 transitions. [2025-04-13 18:03:29,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.090909090909091) internal successors, (135), 34 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:29,181 INFO L278 IsEmpty]: Start isEmpty. Operand 2488 states and 7184 transitions. [2025-04-13 18:03:29,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:29,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:29,185 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 18:03:29,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:03:29,389 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:29,389 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:29,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:29,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2084660201, now seen corresponding path program 12 times [2025-04-13 18:03:29,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:29,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20818775] [2025-04-13 18:03:29,389 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:29,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:29,400 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:29,461 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:29,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:29,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:29,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20818775] [2025-04-13 18:03:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20818775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:29,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137333738] [2025-04-13 18:03:29,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:29,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:29,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:29,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:29,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:29,621 INFO L87 Difference]: Start difference. First operand 2488 states and 7184 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 18:03:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:30,720 INFO L93 Difference]: Finished difference Result 3149 states and 9019 transitions. [2025-04-13 18:03:30,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:03:30,720 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 18:03:30,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:30,734 INFO L225 Difference]: With dead ends: 3149 [2025-04-13 18:03:30,734 INFO L226 Difference]: Without dead ends: 2965 [2025-04-13 18:03:30,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:03:30,737 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 333 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:30,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 736 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:03:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-04-13 18:03:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2498. [2025-04-13 18:03:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2497 states have (on average 2.8822587104525432) internal successors, (7197), 2497 states have internal predecessors, (7197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 7197 transitions. [2025-04-13 18:03:30,791 INFO L79 Accepts]: Start accepts. Automaton has 2498 states and 7197 transitions. Word has length 55 [2025-04-13 18:03:30,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:30,791 INFO L485 AbstractCegarLoop]: Abstraction has 2498 states and 7197 transitions. [2025-04-13 18:03:30,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 18:03:30,791 INFO L278 IsEmpty]: Start isEmpty. Operand 2498 states and 7197 transitions. [2025-04-13 18:03:30,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:30,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:30,795 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 18:03:30,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:03:30,796 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:30,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2101804887, now seen corresponding path program 13 times [2025-04-13 18:03:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:30,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706851676] [2025-04-13 18:03:30,797 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:30,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:30,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:30,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:30,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:31,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:31,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706851676] [2025-04-13 18:03:31,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706851676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:31,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539628884] [2025-04-13 18:03:31,195 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:31,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:31,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:31,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:03:31,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:31,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:31,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:31,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:03:31,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:31,278 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 18:03:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:32,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539628884] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 15] total 33 [2025-04-13 18:03:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162807] [2025-04-13 18:03:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:32,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:32,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:32,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:32,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:32,583 INFO L87 Difference]: Start difference. First operand 2498 states and 7197 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 18:03:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:33,460 INFO L93 Difference]: Finished difference Result 2912 states and 8350 transitions. [2025-04-13 18:03:33,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:03:33,460 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 18:03:33,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:33,467 INFO L225 Difference]: With dead ends: 2912 [2025-04-13 18:03:33,467 INFO L226 Difference]: Without dead ends: 2768 [2025-04-13 18:03:33,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=2508, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:03:33,473 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 241 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:33,473 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 597 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2025-04-13 18:03:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2598. [2025-04-13 18:03:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2597 states have (on average 2.8717751251443975) internal successors, (7458), 2597 states have internal predecessors, (7458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 7458 transitions. [2025-04-13 18:03:33,521 INFO L79 Accepts]: Start accepts. Automaton has 2598 states and 7458 transitions. Word has length 55 [2025-04-13 18:03:33,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:33,521 INFO L485 AbstractCegarLoop]: Abstraction has 2598 states and 7458 transitions. [2025-04-13 18:03:33,521 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 18:03:33,521 INFO L278 IsEmpty]: Start isEmpty. Operand 2598 states and 7458 transitions. [2025-04-13 18:03:33,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:33,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:33,525 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 18:03:33,531 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 18:03:33,728 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,SelfDestructingSolverStorable13 [2025-04-13 18:03:33,729 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:33,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1044162653, now seen corresponding path program 14 times [2025-04-13 18:03:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:33,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538550966] [2025-04-13 18:03:33,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:33,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:33,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:33,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:33,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:33,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:33,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538550966] [2025-04-13 18:03:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538550966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:33,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336512044] [2025-04-13 18:03:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:33,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:33,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:33,947 INFO L87 Difference]: Start difference. First operand 2598 states and 7458 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 18:03:34,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:34,845 INFO L93 Difference]: Finished difference Result 3146 states and 9027 transitions. [2025-04-13 18:03:34,845 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:03:34,845 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 18:03:34,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:34,853 INFO L225 Difference]: With dead ends: 3146 [2025-04-13 18:03:34,853 INFO L226 Difference]: Without dead ends: 2940 [2025-04-13 18:03:34,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:34,859 INFO L437 NwaCegarLoop]: 97 mSDtfsCounter, 282 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:34,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 718 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:03:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-04-13 18:03:34,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2566. [2025-04-13 18:03:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 2.868615984405458) internal successors, (7358), 2565 states have internal predecessors, (7358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 7358 transitions. [2025-04-13 18:03:34,942 INFO L79 Accepts]: Start accepts. Automaton has 2566 states and 7358 transitions. Word has length 55 [2025-04-13 18:03:34,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:34,946 INFO L485 AbstractCegarLoop]: Abstraction has 2566 states and 7358 transitions. [2025-04-13 18:03:34,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 18:03:34,947 INFO L278 IsEmpty]: Start isEmpty. Operand 2566 states and 7358 transitions. [2025-04-13 18:03:34,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:34,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:34,951 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 18:03:34,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:03:34,952 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:34,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1214065079, now seen corresponding path program 15 times [2025-04-13 18:03:34,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:34,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577659612] [2025-04-13 18:03:34,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:34,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:34,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:34,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:34,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:34,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:35,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577659612] [2025-04-13 18:03:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577659612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:35,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:35,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586555302] [2025-04-13 18:03:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:35,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:35,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:35,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:35,270 INFO L87 Difference]: Start difference. First operand 2566 states and 7358 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 18:03:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:35,972 INFO L93 Difference]: Finished difference Result 3006 states and 8590 transitions. [2025-04-13 18:03:35,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:03:35,973 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 55 [2025-04-13 18:03:35,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:35,980 INFO L225 Difference]: With dead ends: 3006 [2025-04-13 18:03:35,980 INFO L226 Difference]: Without dead ends: 2942 [2025-04-13 18:03:35,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:35,982 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 208 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:35,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 548 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2942 states. [2025-04-13 18:03:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2942 to 2576. [2025-04-13 18:03:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2575 states have (on average 2.8858252427184468) internal successors, (7431), 2575 states have internal predecessors, (7431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 7431 transitions. [2025-04-13 18:03:36,026 INFO L79 Accepts]: Start accepts. Automaton has 2576 states and 7431 transitions. Word has length 55 [2025-04-13 18:03:36,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:36,026 INFO L485 AbstractCegarLoop]: Abstraction has 2576 states and 7431 transitions. [2025-04-13 18:03:36,026 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 18:03:36,026 INFO L278 IsEmpty]: Start isEmpty. Operand 2576 states and 7431 transitions. [2025-04-13 18:03:36,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:36,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:36,029 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 18:03:36,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:03:36,030 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:36,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash -276299219, now seen corresponding path program 16 times [2025-04-13 18:03:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:36,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415505345] [2025-04-13 18:03:36,030 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:36,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:36,042 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 18:03:36,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:03:36,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:36,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:36,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415505345] [2025-04-13 18:03:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415505345] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753965469] [2025-04-13 18:03:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:36,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:36,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:36,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:36,214 INFO L87 Difference]: Start difference. First operand 2576 states and 7431 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 18:03:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:36,956 INFO L93 Difference]: Finished difference Result 3248 states and 9336 transitions. [2025-04-13 18:03:36,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:03:36,956 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 18:03:36,956 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:36,963 INFO L225 Difference]: With dead ends: 3248 [2025-04-13 18:03:36,963 INFO L226 Difference]: Without dead ends: 3084 [2025-04-13 18:03:36,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:03:36,966 INFO L437 NwaCegarLoop]: 106 mSDtfsCounter, 352 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:36,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 785 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:36,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-04-13 18:03:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2646. [2025-04-13 18:03:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2646 states, 2645 states have (on average 2.8744801512287332) internal successors, (7603), 2645 states have internal predecessors, (7603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 7603 transitions. [2025-04-13 18:03:36,999 INFO L79 Accepts]: Start accepts. Automaton has 2646 states and 7603 transitions. Word has length 55 [2025-04-13 18:03:37,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:37,000 INFO L485 AbstractCegarLoop]: Abstraction has 2646 states and 7603 transitions. [2025-04-13 18:03:37,000 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 18:03:37,000 INFO L278 IsEmpty]: Start isEmpty. Operand 2646 states and 7603 transitions. [2025-04-13 18:03:37,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:37,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:37,003 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 18:03:37,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:03:37,003 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:37,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:37,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1775397273, now seen corresponding path program 17 times [2025-04-13 18:03:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:37,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854851471] [2025-04-13 18:03:37,005 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:37,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:37,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:37,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:37,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:37,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854851471] [2025-04-13 18:03:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854851471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:37,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93223078] [2025-04-13 18:03:37,547 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:37,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:03:37,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:37,633 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:37,633 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:37,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:37,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 18:03:37,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:37,933 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 18:03:37,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:37,935 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2025-04-13 18:03:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:38,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:38,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:38,285 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 33 [2025-04-13 18:03:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93223078] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:38,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:38,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2025-04-13 18:03:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352537499] [2025-04-13 18:03:38,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:38,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 18:03:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:38,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 18:03:38,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:38,526 INFO L87 Difference]: Start difference. First operand 2646 states and 7603 transitions. Second operand has 30 states, 29 states have (on average 4.620689655172414) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:39,588 INFO L93 Difference]: Finished difference Result 4307 states and 12114 transitions. [2025-04-13 18:03:39,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:03:39,589 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.620689655172414) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have 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 18:03:39,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:39,602 INFO L225 Difference]: With dead ends: 4307 [2025-04-13 18:03:39,602 INFO L226 Difference]: Without dead ends: 4257 [2025-04-13 18:03:39,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=511, Invalid=2141, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:03:39,604 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 698 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:39,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 751 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-04-13 18:03:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 2786. [2025-04-13 18:03:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 2.8692998204667863) internal successors, (7991), 2785 states have internal predecessors, (7991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 7991 transitions. [2025-04-13 18:03:39,649 INFO L79 Accepts]: Start accepts. Automaton has 2786 states and 7991 transitions. Word has length 55 [2025-04-13 18:03:39,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:39,649 INFO L485 AbstractCegarLoop]: Abstraction has 2786 states and 7991 transitions. [2025-04-13 18:03:39,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.620689655172414) internal successors, (134), 30 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:39,650 INFO L278 IsEmpty]: Start isEmpty. Operand 2786 states and 7991 transitions. [2025-04-13 18:03:39,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:39,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:39,656 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 18:03:39,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:03:39,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:03:39,857 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:39,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1794458475, now seen corresponding path program 18 times [2025-04-13 18:03:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:39,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276451576] [2025-04-13 18:03:39,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:39,873 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:39,880 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:39,880 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:40,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:40,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276451576] [2025-04-13 18:03:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276451576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:40,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:40,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112687603] [2025-04-13 18:03:40,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:40,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:40,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:40,030 INFO L87 Difference]: Start difference. First operand 2786 states and 7991 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 18:03:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:41,004 INFO L93 Difference]: Finished difference Result 3322 states and 9482 transitions. [2025-04-13 18:03:41,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:03:41,004 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 55 [2025-04-13 18:03:41,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:41,012 INFO L225 Difference]: With dead ends: 3322 [2025-04-13 18:03:41,019 INFO L226 Difference]: Without dead ends: 3258 [2025-04-13 18:03:41,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:03:41,021 INFO L437 NwaCegarLoop]: 101 mSDtfsCounter, 351 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:41,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 843 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:03:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2025-04-13 18:03:41,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 2746. [2025-04-13 18:03:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 2.8808743169398907) internal successors, (7908), 2745 states have internal predecessors, (7908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 7908 transitions. [2025-04-13 18:03:41,076 INFO L79 Accepts]: Start accepts. Automaton has 2746 states and 7908 transitions. Word has length 55 [2025-04-13 18:03:41,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:41,076 INFO L485 AbstractCegarLoop]: Abstraction has 2746 states and 7908 transitions. [2025-04-13 18:03:41,076 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 18:03:41,076 INFO L278 IsEmpty]: Start isEmpty. Operand 2746 states and 7908 transitions. [2025-04-13 18:03:41,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:41,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:41,082 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 18:03:41,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:03:41,082 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:41,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:41,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1070741763, now seen corresponding path program 19 times [2025-04-13 18:03:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:41,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453601874] [2025-04-13 18:03:41,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:41,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:41,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:41,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:41,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:41,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453601874] [2025-04-13 18:03:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453601874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:41,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878828776] [2025-04-13 18:03:41,316 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:41,318 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:41,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:03:41,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:41,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:41,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:41,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:41,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 18:03:41,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:41,403 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 18:03:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:41,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878828776] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 15] total 32 [2025-04-13 18:03:42,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832059168] [2025-04-13 18:03:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:42,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:42,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:42,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:42,314 INFO L87 Difference]: Start difference. First operand 2746 states and 7908 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 18:03:43,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:43,173 INFO L93 Difference]: Finished difference Result 3032 states and 8671 transitions. [2025-04-13 18:03:43,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:43,173 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 18:03:43,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:43,181 INFO L225 Difference]: With dead ends: 3032 [2025-04-13 18:03:43,181 INFO L226 Difference]: Without dead ends: 2962 [2025-04-13 18:03:43,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=236, Invalid=2314, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:03:43,184 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 211 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:43,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 554 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:03:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2025-04-13 18:03:43,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2726. [2025-04-13 18:03:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2726 states, 2725 states have (on average 2.8777981651376145) internal successors, (7842), 2725 states have internal predecessors, (7842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 7842 transitions. [2025-04-13 18:03:43,218 INFO L79 Accepts]: Start accepts. Automaton has 2726 states and 7842 transitions. Word has length 55 [2025-04-13 18:03:43,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:43,218 INFO L485 AbstractCegarLoop]: Abstraction has 2726 states and 7842 transitions. [2025-04-13 18:03:43,218 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 18:03:43,218 INFO L278 IsEmpty]: Start isEmpty. Operand 2726 states and 7842 transitions. [2025-04-13 18:03:43,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:43,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:43,221 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 18:03:43,228 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 18:03:43,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:43,423 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:03:43,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:43,423 INFO L85 PathProgramCache]: Analyzing trace with hash 155376717, now seen corresponding path program 20 times [2025-04-13 18:03:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:43,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979396996] [2025-04-13 18:03:43,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:43,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:43,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:43,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:43,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:43,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979396996] [2025-04-13 18:03:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979396996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:43,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450224098] [2025-04-13 18:03:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:43,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:43,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:43,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:43,657 INFO L87 Difference]: Start difference. First operand 2726 states and 7842 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 18:03:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:44,151 INFO L93 Difference]: Finished difference Result 2952 states and 8436 transitions. [2025-04-13 18:03:44,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:03:44,151 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 55 [2025-04-13 18:03:44,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:44,157 INFO L225 Difference]: With dead ends: 2952 [2025-04-13 18:03:44,158 INFO L226 Difference]: Without dead ends: 2887 [2025-04-13 18:03:44,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:03:44,159 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 228 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:44,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 572 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2025-04-13 18:03:44,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2781. [2025-04-13 18:03:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 2.8615107913669067) internal successors, (7955), 2780 states have internal predecessors, (7955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 7955 transitions. [2025-04-13 18:03:44,197 INFO L79 Accepts]: Start accepts. Automaton has 2781 states and 7955 transitions. Word has length 55 [2025-04-13 18:03:44,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:44,197 INFO L485 AbstractCegarLoop]: Abstraction has 2781 states and 7955 transitions. [2025-04-13 18:03:44,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 18:03:44,197 INFO L278 IsEmpty]: Start isEmpty. Operand 2781 states and 7955 transitions. [2025-04-13 18:03:44,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:44,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:44,202 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 18:03:44,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:03:44,202 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 18:03:44,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash -537573419, now seen corresponding path program 21 times [2025-04-13 18:03:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:44,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770861390] [2025-04-13 18:03:44,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:44,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:44,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:44,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:44,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770861390] [2025-04-13 18:03:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770861390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:44,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533159217] [2025-04-13 18:03:44,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:44,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:44,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:44,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:44,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:44,342 INFO L87 Difference]: Start difference. First operand 2781 states and 7955 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 18:03:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:44,873 INFO L93 Difference]: Finished difference Result 3122 states and 8916 transitions. [2025-04-13 18:03:44,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:03:44,874 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 55 [2025-04-13 18:03:44,875 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:44,881 INFO L225 Difference]: With dead ends: 3122 [2025-04-13 18:03:44,881 INFO L226 Difference]: Without dead ends: 3018 [2025-04-13 18:03:44,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:03:44,883 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 194 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:44,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 544 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:03:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-04-13 18:03:44,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2796. [2025-04-13 18:03:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2795 states have (on average 2.872271914132379) internal successors, (8028), 2795 states have internal predecessors, (8028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 8028 transitions. [2025-04-13 18:03:44,915 INFO L79 Accepts]: Start accepts. Automaton has 2796 states and 8028 transitions. Word has length 55 [2025-04-13 18:03:44,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:44,915 INFO L485 AbstractCegarLoop]: Abstraction has 2796 states and 8028 transitions. [2025-04-13 18:03:44,915 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 18:03:44,915 INFO L278 IsEmpty]: Start isEmpty. Operand 2796 states and 8028 transitions. [2025-04-13 18:03:44,918 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:44,918 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:44,918 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 18:03:44,918 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:03:44,918 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 18:03:44,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -2142438613, now seen corresponding path program 22 times [2025-04-13 18:03:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:44,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598921869] [2025-04-13 18:03:44,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:44,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:44,933 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 18:03:44,933 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:03:44,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:45,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598921869] [2025-04-13 18:03:45,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598921869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:45,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:45,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975200595] [2025-04-13 18:03:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:45,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:45,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:45,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:45,049 INFO L87 Difference]: Start difference. First operand 2796 states and 8028 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 18:03:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:45,491 INFO L93 Difference]: Finished difference Result 2925 states and 8385 transitions. [2025-04-13 18:03:45,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:03:45,492 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 55 [2025-04-13 18:03:45,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:45,498 INFO L225 Difference]: With dead ends: 2925 [2025-04-13 18:03:45,498 INFO L226 Difference]: Without dead ends: 2832 [2025-04-13 18:03:45,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:03:45,499 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 215 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:45,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 575 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2025-04-13 18:03:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2731. [2025-04-13 18:03:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 2730 states have (on average 2.887179487179487) internal successors, (7882), 2730 states have internal predecessors, (7882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 7882 transitions. [2025-04-13 18:03:45,526 INFO L79 Accepts]: Start accepts. Automaton has 2731 states and 7882 transitions. Word has length 55 [2025-04-13 18:03:45,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:45,526 INFO L485 AbstractCegarLoop]: Abstraction has 2731 states and 7882 transitions. [2025-04-13 18:03:45,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 18:03:45,527 INFO L278 IsEmpty]: Start isEmpty. Operand 2731 states and 7882 transitions. [2025-04-13 18:03:45,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:45,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:45,529 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 18:03:45,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:03:45,529 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 18:03:45,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash 401045785, now seen corresponding path program 23 times [2025-04-13 18:03:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:45,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914296045] [2025-04-13 18:03:45,530 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:45,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:45,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:45,540 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:45,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:45,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914296045] [2025-04-13 18:03:45,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914296045] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:45,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6015379] [2025-04-13 18:03:45,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:45,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:45,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:45,999 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:46,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:03:46,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:46,064 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:46,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:46,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:46,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:03:46,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:46,080 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 18:03:46,465 INFO L325 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-04-13 18:03:46,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 24 [2025-04-13 18:03:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:46,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:47,197 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 70 treesize of output 62 [2025-04-13 18:03:47,212 INFO L325 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-04-13 18:03:47,212 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 87 [2025-04-13 18:03:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:47,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6015379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:03:47,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:03:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 37 [2025-04-13 18:03:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404759755] [2025-04-13 18:03:47,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:03:47,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:03:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:47,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:03:47,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:03:47,316 INFO L87 Difference]: Start difference. First operand 2731 states and 7882 transitions. Second operand has 38 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 38 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 18:03:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:52,044 INFO L93 Difference]: Finished difference Result 4608 states and 12972 transitions. [2025-04-13 18:03:52,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 18:03:52,045 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 38 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 18:03:52,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:52,052 INFO L225 Difference]: With dead ends: 4608 [2025-04-13 18:03:52,052 INFO L226 Difference]: Without dead ends: 3530 [2025-04-13 18:03:52,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1212, Invalid=6978, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 18:03:52,054 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 1326 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 3154 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 2018 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:52,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 2018 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3154 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:03:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2025-04-13 18:03:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 2710. [2025-04-13 18:03:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 2.8667404946474715) internal successors, (7766), 2709 states have internal predecessors, (7766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 7766 transitions. [2025-04-13 18:03:52,084 INFO L79 Accepts]: Start accepts. Automaton has 2710 states and 7766 transitions. Word has length 55 [2025-04-13 18:03:52,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:52,084 INFO L485 AbstractCegarLoop]: Abstraction has 2710 states and 7766 transitions. [2025-04-13 18:03:52,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.5135135135135136) internal successors, (130), 38 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 18:03:52,084 INFO L278 IsEmpty]: Start isEmpty. Operand 2710 states and 7766 transitions. [2025-04-13 18:03:52,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:52,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:52,087 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 18:03:52,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:03:52,287 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,SelfDestructingSolverStorable23 [2025-04-13 18:03:52,287 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 18:03:52,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1845056475, now seen corresponding path program 24 times [2025-04-13 18:03:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:52,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498073554] [2025-04-13 18:03:52,288 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:52,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:52,293 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:52,300 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:52,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:52,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498073554] [2025-04-13 18:03:52,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498073554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:52,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:52,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:52,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643219634] [2025-04-13 18:03:52,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:52,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:52,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:52,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:52,461 INFO L87 Difference]: Start difference. First operand 2710 states and 7766 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 18:03:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:53,028 INFO L93 Difference]: Finished difference Result 3513 states and 10037 transitions. [2025-04-13 18:03:53,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:03:53,028 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 18:03:53,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:53,036 INFO L225 Difference]: With dead ends: 3513 [2025-04-13 18:03:53,036 INFO L226 Difference]: Without dead ends: 3329 [2025-04-13 18:03:53,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:03:53,037 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 329 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:53,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 693 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2025-04-13 18:03:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 2730. [2025-04-13 18:03:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2729 states have (on average 2.866251374129718) internal successors, (7822), 2729 states have internal predecessors, (7822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 7822 transitions. [2025-04-13 18:03:53,066 INFO L79 Accepts]: Start accepts. Automaton has 2730 states and 7822 transitions. Word has length 55 [2025-04-13 18:03:53,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:53,066 INFO L485 AbstractCegarLoop]: Abstraction has 2730 states and 7822 transitions. [2025-04-13 18:03:53,066 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 18:03:53,066 INFO L278 IsEmpty]: Start isEmpty. Operand 2730 states and 7822 transitions. [2025-04-13 18:03:53,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:53,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:53,068 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 18:03:53,068 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:03:53,068 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 18:03:53,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:53,069 INFO L85 PathProgramCache]: Analyzing trace with hash -537412839, now seen corresponding path program 25 times [2025-04-13 18:03:53,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:53,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203980904] [2025-04-13 18:03:53,069 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:53,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:53,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203980904] [2025-04-13 18:03:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203980904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:03:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682420813] [2025-04-13 18:03:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:53,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:03:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:53,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:03:53,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:03:53,095 INFO L87 Difference]: Start difference. First operand 2730 states and 7822 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 18:03:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:53,138 INFO L93 Difference]: Finished difference Result 3542 states and 10059 transitions. [2025-04-13 18:03:53,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:03:53,138 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 18:03:53,139 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:53,145 INFO L225 Difference]: With dead ends: 3542 [2025-04-13 18:03:53,145 INFO L226 Difference]: Without dead ends: 2668 [2025-04-13 18:03:53,147 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 18:03:53,147 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:53,147 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 60 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:03:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2025-04-13 18:03:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2668. [2025-04-13 18:03:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2668 states, 2667 states have (on average 2.8567679040119986) internal successors, (7619), 2667 states have internal predecessors, (7619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2668 states to 2668 states and 7619 transitions. [2025-04-13 18:03:53,174 INFO L79 Accepts]: Start accepts. Automaton has 2668 states and 7619 transitions. Word has length 55 [2025-04-13 18:03:53,174 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:53,174 INFO L485 AbstractCegarLoop]: Abstraction has 2668 states and 7619 transitions. [2025-04-13 18:03:53,174 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 18:03:53,174 INFO L278 IsEmpty]: Start isEmpty. Operand 2668 states and 7619 transitions. [2025-04-13 18:03:53,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:53,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:53,177 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 18:03:53,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:03:53,177 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 18:03:53,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:53,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1085507771, now seen corresponding path program 26 times [2025-04-13 18:03:53,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:53,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551735044] [2025-04-13 18:03:53,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:53,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:53,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:53,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:53,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:53,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:53,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551735044] [2025-04-13 18:03:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551735044] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291784520] [2025-04-13 18:03:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:53,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:53,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:53,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:53,322 INFO L87 Difference]: Start difference. First operand 2668 states and 7619 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 18:03:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:53,936 INFO L93 Difference]: Finished difference Result 3288 states and 9419 transitions. [2025-04-13 18:03:53,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:03:53,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 55 [2025-04-13 18:03:53,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:53,945 INFO L225 Difference]: With dead ends: 3288 [2025-04-13 18:03:53,945 INFO L226 Difference]: Without dead ends: 3229 [2025-04-13 18:03:53,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:03:53,946 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 345 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:53,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 606 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:03:53,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2025-04-13 18:03:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 2782. [2025-04-13 18:03:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2781 states have (on average 2.8651564185544767) internal successors, (7968), 2781 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 7968 transitions. [2025-04-13 18:03:53,976 INFO L79 Accepts]: Start accepts. Automaton has 2782 states and 7968 transitions. Word has length 55 [2025-04-13 18:03:53,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:53,976 INFO L485 AbstractCegarLoop]: Abstraction has 2782 states and 7968 transitions. [2025-04-13 18:03:53,977 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 18:03:53,977 INFO L278 IsEmpty]: Start isEmpty. Operand 2782 states and 7968 transitions. [2025-04-13 18:03:53,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:53,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:53,979 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 18:03:53,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:03:53,979 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 18:03:53,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash 881773739, now seen corresponding path program 27 times [2025-04-13 18:03:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:53,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138110597] [2025-04-13 18:03:53,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:03:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:53,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:53,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:53,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:03:53,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:54,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138110597] [2025-04-13 18:03:54,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138110597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:54,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:54,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:54,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375191134] [2025-04-13 18:03:54,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:54,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:54,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:54,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:54,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:54,137 INFO L87 Difference]: Start difference. First operand 2782 states and 7968 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 18:03:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:54,708 INFO L93 Difference]: Finished difference Result 3693 states and 10555 transitions. [2025-04-13 18:03:54,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:03:54,708 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 18:03:54,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:54,717 INFO L225 Difference]: With dead ends: 3693 [2025-04-13 18:03:54,717 INFO L226 Difference]: Without dead ends: 3568 [2025-04-13 18:03:54,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:03:54,719 INFO L437 NwaCegarLoop]: 102 mSDtfsCounter, 367 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:54,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 742 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:03:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2025-04-13 18:03:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 2738. [2025-04-13 18:03:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2737 states have (on average 2.8447204968944098) internal successors, (7786), 2737 states have internal predecessors, (7786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 7786 transitions. [2025-04-13 18:03:54,766 INFO L79 Accepts]: Start accepts. Automaton has 2738 states and 7786 transitions. Word has length 55 [2025-04-13 18:03:54,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:54,766 INFO L485 AbstractCegarLoop]: Abstraction has 2738 states and 7786 transitions. [2025-04-13 18:03:54,766 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 18:03:54,766 INFO L278 IsEmpty]: Start isEmpty. Operand 2738 states and 7786 transitions. [2025-04-13 18:03:54,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:54,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:54,769 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 18:03:54,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:03:54,769 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 18:03:54,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:54,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2062896835, now seen corresponding path program 28 times [2025-04-13 18:03:54,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:54,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396969660] [2025-04-13 18:03:54,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:03:54,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:54,775 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:54,779 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 18:03:54,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:03:54,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:54,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:54,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396969660] [2025-04-13 18:03:54,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396969660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:54,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:54,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:03:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335433739] [2025-04-13 18:03:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:54,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:03:54,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:54,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:03:54,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:03:54,891 INFO L87 Difference]: Start difference. First operand 2738 states and 7786 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 18:03:55,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:55,364 INFO L93 Difference]: Finished difference Result 3166 states and 9041 transitions. [2025-04-13 18:03:55,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:03:55,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 55 [2025-04-13 18:03:55,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:55,373 INFO L225 Difference]: With dead ends: 3166 [2025-04-13 18:03:55,373 INFO L226 Difference]: Without dead ends: 3133 [2025-04-13 18:03:55,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:55,374 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:55,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 583 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-04-13 18:03:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 2730. [2025-04-13 18:03:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2729 states have (on average 2.844265298644192) internal successors, (7762), 2729 states have internal predecessors, (7762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 7762 transitions. [2025-04-13 18:03:55,404 INFO L79 Accepts]: Start accepts. Automaton has 2730 states and 7762 transitions. Word has length 55 [2025-04-13 18:03:55,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:55,404 INFO L485 AbstractCegarLoop]: Abstraction has 2730 states and 7762 transitions. [2025-04-13 18:03:55,404 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 18:03:55,404 INFO L278 IsEmpty]: Start isEmpty. Operand 2730 states and 7762 transitions. [2025-04-13 18:03:55,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:55,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:55,407 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 18:03:55,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:03:55,407 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 18:03:55,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1824659959, now seen corresponding path program 29 times [2025-04-13 18:03:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:55,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703789055] [2025-04-13 18:03:55,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:55,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:55,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:55,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:55,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:55,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:55,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:55,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703789055] [2025-04-13 18:03:55,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703789055] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:55,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506177042] [2025-04-13 18:03:55,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:03:55,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:55,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:55,703 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:55,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:03:55,747 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:55,764 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:55,764 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:03:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:55,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:03:55,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:55,774 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 18:03:55,976 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:03:55,976 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 27 treesize of output 20 [2025-04-13 18:03:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:55,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:56,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506177042] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:56,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:56,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9, 14] total 29 [2025-04-13 18:03:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859742539] [2025-04-13 18:03:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:56,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:03:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:56,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:03:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:03:56,161 INFO L87 Difference]: Start difference. First operand 2730 states and 7762 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:56,838 INFO L93 Difference]: Finished difference Result 3154 states and 9009 transitions. [2025-04-13 18:03:56,838 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:03:56,838 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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 18:03:56,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:56,846 INFO L225 Difference]: With dead ends: 3154 [2025-04-13 18:03:56,846 INFO L226 Difference]: Without dead ends: 3073 [2025-04-13 18:03:56,847 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:03:56,847 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 281 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:56,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 622 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:03:56,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2025-04-13 18:03:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2678. [2025-04-13 18:03:56,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2677 states have (on average 2.8546880836757564) internal successors, (7642), 2677 states have internal predecessors, (7642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 7642 transitions. [2025-04-13 18:03:56,875 INFO L79 Accepts]: Start accepts. Automaton has 2678 states and 7642 transitions. Word has length 55 [2025-04-13 18:03:56,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:56,875 INFO L485 AbstractCegarLoop]: Abstraction has 2678 states and 7642 transitions. [2025-04-13 18:03:56,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:56,875 INFO L278 IsEmpty]: Start isEmpty. Operand 2678 states and 7642 transitions. [2025-04-13 18:03:56,878 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:56,878 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:56,878 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 18:03:56,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 18:03:57,078 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 18:03:57,078 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 18:03:57,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 678912033, now seen corresponding path program 30 times [2025-04-13 18:03:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:57,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433702826] [2025-04-13 18:03:57,079 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:03:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:57,086 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:57,094 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:57,094 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:03:57,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:57,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:57,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433702826] [2025-04-13 18:03:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433702826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:57,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339177746] [2025-04-13 18:03:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:57,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:57,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:57,228 INFO L87 Difference]: Start difference. First operand 2678 states and 7642 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 18:03:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:57,669 INFO L93 Difference]: Finished difference Result 3358 states and 9624 transitions. [2025-04-13 18:03:57,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:03:57,669 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 18:03:57,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:57,676 INFO L225 Difference]: With dead ends: 3358 [2025-04-13 18:03:57,677 INFO L226 Difference]: Without dead ends: 3174 [2025-04-13 18:03:57,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:03:57,678 INFO L437 NwaCegarLoop]: 92 mSDtfsCounter, 271 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:57,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 681 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2025-04-13 18:03:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2658. [2025-04-13 18:03:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2657 states have (on average 2.8550997365449757) internal successors, (7586), 2657 states have internal predecessors, (7586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 7586 transitions. [2025-04-13 18:03:57,705 INFO L79 Accepts]: Start accepts. Automaton has 2658 states and 7586 transitions. Word has length 55 [2025-04-13 18:03:57,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:57,705 INFO L485 AbstractCegarLoop]: Abstraction has 2658 states and 7586 transitions. [2025-04-13 18:03:57,706 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 18:03:57,706 INFO L278 IsEmpty]: Start isEmpty. Operand 2658 states and 7586 transitions. [2025-04-13 18:03:57,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:57,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:57,708 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 18:03:57,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:03:57,708 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 18:03:57,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -10789867, now seen corresponding path program 31 times [2025-04-13 18:03:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:57,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815405946] [2025-04-13 18:03:57,709 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:57,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:57,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:57,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:57,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:57,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:57,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:57,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815405946] [2025-04-13 18:03:57,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815405946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:57,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687019403] [2025-04-13 18:03:57,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:03:57,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:03:57,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:03:57,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:03:57,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:03:57,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-13 18:03:58,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:03:58,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:03:58,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:58,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 18:03:58,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:03:58,014 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 18:03:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:03:58,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:03:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687019403] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:03:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:03:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 14] total 33 [2025-04-13 18:03:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905156282] [2025-04-13 18:03:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:58,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:03:58,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:58,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:03:58,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:03:58,600 INFO L87 Difference]: Start difference. First operand 2658 states and 7586 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 18:03:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:03:59,241 INFO L93 Difference]: Finished difference Result 3002 states and 8548 transitions. [2025-04-13 18:03:59,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:03:59,241 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 18:03:59,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:03:59,248 INFO L225 Difference]: With dead ends: 3002 [2025-04-13 18:03:59,248 INFO L226 Difference]: Without dead ends: 2878 [2025-04-13 18:03:59,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=2380, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:03:59,249 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 262 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:03:59,249 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 583 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:03:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-04-13 18:03:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2746. [2025-04-13 18:03:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 2.8517304189435335) internal successors, (7828), 2745 states have internal predecessors, (7828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:03:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 7828 transitions. [2025-04-13 18:03:59,278 INFO L79 Accepts]: Start accepts. Automaton has 2746 states and 7828 transitions. Word has length 55 [2025-04-13 18:03:59,279 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:03:59,279 INFO L485 AbstractCegarLoop]: Abstraction has 2746 states and 7828 transitions. [2025-04-13 18:03:59,279 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 18:03:59,279 INFO L278 IsEmpty]: Start isEmpty. Operand 2746 states and 7828 transitions. [2025-04-13 18:03:59,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:03:59,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:03:59,281 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 18:03:59,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:03:59,481 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 18:03:59,482 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 18:03:59,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:03:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1538016899, now seen corresponding path program 32 times [2025-04-13 18:03:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:03:59,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415889470] [2025-04-13 18:03:59,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:03:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:03:59,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:03:59,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:03:59,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:03:59,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:03:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:03:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:03:59,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415889470] [2025-04-13 18:03:59,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415889470] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:03:59,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:03:59,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:03:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141972595] [2025-04-13 18:03:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:03:59,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:03:59,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:03:59,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:03:59,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:03:59,622 INFO L87 Difference]: Start difference. First operand 2746 states and 7828 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 18:04:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,045 INFO L93 Difference]: Finished difference Result 2943 states and 8355 transitions. [2025-04-13 18:04:00,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:04:00,045 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 18:04:00,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,052 INFO L225 Difference]: With dead ends: 2943 [2025-04-13 18:04:00,052 INFO L226 Difference]: Without dead ends: 2865 [2025-04-13 18:04:00,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:04:00,053 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 254 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 607 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 18:04:00,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 607 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2025-04-13 18:04:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2746. [2025-04-13 18:04:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 2.8517304189435335) internal successors, (7828), 2745 states have internal predecessors, (7828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 7828 transitions. [2025-04-13 18:04:00,081 INFO L79 Accepts]: Start accepts. Automaton has 2746 states and 7828 transitions. Word has length 55 [2025-04-13 18:04:00,081 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,081 INFO L485 AbstractCegarLoop]: Abstraction has 2746 states and 7828 transitions. [2025-04-13 18:04:00,081 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 18:04:00,081 INFO L278 IsEmpty]: Start isEmpty. Operand 2746 states and 7828 transitions. [2025-04-13 18:04:00,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:04:00,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,084 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 18:04:00,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:04:00,084 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 18:04:00,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,084 INFO L85 PathProgramCache]: Analyzing trace with hash -136024237, now seen corresponding path program 33 times [2025-04-13 18:04:00,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835233834] [2025-04-13 18:04:00,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:04:00,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 55 statements. [2025-04-13 18:04:00,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:00,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835233834] [2025-04-13 18:04:00,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835233834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:00,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795169463] [2025-04-13 18:04:00,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:00,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:00,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:00,203 INFO L87 Difference]: Start difference. First operand 2746 states and 7828 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 18:04:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:00,583 INFO L93 Difference]: Finished difference Result 3066 states and 8712 transitions. [2025-04-13 18:04:00,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:00,583 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 18:04:00,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:00,591 INFO L225 Difference]: With dead ends: 3066 [2025-04-13 18:04:00,591 INFO L226 Difference]: Without dead ends: 3007 [2025-04-13 18:04:00,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:04:00,592 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 220 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:00,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 542 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-04-13 18:04:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2850. [2025-04-13 18:04:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2849 states have (on average 2.8585468585468585) internal successors, (8144), 2849 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 8144 transitions. [2025-04-13 18:04:00,622 INFO L79 Accepts]: Start accepts. Automaton has 2850 states and 8144 transitions. Word has length 55 [2025-04-13 18:04:00,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:00,622 INFO L485 AbstractCegarLoop]: Abstraction has 2850 states and 8144 transitions. [2025-04-13 18:04:00,622 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 18:04:00,622 INFO L278 IsEmpty]: Start isEmpty. Operand 2850 states and 8144 transitions. [2025-04-13 18:04:00,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:04:00,625 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:00,625 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 18:04:00,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:04:00,625 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 18:04:00,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:00,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1319310655, now seen corresponding path program 34 times [2025-04-13 18:04:00,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:00,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950846201] [2025-04-13 18:04:00,626 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:00,630 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:04:00,633 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 18:04:00,633 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:00,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:04:00,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:00,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950846201] [2025-04-13 18:04:00,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950846201] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:00,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:00,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040054310] [2025-04-13 18:04:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:00,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:00,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:00,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:00,722 INFO L87 Difference]: Start difference. First operand 2850 states and 8144 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 18:04:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:01,201 INFO L93 Difference]: Finished difference Result 3059 states and 8699 transitions. [2025-04-13 18:04:01,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:04:01,201 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 18:04:01,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:01,209 INFO L225 Difference]: With dead ends: 3059 [2025-04-13 18:04:01,209 INFO L226 Difference]: Without dead ends: 3000 [2025-04-13 18:04:01,210 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 18:04:01,210 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 248 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:01,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 584 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2025-04-13 18:04:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 2862. [2025-04-13 18:04:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2861 states have (on average 2.856343935686823) internal successors, (8172), 2861 states have internal predecessors, (8172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 8172 transitions. [2025-04-13 18:04:01,271 INFO L79 Accepts]: Start accepts. Automaton has 2862 states and 8172 transitions. Word has length 55 [2025-04-13 18:04:01,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:01,271 INFO L485 AbstractCegarLoop]: Abstraction has 2862 states and 8172 transitions. [2025-04-13 18:04:01,271 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 18:04:01,271 INFO L278 IsEmpty]: Start isEmpty. Operand 2862 states and 8172 transitions. [2025-04-13 18:04:01,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-04-13 18:04:01,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:01,274 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 18:04:01,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:04:01,276 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 18:04:01,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:01,276 INFO L85 PathProgramCache]: Analyzing trace with hash -232756203, now seen corresponding path program 35 times [2025-04-13 18:04:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:01,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971736219] [2025-04-13 18:04:01,276 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:01,281 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:04:01,288 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:04:01,288 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:01,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:01,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971736219] [2025-04-13 18:04:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971736219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:01,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056640935] [2025-04-13 18:04:01,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:01,596 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 18:04:01,598 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 18:04:01,643 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-04-13 18:04:01,662 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-04-13 18:04:01,663 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:01,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:01,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 18:04:01,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:01,680 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 18:04:01,772 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 18:04:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:01,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:02,146 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 18:04:02,153 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 18:04:02,153 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 18:04:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:02,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056640935] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:04:02,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:04:02,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-13 18:04:02,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558500167] [2025-04-13 18:04:02,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:04:02,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:04:02,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:02,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:04:02,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:04:02,182 INFO L87 Difference]: Start difference. First operand 2862 states and 8172 transitions. Second operand has 25 states, 24 states have (on average 5.375) internal successors, (129), 25 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:02,873 INFO L93 Difference]: Finished difference Result 3610 states and 10270 transitions. [2025-04-13 18:04:02,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:04:02,874 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.375) internal successors, (129), 25 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have 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 18:04:02,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:02,881 INFO L225 Difference]: With dead ends: 3610 [2025-04-13 18:04:02,881 INFO L226 Difference]: Without dead ends: 2430 [2025-04-13 18:04:02,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1315, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:04:02,883 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 389 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:02,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 804 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:02,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-04-13 18:04:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 2430. [2025-04-13 18:04:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 2.878962536023055) internal successors, (6993), 2429 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 6993 transitions. [2025-04-13 18:04:02,922 INFO L79 Accepts]: Start accepts. Automaton has 2430 states and 6993 transitions. Word has length 55 [2025-04-13 18:04:02,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:02,922 INFO L485 AbstractCegarLoop]: Abstraction has 2430 states and 6993 transitions. [2025-04-13 18:04:02,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.375) internal successors, (129), 25 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:02,922 INFO L278 IsEmpty]: Start isEmpty. Operand 2430 states and 6993 transitions. [2025-04-13 18:04:02,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:02,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:02,925 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:02,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:03,129 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 18:04:03,129 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 18:04:03,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash 828136275, now seen corresponding path program 36 times [2025-04-13 18:04:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:03,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157297963] [2025-04-13 18:04:03,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:03,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:03,140 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:03,140 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:03,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 18:04:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:03,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157297963] [2025-04-13 18:04:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157297963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:03,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:03,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199946238] [2025-04-13 18:04:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:03,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:03,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:03,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:03,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:03,271 INFO L87 Difference]: Start difference. First operand 2430 states and 6993 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 18:04:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:03,690 INFO L93 Difference]: Finished difference Result 2645 states and 7563 transitions. [2025-04-13 18:04:03,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:04:03,691 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 18:04:03,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:03,697 INFO L225 Difference]: With dead ends: 2645 [2025-04-13 18:04:03,697 INFO L226 Difference]: Without dead ends: 2586 [2025-04-13 18:04:03,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:04:03,698 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 220 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:03,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 610 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2025-04-13 18:04:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2430. [2025-04-13 18:04:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 2.878962536023055) internal successors, (6993), 2429 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 6993 transitions. [2025-04-13 18:04:03,723 INFO L79 Accepts]: Start accepts. Automaton has 2430 states and 6993 transitions. Word has length 56 [2025-04-13 18:04:03,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:03,723 INFO L485 AbstractCegarLoop]: Abstraction has 2430 states and 6993 transitions. [2025-04-13 18:04: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 18:04:03,724 INFO L278 IsEmpty]: Start isEmpty. Operand 2430 states and 6993 transitions. [2025-04-13 18:04:03,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:03,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:03,726 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:03,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:04:03,726 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 18:04:03,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -439507023, now seen corresponding path program 37 times [2025-04-13 18:04:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:03,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555490764] [2025-04-13 18:04:03,727 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:03,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:03,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:03,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:04,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555490764] [2025-04-13 18:04:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555490764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:04,422 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958939453] [2025-04-13 18:04:04,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:04,424 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 18:04:04,424 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 18:04:04,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:04,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:04,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:04,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:04,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:04,653 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 18:04:04,660 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 18:04:04,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:04,813 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:04,813 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 18:04:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:04,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958939453] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:04,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:04,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:04:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133051918] [2025-04-13 18:04:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:04,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:04,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:04,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:04,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:04,841 INFO L87 Difference]: Start difference. First operand 2430 states and 6993 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 18:04:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:05,484 INFO L93 Difference]: Finished difference Result 2651 states and 7593 transitions. [2025-04-13 18:04:05,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:04:05,485 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 18:04:05,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:05,491 INFO L225 Difference]: With dead ends: 2651 [2025-04-13 18:04:05,491 INFO L226 Difference]: Without dead ends: 2586 [2025-04-13 18:04:05,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=2155, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:04:05,492 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:05,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 481 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2025-04-13 18:04:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2430. [2025-04-13 18:04:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2430 states, 2429 states have (on average 2.878962536023055) internal successors, (6993), 2429 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 6993 transitions. [2025-04-13 18:04:05,518 INFO L79 Accepts]: Start accepts. Automaton has 2430 states and 6993 transitions. Word has length 56 [2025-04-13 18:04:05,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:05,518 INFO L485 AbstractCegarLoop]: Abstraction has 2430 states and 6993 transitions. [2025-04-13 18:04:05,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 18:04:05,518 INFO L278 IsEmpty]: Start isEmpty. Operand 2430 states and 6993 transitions. [2025-04-13 18:04:05,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:05,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:05,521 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:05,526 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 18:04:05,721 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 18:04:05,721 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 18:04:05,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:05,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1974698965, now seen corresponding path program 38 times [2025-04-13 18:04:05,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:05,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224113431] [2025-04-13 18:04:05,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:05,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:05,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:05,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:05,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:05,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:05,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224113431] [2025-04-13 18:04:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224113431] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:05,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:05,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147431284] [2025-04-13 18:04:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:05,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:05,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:05,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:05,863 INFO L87 Difference]: Start difference. First operand 2430 states and 6993 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 18:04:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:06,224 INFO L93 Difference]: Finished difference Result 2611 states and 7461 transitions. [2025-04-13 18:04:06,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:04:06,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 18:04:06,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:06,232 INFO L225 Difference]: With dead ends: 2611 [2025-04-13 18:04:06,232 INFO L226 Difference]: Without dead ends: 2578 [2025-04-13 18:04:06,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:04:06,233 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 185 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:06,233 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 604 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-04-13 18:04:06,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2526. [2025-04-13 18:04:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2526 states, 2525 states have (on average 2.885148514851485) internal successors, (7285), 2525 states have internal predecessors, (7285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 7285 transitions. [2025-04-13 18:04:06,275 INFO L79 Accepts]: Start accepts. Automaton has 2526 states and 7285 transitions. Word has length 56 [2025-04-13 18:04:06,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:06,275 INFO L485 AbstractCegarLoop]: Abstraction has 2526 states and 7285 transitions. [2025-04-13 18:04:06,275 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 18:04:06,275 INFO L278 IsEmpty]: Start isEmpty. Operand 2526 states and 7285 transitions. [2025-04-13 18:04:06,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:06,278 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:06,278 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:06,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:04:06,278 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 18:04:06,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489581, now seen corresponding path program 39 times [2025-04-13 18:04:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993434380] [2025-04-13 18:04:06,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:06,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:06,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:06,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04: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 18:04:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993434380] [2025-04-13 18:04:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993434380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:06,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745102664] [2025-04-13 18:04:06,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:06,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:06,442 INFO L87 Difference]: Start difference. First operand 2526 states and 7285 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 18:04:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:06,812 INFO L93 Difference]: Finished difference Result 2736 states and 7848 transitions. [2025-04-13 18:04:06,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:06,813 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 18:04:06,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:06,819 INFO L225 Difference]: With dead ends: 2736 [2025-04-13 18:04:06,819 INFO L226 Difference]: Without dead ends: 2632 [2025-04-13 18:04:06,820 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 18:04:06,820 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 222 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:06,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 443 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2025-04-13 18:04:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2481. [2025-04-13 18:04:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 2.8818548387096774) internal successors, (7147), 2480 states have internal predecessors, (7147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 7147 transitions. [2025-04-13 18:04:06,847 INFO L79 Accepts]: Start accepts. Automaton has 2481 states and 7147 transitions. Word has length 56 [2025-04-13 18:04:06,847 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:06,847 INFO L485 AbstractCegarLoop]: Abstraction has 2481 states and 7147 transitions. [2025-04-13 18:04:06,847 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 18:04:06,847 INFO L278 IsEmpty]: Start isEmpty. Operand 2481 states and 7147 transitions. [2025-04-13 18:04:06,849 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:06,849 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:06,850 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:06,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:04:06,850 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 18:04:06,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:06,850 INFO L85 PathProgramCache]: Analyzing trace with hash -509768397, now seen corresponding path program 40 times [2025-04-13 18:04:06,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:06,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053838288] [2025-04-13 18:04:06,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:06,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:06,855 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:06,857 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 18:04:06,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:06,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:06,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 18:04:06,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:06,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053838288] [2025-04-13 18:04:06,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053838288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:06,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:06,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:06,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157210067] [2025-04-13 18:04:06,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:06,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:06,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:06,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:06,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:06,959 INFO L87 Difference]: Start difference. First operand 2481 states and 7147 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 18:04:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:07,571 INFO L93 Difference]: Finished difference Result 2876 states and 8221 transitions. [2025-04-13 18:04:07,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:04:07,572 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 18:04:07,572 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:07,579 INFO L225 Difference]: With dead ends: 2876 [2025-04-13 18:04:07,579 INFO L226 Difference]: Without dead ends: 2669 [2025-04-13 18:04:07,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=957, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:07,581 INFO L437 NwaCegarLoop]: 103 mSDtfsCounter, 301 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:07,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 861 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2025-04-13 18:04:07,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 2347. [2025-04-13 18:04:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 2346 states have (on average 2.876385336743393) internal successors, (6748), 2346 states have internal predecessors, (6748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 6748 transitions. [2025-04-13 18:04:07,620 INFO L79 Accepts]: Start accepts. Automaton has 2347 states and 6748 transitions. Word has length 56 [2025-04-13 18:04:07,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:07,620 INFO L485 AbstractCegarLoop]: Abstraction has 2347 states and 6748 transitions. [2025-04-13 18:04:07,620 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 18:04:07,620 INFO L278 IsEmpty]: Start isEmpty. Operand 2347 states and 6748 transitions. [2025-04-13 18:04:07,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:07,622 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:07,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:04:07,622 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 18:04:07,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1170031355, now seen corresponding path program 41 times [2025-04-13 18:04:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:07,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210357168] [2025-04-13 18:04:07,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:07,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:07,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:07,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:07,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:08,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210357168] [2025-04-13 18:04:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210357168] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:08,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878121010] [2025-04-13 18:04:08,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:08,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:08,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:08,698 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 18:04:08,699 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 18:04:08,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:08,760 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:08,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:08,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:08,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:04:08,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:08,973 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:08,974 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 18:04:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:08,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:08,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878121010] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:08,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:08,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:04:08,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100178006] [2025-04-13 18:04:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:08,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:08,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:08,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:04:08,997 INFO L87 Difference]: Start difference. First operand 2347 states and 6748 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 18:04:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:09,994 INFO L93 Difference]: Finished difference Result 2556 states and 7260 transitions. [2025-04-13 18:04:09,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:04:09,994 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 18:04:09,995 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:10,003 INFO L225 Difference]: With dead ends: 2556 [2025-04-13 18:04:10,003 INFO L226 Difference]: Without dead ends: 2492 [2025-04-13 18:04:10,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=1560, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:04:10,006 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 255 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:10,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 428 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:04:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2025-04-13 18:04:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2352. [2025-04-13 18:04:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2351 states have (on average 2.87239472564866) internal successors, (6753), 2351 states have internal predecessors, (6753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 6753 transitions. [2025-04-13 18:04:10,036 INFO L79 Accepts]: Start accepts. Automaton has 2352 states and 6753 transitions. Word has length 56 [2025-04-13 18:04:10,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:10,036 INFO L485 AbstractCegarLoop]: Abstraction has 2352 states and 6753 transitions. [2025-04-13 18:04:10,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 18:04:10,036 INFO L278 IsEmpty]: Start isEmpty. Operand 2352 states and 6753 transitions. [2025-04-13 18:04:10,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:10,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:10,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 18:04:10,045 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 18:04:10,239 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 18:04:10,239 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 18:04:10,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash 487802507, now seen corresponding path program 42 times [2025-04-13 18:04:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:10,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390778586] [2025-04-13 18:04:10,240 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:10,247 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:10,253 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:10,253 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:10,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 18:04:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:10,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390778586] [2025-04-13 18:04:10,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390778586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:10,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:10,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644767360] [2025-04-13 18:04:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:10,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:10,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:10,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:10,515 INFO L87 Difference]: Start difference. First operand 2352 states and 6753 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 18:04:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:11,111 INFO L93 Difference]: Finished difference Result 2718 states and 7771 transitions. [2025-04-13 18:04:11,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:04:11,112 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 18:04:11,112 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:11,120 INFO L225 Difference]: With dead ends: 2718 [2025-04-13 18:04:11,120 INFO L226 Difference]: Without dead ends: 2524 [2025-04-13 18:04:11,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:11,124 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 325 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:11,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 664 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2025-04-13 18:04:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2342. [2025-04-13 18:04:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2341 states have (on average 2.8705681332763775) internal successors, (6720), 2341 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 6720 transitions. [2025-04-13 18:04:11,153 INFO L79 Accepts]: Start accepts. Automaton has 2342 states and 6720 transitions. Word has length 56 [2025-04-13 18:04:11,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:11,154 INFO L485 AbstractCegarLoop]: Abstraction has 2342 states and 6720 transitions. [2025-04-13 18:04:11,154 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 18:04:11,155 INFO L278 IsEmpty]: Start isEmpty. Operand 2342 states and 6720 transitions. [2025-04-13 18:04:11,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:11,157 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:11,157 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:11,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:04:11,157 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 18:04:11,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -581607143, now seen corresponding path program 43 times [2025-04-13 18:04:11,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:11,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816696929] [2025-04-13 18:04:11,158 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:11,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:11,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:11,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:11,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:12,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816696929] [2025-04-13 18:04:12,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816696929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:12,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628293909] [2025-04-13 18:04:12,406 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:12,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:12,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:12,409 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 18:04:12,410 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 18:04:12,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:12,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:12,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:12,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:12,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:12,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:12,686 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:12,687 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 18:04:12,695 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 18:04:12,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:12,892 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:12,893 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 18:04:12,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 18:04:12,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628293909] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:12,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:12,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:04:12,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77673219] [2025-04-13 18:04:12,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:12,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:12,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:12,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:12,922 INFO L87 Difference]: Start difference. First operand 2342 states and 6720 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 18:04:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:13,831 INFO L93 Difference]: Finished difference Result 2578 states and 7311 transitions. [2025-04-13 18:04:13,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:04:13,831 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 18:04:13,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:13,839 INFO L225 Difference]: With dead ends: 2578 [2025-04-13 18:04:13,839 INFO L226 Difference]: Without dead ends: 2514 [2025-04-13 18:04:13,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=2636, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 18:04:13,841 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 275 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:13,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 470 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-04-13 18:04:13,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2327. [2025-04-13 18:04:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2327 states, 2326 states have (on average 2.874032674118659) internal successors, (6685), 2326 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 6685 transitions. [2025-04-13 18:04:13,867 INFO L79 Accepts]: Start accepts. Automaton has 2327 states and 6685 transitions. Word has length 56 [2025-04-13 18:04:13,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:13,867 INFO L485 AbstractCegarLoop]: Abstraction has 2327 states and 6685 transitions. [2025-04-13 18:04:13,867 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 18:04:13,867 INFO L278 IsEmpty]: Start isEmpty. Operand 2327 states and 6685 transitions. [2025-04-13 18:04:13,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:13,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:13,870 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:13,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:14,070 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 18:04:14,071 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 18:04:14,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1219783483, now seen corresponding path program 44 times [2025-04-13 18:04:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:14,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678658274] [2025-04-13 18:04:14,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:14,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:14,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:14,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:14,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 18:04:14,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:14,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678658274] [2025-04-13 18:04:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678658274] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:14,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:14,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816208465] [2025-04-13 18:04:14,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:14,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:14,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:14,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:14,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:14,247 INFO L87 Difference]: Start difference. First operand 2327 states and 6685 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 18:04:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:14,909 INFO L93 Difference]: Finished difference Result 2612 states and 7450 transitions. [2025-04-13 18:04:14,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:04:14,910 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 18:04:14,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:14,917 INFO L225 Difference]: With dead ends: 2612 [2025-04-13 18:04:14,917 INFO L226 Difference]: Without dead ends: 2350 [2025-04-13 18:04:14,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:04:14,919 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 329 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:14,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 666 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-04-13 18:04:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2269. [2025-04-13 18:04:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2268 states have (on average 2.8703703703703702) internal successors, (6510), 2268 states have internal predecessors, (6510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 6510 transitions. [2025-04-13 18:04:14,944 INFO L79 Accepts]: Start accepts. Automaton has 2269 states and 6510 transitions. Word has length 56 [2025-04-13 18:04:14,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:14,944 INFO L485 AbstractCegarLoop]: Abstraction has 2269 states and 6510 transitions. [2025-04-13 18:04:14,944 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 18:04:14,944 INFO L278 IsEmpty]: Start isEmpty. Operand 2269 states and 6510 transitions. [2025-04-13 18:04:14,947 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:14,947 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:14,947 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:14,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:04:14,947 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 18:04:14,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:14,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1134026891, now seen corresponding path program 45 times [2025-04-13 18:04:14,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:14,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595798598] [2025-04-13 18:04:14,947 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:14,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:14,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:14,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:14,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:15,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:15,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595798598] [2025-04-13 18:04:15,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595798598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:15,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:15,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224086409] [2025-04-13 18:04:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:15,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:15,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:15,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:15,149 INFO L87 Difference]: Start difference. First operand 2269 states and 6510 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 18:04:15,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:15,751 INFO L93 Difference]: Finished difference Result 2551 states and 7271 transitions. [2025-04-13 18:04:15,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:04:15,751 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 18:04:15,751 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:15,761 INFO L225 Difference]: With dead ends: 2551 [2025-04-13 18:04:15,761 INFO L226 Difference]: Without dead ends: 2486 [2025-04-13 18:04:15,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:04:15,763 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 317 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:15,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 594 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-04-13 18:04:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2274. [2025-04-13 18:04:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 2.8684557853057635) internal successors, (6520), 2273 states have internal predecessors, (6520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 6520 transitions. [2025-04-13 18:04:15,788 INFO L79 Accepts]: Start accepts. Automaton has 2274 states and 6520 transitions. Word has length 56 [2025-04-13 18:04:15,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:15,789 INFO L485 AbstractCegarLoop]: Abstraction has 2274 states and 6520 transitions. [2025-04-13 18:04:15,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 18:04:15,789 INFO L278 IsEmpty]: Start isEmpty. Operand 2274 states and 6520 transitions. [2025-04-13 18:04:15,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:15,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:15,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 18:04:15,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:04:15,791 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 18:04:15,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 203899865, now seen corresponding path program 46 times [2025-04-13 18:04:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:15,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137375196] [2025-04-13 18:04:15,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:15,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:15,801 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 18:04:15,801 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:15,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137375196] [2025-04-13 18:04:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137375196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:15,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257632261] [2025-04-13 18:04:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:15,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:15,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:15,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:15,898 INFO L87 Difference]: Start difference. First operand 2274 states and 6520 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 18:04:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:16,416 INFO L93 Difference]: Finished difference Result 2583 states and 7399 transitions. [2025-04-13 18:04:16,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:04:16,416 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 18:04:16,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:16,424 INFO L225 Difference]: With dead ends: 2583 [2025-04-13 18:04:16,424 INFO L226 Difference]: Without dead ends: 2527 [2025-04-13 18:04:16,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:16,425 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 226 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:16,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 652 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2025-04-13 18:04:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2266. [2025-04-13 18:04:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2265 states have (on average 2.869757174392936) internal successors, (6500), 2265 states have internal predecessors, (6500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 6500 transitions. [2025-04-13 18:04:16,487 INFO L79 Accepts]: Start accepts. Automaton has 2266 states and 6500 transitions. Word has length 56 [2025-04-13 18:04:16,487 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:16,487 INFO L485 AbstractCegarLoop]: Abstraction has 2266 states and 6500 transitions. [2025-04-13 18:04:16,487 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 18:04:16,487 INFO L278 IsEmpty]: Start isEmpty. Operand 2266 states and 6500 transitions. [2025-04-13 18:04:16,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:16,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:16,489 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:16,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:04:16,489 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 18:04:16,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:16,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1178943801, now seen corresponding path program 47 times [2025-04-13 18:04:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:16,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568648452] [2025-04-13 18:04:16,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:16,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:16,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:16,505 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:16,506 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:17,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568648452] [2025-04-13 18:04:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568648452] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:17,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695360680] [2025-04-13 18:04:17,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:17,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:17,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:17,853 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 18:04:17,856 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 18:04:17,909 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:17,933 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:17,933 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:17,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:17,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:18,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:18,137 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 18:04:18,145 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 18:04:18,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:18,338 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:18,338 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 18:04:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:18,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695360680] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:18,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:18,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:04:18,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749423830] [2025-04-13 18:04:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:18,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:18,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:18,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:18,365 INFO L87 Difference]: Start difference. First operand 2266 states and 6500 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 18:04:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:19,301 INFO L93 Difference]: Finished difference Result 2479 states and 7067 transitions. [2025-04-13 18:04:19,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:04:19,301 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 18:04:19,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:19,309 INFO L225 Difference]: With dead ends: 2479 [2025-04-13 18:04:19,310 INFO L226 Difference]: Without dead ends: 2370 [2025-04-13 18:04:19,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=2637, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 18:04:19,312 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 318 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:19,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 624 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2025-04-13 18:04:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 2211. [2025-04-13 18:04:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2210 states have (on average 2.869683257918552) internal successors, (6342), 2210 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 6342 transitions. [2025-04-13 18:04:19,339 INFO L79 Accepts]: Start accepts. Automaton has 2211 states and 6342 transitions. Word has length 56 [2025-04-13 18:04:19,339 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:19,339 INFO L485 AbstractCegarLoop]: Abstraction has 2211 states and 6342 transitions. [2025-04-13 18:04:19,339 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 18:04:19,339 INFO L278 IsEmpty]: Start isEmpty. Operand 2211 states and 6342 transitions. [2025-04-13 18:04:19,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:19,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:19,342 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:19,348 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 18:04:19,542 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 18:04:19,542 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 18:04:19,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1005563575, now seen corresponding path program 48 times [2025-04-13 18:04:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:19,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508647311] [2025-04-13 18:04:19,543 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:19,550 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:19,558 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:19,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:19,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:19,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:19,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508647311] [2025-04-13 18:04:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508647311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849140010] [2025-04-13 18:04:19,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:19,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:19,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:19,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:19,931 INFO L87 Difference]: Start difference. First operand 2211 states and 6342 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 18:04:20,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:20,505 INFO L93 Difference]: Finished difference Result 2424 states and 6909 transitions. [2025-04-13 18:04:20,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:04:20,506 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 18:04:20,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:20,514 INFO L225 Difference]: With dead ends: 2424 [2025-04-13 18:04:20,514 INFO L226 Difference]: Without dead ends: 2365 [2025-04-13 18:04:20,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:04:20,515 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 243 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:20,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 536 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:20,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2025-04-13 18:04:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2219. [2025-04-13 18:04:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 2218 states have (on average 2.8683498647430117) internal successors, (6362), 2218 states have internal predecessors, (6362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 6362 transitions. [2025-04-13 18:04:20,550 INFO L79 Accepts]: Start accepts. Automaton has 2219 states and 6362 transitions. Word has length 56 [2025-04-13 18:04:20,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:20,550 INFO L485 AbstractCegarLoop]: Abstraction has 2219 states and 6362 transitions. [2025-04-13 18:04:20,550 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 18:04:20,550 INFO L278 IsEmpty]: Start isEmpty. Operand 2219 states and 6362 transitions. [2025-04-13 18:04:20,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:20,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:20,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 18:04:20,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:04:20,553 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 18:04:20,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -956126995, now seen corresponding path program 49 times [2025-04-13 18:04:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:20,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281249998] [2025-04-13 18:04:20,554 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:20,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:20,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:20,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:20,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:20,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:21,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281249998] [2025-04-13 18:04:21,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281249998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:21,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447543195] [2025-04-13 18:04:21,428 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:21,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:21,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:21,430 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 18:04:21,431 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 18:04:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:21,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:21,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:21,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:21,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:21,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:21,702 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:21,702 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 18:04:21,708 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 18:04:21,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:21,898 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:21,898 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 18:04:21,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 18:04:21,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447543195] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:21,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:21,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:04:21,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347986742] [2025-04-13 18:04:21,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:21,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:21,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:21,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:21,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:21,922 INFO L87 Difference]: Start difference. First operand 2219 states and 6362 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 18:04:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:22,663 INFO L93 Difference]: Finished difference Result 2480 states and 7018 transitions. [2025-04-13 18:04:22,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:04:22,663 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 18:04:22,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:22,671 INFO L225 Difference]: With dead ends: 2480 [2025-04-13 18:04:22,671 INFO L226 Difference]: Without dead ends: 2416 [2025-04-13 18:04:22,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=2759, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:04:22,672 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 263 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:22,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 492 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-04-13 18:04:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2234. [2025-04-13 18:04:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 2.8669950738916254) internal successors, (6402), 2233 states have internal predecessors, (6402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 6402 transitions. [2025-04-13 18:04:22,696 INFO L79 Accepts]: Start accepts. Automaton has 2234 states and 6402 transitions. Word has length 56 [2025-04-13 18:04:22,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:22,696 INFO L485 AbstractCegarLoop]: Abstraction has 2234 states and 6402 transitions. [2025-04-13 18:04:22,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 18:04:22,696 INFO L278 IsEmpty]: Start isEmpty. Operand 2234 states and 6402 transitions. [2025-04-13 18:04:22,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:22,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:22,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:22,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:22,899 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 18:04:22,899 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 18:04:22,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 512774901, now seen corresponding path program 50 times [2025-04-13 18:04:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:22,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355667815] [2025-04-13 18:04:22,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:22,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:22,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:22,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:22,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:23,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:23,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355667815] [2025-04-13 18:04:23,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355667815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:23,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498368550] [2025-04-13 18:04:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:23,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:23,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:23,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:23,031 INFO L87 Difference]: Start difference. First operand 2234 states and 6402 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 18:04:23,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:23,398 INFO L93 Difference]: Finished difference Result 2428 states and 6914 transitions. [2025-04-13 18:04:23,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:04:23,399 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 18:04:23,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:23,406 INFO L225 Difference]: With dead ends: 2428 [2025-04-13 18:04:23,406 INFO L226 Difference]: Without dead ends: 2376 [2025-04-13 18:04:23,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:04:23,406 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 208 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:23,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 543 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:23,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2025-04-13 18:04:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2230. [2025-04-13 18:04:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 2.8667563930013458) internal successors, (6390), 2229 states have internal predecessors, (6390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 6390 transitions. [2025-04-13 18:04:23,449 INFO L79 Accepts]: Start accepts. Automaton has 2230 states and 6390 transitions. Word has length 56 [2025-04-13 18:04:23,449 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:23,450 INFO L485 AbstractCegarLoop]: Abstraction has 2230 states and 6390 transitions. [2025-04-13 18:04:23,450 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 18:04:23,450 INFO L278 IsEmpty]: Start isEmpty. Operand 2230 states and 6390 transitions. [2025-04-13 18:04:23,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:23,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:23,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 18:04:23,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:04:23,452 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 18:04:23,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -394794801, now seen corresponding path program 51 times [2025-04-13 18:04:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:23,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677814015] [2025-04-13 18:04:23,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:23,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:23,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:23,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:23,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:23,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677814015] [2025-04-13 18:04:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677814015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928512685] [2025-04-13 18:04:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:23,574 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:23,575 INFO L87 Difference]: Start difference. First operand 2230 states and 6390 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 18:04:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:24,046 INFO L93 Difference]: Finished difference Result 2500 states and 7097 transitions. [2025-04-13 18:04:24,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:04:24,046 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 18:04:24,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:24,053 INFO L225 Difference]: With dead ends: 2500 [2025-04-13 18:04:24,053 INFO L226 Difference]: Without dead ends: 2420 [2025-04-13 18:04:24,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:04:24,054 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 287 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:24,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 538 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2025-04-13 18:04:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2230. [2025-04-13 18:04:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 2.8645132346343654) internal successors, (6385), 2229 states have internal predecessors, (6385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 6385 transitions. [2025-04-13 18:04:24,078 INFO L79 Accepts]: Start accepts. Automaton has 2230 states and 6385 transitions. Word has length 56 [2025-04-13 18:04:24,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:24,078 INFO L485 AbstractCegarLoop]: Abstraction has 2230 states and 6385 transitions. [2025-04-13 18:04:24,078 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 18:04:24,078 INFO L278 IsEmpty]: Start isEmpty. Operand 2230 states and 6385 transitions. [2025-04-13 18:04:24,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:24,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:24,080 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:24,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 18:04:24,080 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 18:04:24,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:24,080 INFO L85 PathProgramCache]: Analyzing trace with hash 169226747, now seen corresponding path program 52 times [2025-04-13 18:04:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:24,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394524750] [2025-04-13 18:04:24,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:24,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:24,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:24,088 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 18:04:24,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04: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 18:04:24,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:24,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394524750] [2025-04-13 18:04:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394524750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:24,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246034783] [2025-04-13 18:04:24,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:24,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:24,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:24,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:24,178 INFO L87 Difference]: Start difference. First operand 2230 states and 6385 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 18:04:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:24,625 INFO L93 Difference]: Finished difference Result 2699 states and 7750 transitions. [2025-04-13 18:04:24,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:04:24,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 18:04:24,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:24,633 INFO L225 Difference]: With dead ends: 2699 [2025-04-13 18:04:24,633 INFO L226 Difference]: Without dead ends: 2635 [2025-04-13 18:04:24,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:24,634 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 257 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:24,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 648 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2025-04-13 18:04:24,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2222. [2025-04-13 18:04:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 2221 states have (on average 2.8658262044124267) internal successors, (6365), 2221 states have internal predecessors, (6365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 6365 transitions. [2025-04-13 18:04:24,658 INFO L79 Accepts]: Start accepts. Automaton has 2222 states and 6365 transitions. Word has length 56 [2025-04-13 18:04:24,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:24,658 INFO L485 AbstractCegarLoop]: Abstraction has 2222 states and 6365 transitions. [2025-04-13 18:04:24,658 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 18:04:24,658 INFO L278 IsEmpty]: Start isEmpty. Operand 2222 states and 6365 transitions. [2025-04-13 18:04:24,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:24,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 18:04:24,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:04:24,660 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 18:04:24,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1587201803, now seen corresponding path program 53 times [2025-04-13 18:04:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:24,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105909498] [2025-04-13 18:04:24,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:24,665 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:24,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:24,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:24,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:25,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:25,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105909498] [2025-04-13 18:04:25,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105909498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:25,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460967904] [2025-04-13 18:04:25,606 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:25,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:25,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:25,608 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 18:04:25,609 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 18:04:25,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:25,673 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:25,673 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:04:25,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:25,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:25,825 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 18:04:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:25,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460967904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:04:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282246960] [2025-04-13 18:04:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:25,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:25,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:25,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:04:25,833 INFO L87 Difference]: Start difference. First operand 2222 states and 6365 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 18:04:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:26,507 INFO L93 Difference]: Finished difference Result 2440 states and 6933 transitions. [2025-04-13 18:04:26,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:26,507 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 18:04:26,507 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:26,513 INFO L225 Difference]: With dead ends: 2440 [2025-04-13 18:04:26,513 INFO L226 Difference]: Without dead ends: 2376 [2025-04-13 18:04:26,514 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:04:26,514 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 228 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 472 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:26,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 472 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2025-04-13 18:04:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2212. [2025-04-13 18:04:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2211 states have (on average 2.867480777928539) internal successors, (6340), 2211 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 6340 transitions. [2025-04-13 18:04:26,540 INFO L79 Accepts]: Start accepts. Automaton has 2212 states and 6340 transitions. Word has length 56 [2025-04-13 18:04:26,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:26,541 INFO L485 AbstractCegarLoop]: Abstraction has 2212 states and 6340 transitions. [2025-04-13 18:04:26,541 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 18:04:26,541 INFO L278 IsEmpty]: Start isEmpty. Operand 2212 states and 6340 transitions. [2025-04-13 18:04:26,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:26,543 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:26,549 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 18:04:26,743 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 18:04:26,743 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 18:04:26,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1580135233, now seen corresponding path program 54 times [2025-04-13 18:04:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:26,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946355341] [2025-04-13 18:04:26,744 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:26,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:26,752 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:26,752 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:26,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:26,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946355341] [2025-04-13 18:04:26,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946355341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:26,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:26,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:26,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000989769] [2025-04-13 18:04:26,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:26,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:26,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:26,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:26,865 INFO L87 Difference]: Start difference. First operand 2212 states and 6340 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 18:04:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:27,194 INFO L93 Difference]: Finished difference Result 2370 states and 6738 transitions. [2025-04-13 18:04:27,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:04:27,194 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 18:04:27,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:27,200 INFO L225 Difference]: With dead ends: 2370 [2025-04-13 18:04:27,200 INFO L226 Difference]: Without dead ends: 2337 [2025-04-13 18:04:27,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:04:27,201 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 176 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:27,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 528 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:04:27,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-04-13 18:04:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2204. [2025-04-13 18:04:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2204 states, 2203 states have (on average 2.866999546073536) internal successors, (6316), 2203 states have internal predecessors, (6316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2204 states to 2204 states and 6316 transitions. [2025-04-13 18:04:27,223 INFO L79 Accepts]: Start accepts. Automaton has 2204 states and 6316 transitions. Word has length 56 [2025-04-13 18:04:27,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:27,223 INFO L485 AbstractCegarLoop]: Abstraction has 2204 states and 6316 transitions. [2025-04-13 18:04:27,223 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 18:04:27,223 INFO L278 IsEmpty]: Start isEmpty. Operand 2204 states and 6316 transitions. [2025-04-13 18:04:27,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:27,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:27,225 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:27,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 18:04:27,225 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 18:04:27,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash -693971783, now seen corresponding path program 55 times [2025-04-13 18:04:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:27,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902063989] [2025-04-13 18:04:27,225 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:27,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:27,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:27,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:27,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:28,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902063989] [2025-04-13 18:04:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902063989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:28,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496908334] [2025-04-13 18:04:28,023 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:28,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:28,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:28,025 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 18:04:28,026 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 18:04:28,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:28,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:28,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:28,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:28,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:28,297 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 18:04:28,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 18:04:28,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:28,477 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:28,478 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 18:04:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:28,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496908334] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:28,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:28,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 18:04:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341951213] [2025-04-13 18:04:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:28,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:28,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:28,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:04:28,500 INFO L87 Difference]: Start difference. First operand 2204 states and 6316 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 18:04:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:29,297 INFO L93 Difference]: Finished difference Result 2465 states and 7006 transitions. [2025-04-13 18:04:29,297 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:04:29,297 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 18:04:29,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:29,304 INFO L225 Difference]: With dead ends: 2465 [2025-04-13 18:04:29,304 INFO L226 Difference]: Without dead ends: 2379 [2025-04-13 18:04:29,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=246, Invalid=2946, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:04:29,305 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 362 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:29,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 542 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2025-04-13 18:04:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2209. [2025-04-13 18:04:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2208 states have (on average 2.865036231884058) internal successors, (6326), 2208 states have internal predecessors, (6326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 6326 transitions. [2025-04-13 18:04:29,326 INFO L79 Accepts]: Start accepts. Automaton has 2209 states and 6326 transitions. Word has length 56 [2025-04-13 18:04:29,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:29,326 INFO L485 AbstractCegarLoop]: Abstraction has 2209 states and 6326 transitions. [2025-04-13 18:04:29,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 18:04:29,326 INFO L278 IsEmpty]: Start isEmpty. Operand 2209 states and 6326 transitions. [2025-04-13 18:04:29,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:29,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:29,328 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:29,335 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 18:04:29,529 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 18:04:29,529 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 18:04:29,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 230364701, now seen corresponding path program 56 times [2025-04-13 18:04:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:29,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104213365] [2025-04-13 18:04:29,529 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:29,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:29,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:29,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:29,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104213365] [2025-04-13 18:04:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104213365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181440157] [2025-04-13 18:04:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:29,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:29,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:29,635 INFO L87 Difference]: Start difference. First operand 2209 states and 6326 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 18:04:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:30,146 INFO L93 Difference]: Finished difference Result 2808 states and 7977 transitions. [2025-04-13 18:04:30,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:04:30,146 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 18:04:30,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:30,154 INFO L225 Difference]: With dead ends: 2808 [2025-04-13 18:04:30,154 INFO L226 Difference]: Without dead ends: 2398 [2025-04-13 18:04:30,155 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:30,156 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 299 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:30,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 708 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-04-13 18:04:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2155. [2025-04-13 18:04:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 2.8537604456824512) internal successors, (6147), 2154 states have internal predecessors, (6147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 6147 transitions. [2025-04-13 18:04:30,188 INFO L79 Accepts]: Start accepts. Automaton has 2155 states and 6147 transitions. Word has length 56 [2025-04-13 18:04:30,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:30,189 INFO L485 AbstractCegarLoop]: Abstraction has 2155 states and 6147 transitions. [2025-04-13 18:04:30,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 18:04:30,189 INFO L278 IsEmpty]: Start isEmpty. Operand 2155 states and 6147 transitions. [2025-04-13 18:04:30,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:30,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:30,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 18:04:30,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 18:04:30,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 18:04:30,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash -992131459, now seen corresponding path program 57 times [2025-04-13 18:04:30,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:30,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805397206] [2025-04-13 18:04:30,192 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:30,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:30,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:30,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:30,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:30,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:30,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805397206] [2025-04-13 18:04:30,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805397206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:30,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:30,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019892096] [2025-04-13 18:04:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:30,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:30,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:30,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:30,315 INFO L87 Difference]: Start difference. First operand 2155 states and 6147 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 18:04:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:31,014 INFO L93 Difference]: Finished difference Result 2484 states and 7047 transitions. [2025-04-13 18:04:31,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:04:31,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 18:04:31,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:31,022 INFO L225 Difference]: With dead ends: 2484 [2025-04-13 18:04:31,022 INFO L226 Difference]: Without dead ends: 2419 [2025-04-13 18:04:31,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=1358, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:04:31,024 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 339 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:31,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 689 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2025-04-13 18:04:31,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2160. [2025-04-13 18:04:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 2.8517832329782307) internal successors, (6157), 2159 states have internal predecessors, (6157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 6157 transitions. [2025-04-13 18:04:31,048 INFO L79 Accepts]: Start accepts. Automaton has 2160 states and 6157 transitions. Word has length 56 [2025-04-13 18:04:31,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:31,048 INFO L485 AbstractCegarLoop]: Abstraction has 2160 states and 6157 transitions. [2025-04-13 18:04:31,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 18:04:31,048 INFO L278 IsEmpty]: Start isEmpty. Operand 2160 states and 6157 transitions. [2025-04-13 18:04:31,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:31,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:31,051 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:31,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 18:04:31,051 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 18:04:31,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1726176747, now seen corresponding path program 58 times [2025-04-13 18:04:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:31,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30593340] [2025-04-13 18:04:31,051 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:31,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:31,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:31,066 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 18:04:31,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:31,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30593340] [2025-04-13 18:04:31,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30593340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:31,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44088628] [2025-04-13 18:04:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:31,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:31,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:31,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:31,165 INFO L87 Difference]: Start difference. First operand 2160 states and 6157 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 18:04:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:31,704 INFO L93 Difference]: Finished difference Result 2466 states and 7006 transitions. [2025-04-13 18:04:31,704 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:04:31,704 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 18:04:31,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:31,712 INFO L225 Difference]: With dead ends: 2466 [2025-04-13 18:04:31,712 INFO L226 Difference]: Without dead ends: 2407 [2025-04-13 18:04:31,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:31,713 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 272 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:31,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 573 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:31,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2025-04-13 18:04:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 2274. [2025-04-13 18:04:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 2.86229652441707) internal successors, (6506), 2273 states have internal predecessors, (6506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 6506 transitions. [2025-04-13 18:04:31,740 INFO L79 Accepts]: Start accepts. Automaton has 2274 states and 6506 transitions. Word has length 56 [2025-04-13 18:04:31,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:31,740 INFO L485 AbstractCegarLoop]: Abstraction has 2274 states and 6506 transitions. [2025-04-13 18:04:31,740 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 18:04:31,740 INFO L278 IsEmpty]: Start isEmpty. Operand 2274 states and 6506 transitions. [2025-04-13 18:04:31,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:31,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:31,742 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:31,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 18:04:31,744 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 18:04:31,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash 989865145, now seen corresponding path program 59 times [2025-04-13 18:04:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:31,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825839188] [2025-04-13 18:04:31,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:31,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:31,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:31,766 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:31,766 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:31,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:32,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825839188] [2025-04-13 18:04:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825839188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:32,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490789108] [2025-04-13 18:04:32,903 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:32,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:32,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:32,909 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 18:04:32,910 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 18:04:32,961 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:32,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:32,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:32,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:32,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:32,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:33,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:33,195 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 18:04:33,203 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 18:04:33,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:33,417 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:33,418 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 18:04:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:33,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490789108] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 32 [2025-04-13 18:04:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770228472] [2025-04-13 18:04:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:33,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:33,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:33,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:33,469 INFO L87 Difference]: Start difference. First operand 2274 states and 6506 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 18:04:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:34,424 INFO L93 Difference]: Finished difference Result 2472 states and 7020 transitions. [2025-04-13 18:04:34,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:04:34,425 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 18:04:34,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:34,432 INFO L225 Difference]: With dead ends: 2472 [2025-04-13 18:04:34,432 INFO L226 Difference]: Without dead ends: 2403 [2025-04-13 18:04:34,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 18:04:34,433 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 293 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:34,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 587 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-04-13 18:04:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2259. [2025-04-13 18:04:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2258 states have (on average 2.8658104517271923) internal successors, (6471), 2258 states have internal predecessors, (6471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 6471 transitions. [2025-04-13 18:04:34,459 INFO L79 Accepts]: Start accepts. Automaton has 2259 states and 6471 transitions. Word has length 56 [2025-04-13 18:04:34,459 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:34,459 INFO L485 AbstractCegarLoop]: Abstraction has 2259 states and 6471 transitions. [2025-04-13 18:04:34,459 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 18:04:34,459 INFO L278 IsEmpty]: Start isEmpty. Operand 2259 states and 6471 transitions. [2025-04-13 18:04:34,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:34,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:34,461 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:34,482 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 18:04:34,665 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 18:04:34,665 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 18:04:34,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -579614057, now seen corresponding path program 60 times [2025-04-13 18:04:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:34,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256775588] [2025-04-13 18:04:34,665 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:34,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:34,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:34,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:34,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:34,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:34,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256775588] [2025-04-13 18:04:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256775588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183209690] [2025-04-13 18:04:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:34,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:34,866 INFO L87 Difference]: Start difference. First operand 2259 states and 6471 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 18:04:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:35,364 INFO L93 Difference]: Finished difference Result 2417 states and 6869 transitions. [2025-04-13 18:04:35,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:04:35,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 18:04:35,364 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:35,372 INFO L225 Difference]: With dead ends: 2417 [2025-04-13 18:04:35,372 INFO L226 Difference]: Without dead ends: 2384 [2025-04-13 18:04:35,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:35,374 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 212 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:35,374 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 577 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2384 states. [2025-04-13 18:04:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2384 to 2251. [2025-04-13 18:04:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2251 states, 2250 states have (on average 2.8653333333333335) internal successors, (6447), 2250 states have internal predecessors, (6447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 6447 transitions. [2025-04-13 18:04:35,403 INFO L79 Accepts]: Start accepts. Automaton has 2251 states and 6447 transitions. Word has length 56 [2025-04-13 18:04:35,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:35,403 INFO L485 AbstractCegarLoop]: Abstraction has 2251 states and 6447 transitions. [2025-04-13 18:04:35,403 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 18:04:35,403 INFO L278 IsEmpty]: Start isEmpty. Operand 2251 states and 6447 transitions. [2025-04-13 18:04:35,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:35,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:35,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 18:04:35,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 18:04:35,406 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 18:04:35,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:35,406 INFO L85 PathProgramCache]: Analyzing trace with hash 880230321, now seen corresponding path program 61 times [2025-04-13 18:04:35,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:35,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170956217] [2025-04-13 18:04:35,406 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:35,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:35,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:35,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:35,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:35,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:36,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170956217] [2025-04-13 18:04:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170956217] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:36,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740695047] [2025-04-13 18:04:36,858 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:36,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:36,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:36,859 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 18:04:36,861 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 18:04:36,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:36,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:36,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:36,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:36,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:37,248 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:37,248 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 18:04:37,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 18:04:37,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:37,503 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:37,503 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 18:04:37,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 18:04:37,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740695047] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:37,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:37,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:04:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007960055] [2025-04-13 18:04:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:37,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:37,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=981, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:37,531 INFO L87 Difference]: Start difference. First operand 2251 states and 6447 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 18:04:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:38,295 INFO L93 Difference]: Finished difference Result 2439 states and 6930 transitions. [2025-04-13 18:04:38,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:04:38,295 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 18:04:38,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:38,303 INFO L225 Difference]: With dead ends: 2439 [2025-04-13 18:04:38,303 INFO L226 Difference]: Without dead ends: 2332 [2025-04-13 18:04:38,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=185, Invalid=2265, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:04:38,307 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 259 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:38,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 384 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2332 states. [2025-04-13 18:04:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2332 to 2256. [2025-04-13 18:04:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 2.8634146341463413) internal successors, (6457), 2255 states have internal predecessors, (6457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 6457 transitions. [2025-04-13 18:04:38,334 INFO L79 Accepts]: Start accepts. Automaton has 2256 states and 6457 transitions. Word has length 56 [2025-04-13 18:04:38,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:38,334 INFO L485 AbstractCegarLoop]: Abstraction has 2256 states and 6457 transitions. [2025-04-13 18:04:38,334 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 18:04:38,334 INFO L278 IsEmpty]: Start isEmpty. Operand 2256 states and 6457 transitions. [2025-04-13 18:04:38,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:38,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:38,337 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:38,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:38,537 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 18:04:38,538 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 18:04:38,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1230885877, now seen corresponding path program 62 times [2025-04-13 18:04:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:38,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975510360] [2025-04-13 18:04:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:38,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:38,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:38,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:38,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:38,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 18:04:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:38,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975510360] [2025-04-13 18:04:38,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975510360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:38,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:38,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:38,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626551473] [2025-04-13 18:04:38,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:38,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:38,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:38,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:38,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:38,773 INFO L87 Difference]: Start difference. First operand 2256 states and 6457 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 18:04:39,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:39,375 INFO L93 Difference]: Finished difference Result 2572 states and 7323 transitions. [2025-04-13 18:04:39,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:04:39,376 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 18:04:39,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:39,384 INFO L225 Difference]: With dead ends: 2572 [2025-04-13 18:04:39,385 INFO L226 Difference]: Without dead ends: 2403 [2025-04-13 18:04:39,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:39,386 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 289 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:39,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 743 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-04-13 18:04:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2160. [2025-04-13 18:04:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2160 states, 2159 states have (on average 2.8508568781843446) internal successors, (6155), 2159 states have internal predecessors, (6155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2160 states to 2160 states and 6155 transitions. [2025-04-13 18:04:39,424 INFO L79 Accepts]: Start accepts. Automaton has 2160 states and 6155 transitions. Word has length 56 [2025-04-13 18:04:39,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:39,424 INFO L485 AbstractCegarLoop]: Abstraction has 2160 states and 6155 transitions. [2025-04-13 18:04:39,425 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 18:04:39,425 INFO L278 IsEmpty]: Start isEmpty. Operand 2160 states and 6155 transitions. [2025-04-13 18:04:39,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:39,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:39,427 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:39,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 18:04:39,428 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 18:04:39,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:39,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1840942573, now seen corresponding path program 63 times [2025-04-13 18:04:39,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:39,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077945217] [2025-04-13 18:04:39,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:39,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:39,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:39,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:39,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:39,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077945217] [2025-04-13 18:04:39,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077945217] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:39,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:39,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763761469] [2025-04-13 18:04:39,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:39,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:39,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:39,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:39,593 INFO L87 Difference]: Start difference. First operand 2160 states and 6155 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 18:04:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:40,035 INFO L93 Difference]: Finished difference Result 2337 states and 6611 transitions. [2025-04-13 18:04:40,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:04:40,035 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 18:04:40,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:40,044 INFO L225 Difference]: With dead ends: 2337 [2025-04-13 18:04:40,044 INFO L226 Difference]: Without dead ends: 2251 [2025-04-13 18:04:40,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:04:40,045 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 212 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:40,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 413 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2025-04-13 18:04:40,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 2165. [2025-04-13 18:04:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2165 states, 2164 states have (on average 2.848890942698706) internal successors, (6165), 2164 states have internal predecessors, (6165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 6165 transitions. [2025-04-13 18:04:40,073 INFO L79 Accepts]: Start accepts. Automaton has 2165 states and 6165 transitions. Word has length 56 [2025-04-13 18:04:40,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:40,074 INFO L485 AbstractCegarLoop]: Abstraction has 2165 states and 6165 transitions. [2025-04-13 18:04:40,074 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 18:04:40,074 INFO L278 IsEmpty]: Start isEmpty. Operand 2165 states and 6165 transitions. [2025-04-13 18:04:40,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:40,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:40,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 18:04:40,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 18:04:40,077 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 18:04:40,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2132772485, now seen corresponding path program 64 times [2025-04-13 18:04:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:40,077 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214475141] [2025-04-13 18:04:40,077 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:40,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:40,092 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 18:04:40,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:40,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:40,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214475141] [2025-04-13 18:04:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214475141] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:40,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751019744] [2025-04-13 18:04:40,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:40,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:40,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:40,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:40,188 INFO L87 Difference]: Start difference. First operand 2165 states and 6165 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 18:04:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:40,570 INFO L93 Difference]: Finished difference Result 2461 states and 6974 transitions. [2025-04-13 18:04:40,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:04:40,571 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 18:04:40,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:40,579 INFO L225 Difference]: With dead ends: 2461 [2025-04-13 18:04:40,579 INFO L226 Difference]: Without dead ends: 2249 [2025-04-13 18:04:40,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:04:40,580 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 194 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:40,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 598 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2025-04-13 18:04:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2117. [2025-04-13 18:04:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 2.8520793950850662) internal successors, (6035), 2116 states have internal predecessors, (6035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 6035 transitions. [2025-04-13 18:04:40,607 INFO L79 Accepts]: Start accepts. Automaton has 2117 states and 6035 transitions. Word has length 56 [2025-04-13 18:04:40,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:40,607 INFO L485 AbstractCegarLoop]: Abstraction has 2117 states and 6035 transitions. [2025-04-13 18:04:40,607 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 18:04:40,607 INFO L278 IsEmpty]: Start isEmpty. Operand 2117 states and 6035 transitions. [2025-04-13 18:04:40,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:40,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:40,610 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:40,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 18:04:40,610 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 18:04:40,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1542782897, now seen corresponding path program 65 times [2025-04-13 18:04:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:40,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449434968] [2025-04-13 18:04:40,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:40,617 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:40,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:40,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:42,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449434968] [2025-04-13 18:04:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449434968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:42,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460475176] [2025-04-13 18:04:42,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:42,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:42,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:42,128 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 18:04:42,130 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 18:04:42,237 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:42,258 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:42,258 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:42,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:42,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:04:42,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:42,537 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:42,537 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 18:04:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:42,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460475176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:42,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:42,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:04:42,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174140338] [2025-04-13 18:04:42,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:42,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:42,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:42,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:42,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:04:42,547 INFO L87 Difference]: Start difference. First operand 2117 states and 6035 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 18:04:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:43,341 INFO L93 Difference]: Finished difference Result 2273 states and 6434 transitions. [2025-04-13 18:04:43,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:04:43,341 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 18:04:43,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:43,349 INFO L225 Difference]: With dead ends: 2273 [2025-04-13 18:04:43,350 INFO L226 Difference]: Without dead ends: 2208 [2025-04-13 18:04:43,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:04:43,350 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 201 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:43,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 447 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:43,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2025-04-13 18:04:43,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2122. [2025-04-13 18:04:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2122 states, 2121 states have (on average 2.85007072135785) internal successors, (6045), 2121 states have internal predecessors, (6045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 6045 transitions. [2025-04-13 18:04:43,387 INFO L79 Accepts]: Start accepts. Automaton has 2122 states and 6045 transitions. Word has length 56 [2025-04-13 18:04:43,394 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:43,395 INFO L485 AbstractCegarLoop]: Abstraction has 2122 states and 6045 transitions. [2025-04-13 18:04:43,395 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 18:04:43,395 INFO L278 IsEmpty]: Start isEmpty. Operand 2122 states and 6045 transitions. [2025-04-13 18:04:43,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:43,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:43,397 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:43,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:43,598 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 18:04:43,598 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 18:04:43,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1596336717, now seen corresponding path program 66 times [2025-04-13 18:04:43,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:43,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328698456] [2025-04-13 18:04:43,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:43,604 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:43,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:43,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:43,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:43,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328698456] [2025-04-13 18:04:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328698456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454211923] [2025-04-13 18:04:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:43,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:43,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:43,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:43,731 INFO L87 Difference]: Start difference. First operand 2122 states and 6045 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 18:04:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:44,218 INFO L93 Difference]: Finished difference Result 2433 states and 6873 transitions. [2025-04-13 18:04:44,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:04:44,219 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 18:04:44,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:44,227 INFO L225 Difference]: With dead ends: 2433 [2025-04-13 18:04:44,227 INFO L226 Difference]: Without dead ends: 2369 [2025-04-13 18:04:44,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:44,229 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 259 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:44,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 504 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2025-04-13 18:04:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 2127. [2025-04-13 18:04:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2127 states, 2126 states have (on average 2.848071495766698) internal successors, (6055), 2126 states have internal predecessors, (6055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 6055 transitions. [2025-04-13 18:04:44,255 INFO L79 Accepts]: Start accepts. Automaton has 2127 states and 6055 transitions. Word has length 56 [2025-04-13 18:04:44,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:44,256 INFO L485 AbstractCegarLoop]: Abstraction has 2127 states and 6055 transitions. [2025-04-13 18:04:44,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 18:04:44,256 INFO L278 IsEmpty]: Start isEmpty. Operand 2127 states and 6055 transitions. [2025-04-13 18:04:44,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:44,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:44,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 18:04:44,258 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 18:04:44,258 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 18:04:44,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -770187795, now seen corresponding path program 67 times [2025-04-13 18:04:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:44,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112965567] [2025-04-13 18:04:44,259 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:44,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:44,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:44,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:44,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:45,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112965567] [2025-04-13 18:04:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112965567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:45,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729187245] [2025-04-13 18:04:45,362 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:45,364 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 18:04:45,366 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 18:04:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:45,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:45,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:45,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:45,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:45,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:45,689 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:45,690 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 18:04:45,709 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 18:04:45,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:45,941 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:45,941 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 18:04:45,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 18:04:45,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729187245] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:45,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:45,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:04:45,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024073641] [2025-04-13 18:04:45,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:45,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:45,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:45,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:45,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:45,970 INFO L87 Difference]: Start difference. First operand 2127 states and 6055 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 18:04:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:46,602 INFO L93 Difference]: Finished difference Result 2231 states and 6305 transitions. [2025-04-13 18:04:46,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:04:46,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 18:04:46,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:46,611 INFO L225 Difference]: With dead ends: 2231 [2025-04-13 18:04:46,611 INFO L226 Difference]: Without dead ends: 2117 [2025-04-13 18:04:46,612 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=1746, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:04:46,612 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 161 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:46,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 391 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2025-04-13 18:04:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2067. [2025-04-13 18:04:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2066 states have (on average 2.8494675701839305) internal successors, (5887), 2066 states have internal predecessors, (5887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 5887 transitions. [2025-04-13 18:04:46,639 INFO L79 Accepts]: Start accepts. Automaton has 2067 states and 5887 transitions. Word has length 56 [2025-04-13 18:04:46,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:46,639 INFO L485 AbstractCegarLoop]: Abstraction has 2067 states and 5887 transitions. [2025-04-13 18:04:46,639 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 18:04:46,639 INFO L278 IsEmpty]: Start isEmpty. Operand 2067 states and 5887 transitions. [2025-04-13 18:04:46,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:46,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:46,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:46,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 18:04:46,846 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 18:04:46,846 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 18:04:46,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -42745041, now seen corresponding path program 68 times [2025-04-13 18:04:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:46,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230906881] [2025-04-13 18:04:46,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:46,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:46,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:46,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:46,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:46,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 18:04:46,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:46,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230906881] [2025-04-13 18:04:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230906881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240549549] [2025-04-13 18:04:46,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:46,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:46,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:46,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:46,972 INFO L87 Difference]: Start difference. First operand 2067 states and 5887 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 18:04:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:47,434 INFO L93 Difference]: Finished difference Result 2304 states and 6545 transitions. [2025-04-13 18:04:47,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:04:47,434 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 18:04:47,435 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:47,442 INFO L225 Difference]: With dead ends: 2304 [2025-04-13 18:04:47,443 INFO L226 Difference]: Without dead ends: 2239 [2025-04-13 18:04:47,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:04:47,444 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 223 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:47,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 497 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2239 states. [2025-04-13 18:04:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2239 to 2077. [2025-04-13 18:04:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 2076 states have (on average 2.8453757225433525) internal successors, (5907), 2076 states have internal predecessors, (5907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 5907 transitions. [2025-04-13 18:04:47,473 INFO L79 Accepts]: Start accepts. Automaton has 2077 states and 5907 transitions. Word has length 56 [2025-04-13 18:04:47,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:47,473 INFO L485 AbstractCegarLoop]: Abstraction has 2077 states and 5907 transitions. [2025-04-13 18:04:47,473 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 18:04:47,473 INFO L278 IsEmpty]: Start isEmpty. Operand 2077 states and 5907 transitions. [2025-04-13 18:04:47,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:47,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:47,475 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:47,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 18:04:47,475 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 18:04:47,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1513527645, now seen corresponding path program 69 times [2025-04-13 18:04:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:47,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615667595] [2025-04-13 18:04:47,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:47,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:47,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:47,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:47,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:47,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 18:04:47,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:47,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615667595] [2025-04-13 18:04:47,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615667595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:47,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:47,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:04:47,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582190114] [2025-04-13 18:04:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:47,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:47,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:47,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:04:47,640 INFO L87 Difference]: Start difference. First operand 2077 states and 5907 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 18:04:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:48,236 INFO L93 Difference]: Finished difference Result 2318 states and 6503 transitions. [2025-04-13 18:04:48,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:04:48,236 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 18:04:48,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:48,244 INFO L225 Difference]: With dead ends: 2318 [2025-04-13 18:04:48,244 INFO L226 Difference]: Without dead ends: 2254 [2025-04-13 18:04:48,245 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:48,245 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 252 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:48,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 450 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-04-13 18:04:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2092. [2025-04-13 18:04:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 2091 states have (on average 2.8440937350549977) internal successors, (5947), 2091 states have internal predecessors, (5947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 5947 transitions. [2025-04-13 18:04:48,269 INFO L79 Accepts]: Start accepts. Automaton has 2092 states and 5947 transitions. Word has length 56 [2025-04-13 18:04:48,269 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:48,269 INFO L485 AbstractCegarLoop]: Abstraction has 2092 states and 5947 transitions. [2025-04-13 18:04:48,269 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 18:04:48,269 INFO L278 IsEmpty]: Start isEmpty. Operand 2092 states and 5947 transitions. [2025-04-13 18:04:48,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:48,271 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:48,272 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:48,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 18:04:48,272 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 18:04:48,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1954406925, now seen corresponding path program 70 times [2025-04-13 18:04:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:48,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177563798] [2025-04-13 18:04:48,272 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:48,276 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:48,279 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 18:04:48,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:48,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:48,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177563798] [2025-04-13 18:04:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177563798] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883937450] [2025-04-13 18:04:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:48,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:48,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:48,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:48,364 INFO L87 Difference]: Start difference. First operand 2092 states and 5947 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 18:04:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:48,785 INFO L93 Difference]: Finished difference Result 2282 states and 6471 transitions. [2025-04-13 18:04:48,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:04:48,785 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 18:04:48,785 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:48,795 INFO L225 Difference]: With dead ends: 2282 [2025-04-13 18:04:48,795 INFO L226 Difference]: Without dead ends: 2189 [2025-04-13 18:04:48,796 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:04:48,797 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 180 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:48,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 496 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-04-13 18:04:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2027. [2025-04-13 18:04:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 2.843534057255676) internal successors, (5761), 2026 states have internal predecessors, (5761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:48,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 5761 transitions. [2025-04-13 18:04:48,850 INFO L79 Accepts]: Start accepts. Automaton has 2027 states and 5761 transitions. Word has length 56 [2025-04-13 18:04:48,850 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:48,850 INFO L485 AbstractCegarLoop]: Abstraction has 2027 states and 5761 transitions. [2025-04-13 18:04:48,850 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 18:04:48,850 INFO L278 IsEmpty]: Start isEmpty. Operand 2027 states and 5761 transitions. [2025-04-13 18:04:48,852 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:48,852 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:48,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 18:04:48,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 18:04:48,852 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 18:04:48,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2074859839, now seen corresponding path program 71 times [2025-04-13 18:04:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:48,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220194273] [2025-04-13 18:04:48,853 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:48,861 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:48,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:48,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:50,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220194273] [2025-04-13 18:04:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220194273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:50,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085812321] [2025-04-13 18:04:50,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:50,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:50,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:50,040 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 18:04:50,041 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 18:04:50,100 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:50,122 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:50,123 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:50,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:50,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:04:50,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:50,296 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:50,297 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 18:04:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:50,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:50,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085812321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:50,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:50,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:04:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706998157] [2025-04-13 18:04:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:50,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:50,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:50,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:50,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:04:50,307 INFO L87 Difference]: Start difference. First operand 2027 states and 5761 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 18:04:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:51,165 INFO L93 Difference]: Finished difference Result 2257 states and 6358 transitions. [2025-04-13 18:04:51,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:04:51,166 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 18:04:51,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:51,177 INFO L225 Difference]: With dead ends: 2257 [2025-04-13 18:04:51,177 INFO L226 Difference]: Without dead ends: 2192 [2025-04-13 18:04:51,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:04:51,178 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 269 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:51,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 384 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2025-04-13 18:04:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2032. [2025-04-13 18:04:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 2.841457410142787) internal successors, (5771), 2031 states have internal predecessors, (5771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 5771 transitions. [2025-04-13 18:04:51,203 INFO L79 Accepts]: Start accepts. Automaton has 2032 states and 5771 transitions. Word has length 56 [2025-04-13 18:04:51,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:51,203 INFO L485 AbstractCegarLoop]: Abstraction has 2032 states and 5771 transitions. [2025-04-13 18:04:51,203 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 18:04:51,203 INFO L278 IsEmpty]: Start isEmpty. Operand 2032 states and 5771 transitions. [2025-04-13 18:04:51,206 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:51,206 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:51,206 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:51,212 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 18:04:51,406 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 18:04:51,406 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 18:04:51,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash 626701297, now seen corresponding path program 72 times [2025-04-13 18:04:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:51,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8286061] [2025-04-13 18:04:51,407 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:51,413 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:51,418 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:51,419 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:51,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:51,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 18:04:51,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:51,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8286061] [2025-04-13 18:04:51,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8286061] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:51,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:51,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:51,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081993176] [2025-04-13 18:04:51,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:51,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:51,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:51,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:51,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:51,555 INFO L87 Difference]: Start difference. First operand 2032 states and 5771 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 18:04:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:52,139 INFO L93 Difference]: Finished difference Result 2609 states and 7405 transitions. [2025-04-13 18:04:52,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:04:52,140 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 18:04:52,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:52,148 INFO L225 Difference]: With dead ends: 2609 [2025-04-13 18:04:52,148 INFO L226 Difference]: Without dead ends: 2545 [2025-04-13 18:04:52,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:04:52,149 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 290 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:52,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 659 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:04:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2025-04-13 18:04:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2042. [2025-04-13 18:04:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2041 states have (on average 2.8397844194022537) internal successors, (5796), 2041 states have internal predecessors, (5796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5796 transitions. [2025-04-13 18:04:52,176 INFO L79 Accepts]: Start accepts. Automaton has 2042 states and 5796 transitions. Word has length 56 [2025-04-13 18:04:52,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:52,176 INFO L485 AbstractCegarLoop]: Abstraction has 2042 states and 5796 transitions. [2025-04-13 18:04:52,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 18:04:52,177 INFO L278 IsEmpty]: Start isEmpty. Operand 2042 states and 5796 transitions. [2025-04-13 18:04:52,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:52,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:52,179 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:52,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 18:04:52,179 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 18:04:52,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -238110853, now seen corresponding path program 73 times [2025-04-13 18:04:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:52,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192678860] [2025-04-13 18:04:52,179 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:52,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:52,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:52,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:52,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:53,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 18:04:53,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:53,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192678860] [2025-04-13 18:04:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192678860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:53,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236083185] [2025-04-13 18:04:53,193 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:04:53,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:53,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:53,195 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 18:04:53,197 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 18:04:53,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:04:53,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:53,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:04:53,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:53,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:04:53,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:53,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:53,482 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 18:04:53,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 18:04:53,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:04:53,701 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:04:53,701 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 18:04:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236083185] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:04:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:04:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831984712] [2025-04-13 18:04:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:53,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:53,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:53,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:04:53,732 INFO L87 Difference]: Start difference. First operand 2042 states and 5796 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 18:04:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:54,597 INFO L93 Difference]: Finished difference Result 2230 states and 6274 transitions. [2025-04-13 18:04:54,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:04:54,597 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 18:04:54,597 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:54,605 INFO L225 Difference]: With dead ends: 2230 [2025-04-13 18:04:54,605 INFO L226 Difference]: Without dead ends: 2166 [2025-04-13 18:04:54,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=2178, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:04:54,606 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 222 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:54,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 448 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:54,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-04-13 18:04:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2032. [2025-04-13 18:04:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 2.841457410142787) internal successors, (5771), 2031 states have internal predecessors, (5771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 5771 transitions. [2025-04-13 18:04:54,630 INFO L79 Accepts]: Start accepts. Automaton has 2032 states and 5771 transitions. Word has length 56 [2025-04-13 18:04:54,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:54,630 INFO L485 AbstractCegarLoop]: Abstraction has 2032 states and 5771 transitions. [2025-04-13 18:04:54,630 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 18:04:54,630 INFO L278 IsEmpty]: Start isEmpty. Operand 2032 states and 5771 transitions. [2025-04-13 18:04:54,632 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:54,632 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:54,632 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:54,639 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 18:04:54,837 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 18:04:54,837 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 18:04:54,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:54,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1012380461, now seen corresponding path program 74 times [2025-04-13 18:04:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:54,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676554796] [2025-04-13 18:04:54,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:04:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:54,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:54,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:54,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:04:54,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:54,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 18:04:54,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:54,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676554796] [2025-04-13 18:04:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676554796] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:54,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687883591] [2025-04-13 18:04:54,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:54,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:54,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:54,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:54,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:54,962 INFO L87 Difference]: Start difference. First operand 2032 states and 5771 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 18:04:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:55,483 INFO L93 Difference]: Finished difference Result 2342 states and 6615 transitions. [2025-04-13 18:04:55,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:04:55,483 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 18:04:55,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:55,493 INFO L225 Difference]: With dead ends: 2342 [2025-04-13 18:04:55,493 INFO L226 Difference]: Without dead ends: 2277 [2025-04-13 18:04:55,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:04:55,494 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 263 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:55,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 545 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2277 states. [2025-04-13 18:04:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2277 to 2037. [2025-04-13 18:04:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 2.8393909626719056) internal successors, (5781), 2036 states have internal predecessors, (5781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 5781 transitions. [2025-04-13 18:04:55,519 INFO L79 Accepts]: Start accepts. Automaton has 2037 states and 5781 transitions. Word has length 56 [2025-04-13 18:04:55,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:55,519 INFO L485 AbstractCegarLoop]: Abstraction has 2037 states and 5781 transitions. [2025-04-13 18:04:55,520 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 18:04:55,520 INFO L278 IsEmpty]: Start isEmpty. Operand 2037 states and 5781 transitions. [2025-04-13 18:04:55,522 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:55,522 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:55,522 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:55,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 18:04:55,522 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 18:04:55,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1775682857, now seen corresponding path program 75 times [2025-04-13 18:04:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:55,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072514359] [2025-04-13 18:04:55,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:04:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:55,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:55,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:55,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:04:55,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:55,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072514359] [2025-04-13 18:04:55,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072514359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:55,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:55,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040218310] [2025-04-13 18:04:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:55,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:55,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:55,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:55,671 INFO L87 Difference]: Start difference. First operand 2037 states and 5781 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 18:04:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:56,375 INFO L93 Difference]: Finished difference Result 2262 states and 6363 transitions. [2025-04-13 18:04:56,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:04:56,375 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 18:04:56,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:56,385 INFO L225 Difference]: With dead ends: 2262 [2025-04-13 18:04:56,385 INFO L226 Difference]: Without dead ends: 2176 [2025-04-13 18:04:56,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:04:56,386 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 291 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:56,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 436 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2025-04-13 18:04:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2042. [2025-04-13 18:04:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2041 states have (on average 2.8373346398824104) internal successors, (5791), 2041 states have internal predecessors, (5791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5791 transitions. [2025-04-13 18:04:56,413 INFO L79 Accepts]: Start accepts. Automaton has 2042 states and 5791 transitions. Word has length 56 [2025-04-13 18:04:56,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:56,413 INFO L485 AbstractCegarLoop]: Abstraction has 2042 states and 5791 transitions. [2025-04-13 18:04:56,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 18:04:56,414 INFO L278 IsEmpty]: Start isEmpty. Operand 2042 states and 5791 transitions. [2025-04-13 18:04:56,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:56,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:56,416 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:56,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 18:04:56,416 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 18:04:56,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 844626661, now seen corresponding path program 76 times [2025-04-13 18:04:56,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:56,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282335370] [2025-04-13 18:04:56,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:04:56,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:56,424 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:56,427 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 18:04:56,427 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:04:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:56,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 18:04:56,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:56,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282335370] [2025-04-13 18:04:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282335370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:56,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:56,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741478816] [2025-04-13 18:04:56,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:56,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:56,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:56,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:56,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:56,542 INFO L87 Difference]: Start difference. First operand 2042 states and 5791 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 18:04:57,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:57,036 INFO L93 Difference]: Finished difference Result 2310 states and 6516 transitions. [2025-04-13 18:04:57,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:04:57,036 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 18:04:57,036 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:57,045 INFO L225 Difference]: With dead ends: 2310 [2025-04-13 18:04:57,045 INFO L226 Difference]: Without dead ends: 2246 [2025-04-13 18:04:57,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:04:57,046 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 232 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:57,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 551 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:04:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2025-04-13 18:04:57,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2032. [2025-04-13 18:04:57,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 2.8389955686853767) internal successors, (5766), 2031 states have internal predecessors, (5766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 5766 transitions. [2025-04-13 18:04:57,076 INFO L79 Accepts]: Start accepts. Automaton has 2032 states and 5766 transitions. Word has length 56 [2025-04-13 18:04:57,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:57,076 INFO L485 AbstractCegarLoop]: Abstraction has 2032 states and 5766 transitions. [2025-04-13 18:04:57,076 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 18:04:57,076 INFO L278 IsEmpty]: Start isEmpty. Operand 2032 states and 5766 transitions. [2025-04-13 18:04:57,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:57,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:57,079 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:57,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 18:04:57,079 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 18:04:57,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1477523181, now seen corresponding path program 77 times [2025-04-13 18:04:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:57,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488819113] [2025-04-13 18:04:57,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:57,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:57,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:57,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:57,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:04:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:58,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488819113] [2025-04-13 18:04:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488819113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:04:58,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726407719] [2025-04-13 18:04:58,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:04:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:04:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:04:58,232 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 18:04:58,234 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 18:04:58,294 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:58,316 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:04:58,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:04:58,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:58,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:04:58,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:04:58,484 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:04:58,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 18:04:58,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 18:04:58,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:04:58,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726407719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:58,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:04:58,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:04:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835954024] [2025-04-13 18:04:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:58,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:04:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:58,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:04:58,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:04:58,495 INFO L87 Difference]: Start difference. First operand 2032 states and 5766 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 18:04:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:04:59,266 INFO L93 Difference]: Finished difference Result 2236 states and 6291 transitions. [2025-04-13 18:04:59,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:04:59,266 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 18:04:59,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:04:59,275 INFO L225 Difference]: With dead ends: 2236 [2025-04-13 18:04:59,275 INFO L226 Difference]: Without dead ends: 2171 [2025-04-13 18:04:59,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:04:59,276 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 241 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:04:59,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 375 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:04:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-04-13 18:04:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2037. [2025-04-13 18:04:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 2.836935166994106) internal successors, (5776), 2036 states have internal predecessors, (5776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:04:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 5776 transitions. [2025-04-13 18:04:59,300 INFO L79 Accepts]: Start accepts. Automaton has 2037 states and 5776 transitions. Word has length 56 [2025-04-13 18:04:59,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:04:59,300 INFO L485 AbstractCegarLoop]: Abstraction has 2037 states and 5776 transitions. [2025-04-13 18:04:59,300 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 18:04:59,300 INFO L278 IsEmpty]: Start isEmpty. Operand 2037 states and 5776 transitions. [2025-04-13 18:04:59,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:04:59,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:04:59,302 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:04:59,309 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 18:04:59,502 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 18:04:59,503 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 18:04:59,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:04:59,503 INFO L85 PathProgramCache]: Analyzing trace with hash -174895517, now seen corresponding path program 78 times [2025-04-13 18:04:59,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:04:59,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144396686] [2025-04-13 18:04:59,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:04:59,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:04:59,508 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:04:59,512 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:04:59,512 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:04:59,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:04:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:04:59,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:04:59,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144396686] [2025-04-13 18:04:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144396686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:04:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:04:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:04:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508696619] [2025-04-13 18:04:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:04:59,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:04:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:04:59,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:04:59,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:04:59,624 INFO L87 Difference]: Start difference. First operand 2037 states and 5776 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 18:05:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:00,152 INFO L93 Difference]: Finished difference Result 2259 states and 6379 transitions. [2025-04-13 18:05:00,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:05:00,153 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 18:05:00,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:00,161 INFO L225 Difference]: With dead ends: 2259 [2025-04-13 18:05:00,161 INFO L226 Difference]: Without dead ends: 2173 [2025-04-13 18:05:00,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:00,162 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 252 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:00,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2025-04-13 18:05:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2042. [2025-04-13 18:05:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2041 states have (on average 2.834884860362567) internal successors, (5786), 2041 states have internal predecessors, (5786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5786 transitions. [2025-04-13 18:05:00,185 INFO L79 Accepts]: Start accepts. Automaton has 2042 states and 5786 transitions. Word has length 56 [2025-04-13 18:05:00,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:00,186 INFO L485 AbstractCegarLoop]: Abstraction has 2042 states and 5786 transitions. [2025-04-13 18:05:00,186 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 18:05:00,186 INFO L278 IsEmpty]: Start isEmpty. Operand 2042 states and 5786 transitions. [2025-04-13 18:05:00,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:00,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:00,188 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:00,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 18:05:00,188 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 18:05:00,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -835447511, now seen corresponding path program 79 times [2025-04-13 18:05:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:00,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552441410] [2025-04-13 18:05:00,189 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:00,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:00,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:00,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:01,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:01,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552441410] [2025-04-13 18:05:01,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552441410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:01,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137135273] [2025-04-13 18:05:01,359 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:01,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:01,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:01,361 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 18:05:01,363 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 18:05:01,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:01,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:01,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:01,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:01,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:01,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:01,674 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:01,674 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 18:05:01,682 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 18:05:01,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:01,908 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:01,913 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 18:05:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:01,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137135273] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:01,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:01,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:05:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515157751] [2025-04-13 18:05:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:01,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:01,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:01,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:01,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=862, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:01,946 INFO L87 Difference]: Start difference. First operand 2042 states and 5786 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 18:05:02,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:02,804 INFO L93 Difference]: Finished difference Result 2204 states and 6192 transitions. [2025-04-13 18:05:02,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:05:02,804 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 18:05:02,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:02,812 INFO L225 Difference]: With dead ends: 2204 [2025-04-13 18:05:02,812 INFO L226 Difference]: Without dead ends: 2135 [2025-04-13 18:05:02,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=2373, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:05:02,814 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 251 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:02,814 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 481 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2025-04-13 18:05:02,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2027. [2025-04-13 18:05:02,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 2.8385982230997038) internal successors, (5751), 2026 states have internal predecessors, (5751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 5751 transitions. [2025-04-13 18:05:02,839 INFO L79 Accepts]: Start accepts. Automaton has 2027 states and 5751 transitions. Word has length 56 [2025-04-13 18:05:02,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:02,839 INFO L485 AbstractCegarLoop]: Abstraction has 2027 states and 5751 transitions. [2025-04-13 18:05:02,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 18:05:02,839 INFO L278 IsEmpty]: Start isEmpty. Operand 2027 states and 5751 transitions. [2025-04-13 18:05:02,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:02,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:02,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 18:05:02,848 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 18:05:03,045 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 18:05:03,045 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 18:05:03,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1755187443, now seen corresponding path program 80 times [2025-04-13 18:05:03,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:03,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239460275] [2025-04-13 18:05:03,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:03,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:03,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:03,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:03,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:03,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239460275] [2025-04-13 18:05:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239460275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:03,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344266757] [2025-04-13 18:05:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:03,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:03,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:03,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:03,198 INFO L87 Difference]: Start difference. First operand 2027 states and 5751 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 18:05:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:03,706 INFO L93 Difference]: Finished difference Result 2259 states and 6379 transitions. [2025-04-13 18:05:03,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:05:03,706 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 18:05:03,706 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:03,714 INFO L225 Difference]: With dead ends: 2259 [2025-04-13 18:05:03,714 INFO L226 Difference]: Without dead ends: 2194 [2025-04-13 18:05:03,715 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 18:05:03,716 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 256 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:03,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 578 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2025-04-13 18:05:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2032. [2025-04-13 18:05:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2031 states have (on average 2.8365337272279665) internal successors, (5761), 2031 states have internal predecessors, (5761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 5761 transitions. [2025-04-13 18:05:03,741 INFO L79 Accepts]: Start accepts. Automaton has 2032 states and 5761 transitions. Word has length 56 [2025-04-13 18:05:03,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:03,741 INFO L485 AbstractCegarLoop]: Abstraction has 2032 states and 5761 transitions. [2025-04-13 18:05:03,741 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 18:05:03,741 INFO L278 IsEmpty]: Start isEmpty. Operand 2032 states and 5761 transitions. [2025-04-13 18:05:03,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:03,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:03,743 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:03,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 18:05:03,744 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 18:05:03,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash -945082335, now seen corresponding path program 81 times [2025-04-13 18:05:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:03,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112348394] [2025-04-13 18:05:03,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:03,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:03,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:03,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:03,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:03,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112348394] [2025-04-13 18:05:03,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112348394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:03,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:03,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:03,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430401531] [2025-04-13 18:05:03,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:03,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:03,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:03,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:03,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:03,868 INFO L87 Difference]: Start difference. First operand 2032 states and 5761 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 18:05:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:04,338 INFO L93 Difference]: Finished difference Result 2257 states and 6343 transitions. [2025-04-13 18:05:04,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:04,339 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 18:05:04,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:04,347 INFO L225 Difference]: With dead ends: 2257 [2025-04-13 18:05:04,347 INFO L226 Difference]: Without dead ends: 2150 [2025-04-13 18:05:04,347 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:04,348 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 245 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:04,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 336 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2025-04-13 18:05:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2037. [2025-04-13 18:05:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 2.8344793713163066) internal successors, (5771), 2036 states have internal predecessors, (5771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 5771 transitions. [2025-04-13 18:05:04,378 INFO L79 Accepts]: Start accepts. Automaton has 2037 states and 5771 transitions. Word has length 56 [2025-04-13 18:05:04,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:04,378 INFO L485 AbstractCegarLoop]: Abstraction has 2037 states and 5771 transitions. [2025-04-13 18:05:04,378 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 18:05:04,378 INFO L278 IsEmpty]: Start isEmpty. Operand 2037 states and 5771 transitions. [2025-04-13 18:05:04,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:04,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:04,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 18:05:04,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 18:05:04,381 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 18:05:04,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash -682772731, now seen corresponding path program 82 times [2025-04-13 18:05:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:04,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682234135] [2025-04-13 18:05:04,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:04,388 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:04,392 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 18:05:04,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:04,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:04,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682234135] [2025-04-13 18:05:04,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682234135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:04,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:04,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:04,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921278593] [2025-04-13 18:05:04,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:04,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:04,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:04,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:04,480 INFO L87 Difference]: Start difference. First operand 2037 states and 5771 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 18:05:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:05,001 INFO L93 Difference]: Finished difference Result 2346 states and 6660 transitions. [2025-04-13 18:05:05,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:05,002 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 18:05:05,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:05,010 INFO L225 Difference]: With dead ends: 2346 [2025-04-13 18:05:05,010 INFO L226 Difference]: Without dead ends: 2227 [2025-04-13 18:05:05,011 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:05:05,011 INFO L437 NwaCegarLoop]: 88 mSDtfsCounter, 236 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:05,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 650 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-04-13 18:05:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1972. [2025-04-13 18:05:05,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 2.853881278538813) internal successors, (5625), 1971 states have internal predecessors, (5625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 5625 transitions. [2025-04-13 18:05:05,035 INFO L79 Accepts]: Start accepts. Automaton has 1972 states and 5625 transitions. Word has length 56 [2025-04-13 18:05:05,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:05,035 INFO L485 AbstractCegarLoop]: Abstraction has 1972 states and 5625 transitions. [2025-04-13 18:05:05,035 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 18:05:05,035 INFO L278 IsEmpty]: Start isEmpty. Operand 1972 states and 5625 transitions. [2025-04-13 18:05:05,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:05,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:05,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 18:05:05,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 18:05:05,037 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 18:05:05,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:05,038 INFO L85 PathProgramCache]: Analyzing trace with hash 15629917, now seen corresponding path program 83 times [2025-04-13 18:05:05,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:05,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293734826] [2025-04-13 18:05:05,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:05,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:05,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:05,050 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:05,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:06,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293734826] [2025-04-13 18:05:06,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293734826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:06,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456387379] [2025-04-13 18:05:06,189 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:06,191 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 18:05:06,192 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 18:05:06,260 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:06,285 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:06,285 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:06,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:06,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:06,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:06,519 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:06,519 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 18:05:06,528 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 18:05:06,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:06,735 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:06,735 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 18:05:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:06,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456387379] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:06,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:06,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 18:05:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985986345] [2025-04-13 18:05:06,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:06,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:06,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:06,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:06,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:06,759 INFO L87 Difference]: Start difference. First operand 1972 states and 5625 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 18:05:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:07,438 INFO L93 Difference]: Finished difference Result 2171 states and 6135 transitions. [2025-04-13 18:05:07,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:05:07,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 18:05:07,438 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:07,446 INFO L225 Difference]: With dead ends: 2171 [2025-04-13 18:05:07,446 INFO L226 Difference]: Without dead ends: 2085 [2025-04-13 18:05:07,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=2076, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:05:07,448 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 220 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 342 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:07,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 342 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-04-13 18:05:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1977. [2025-04-13 18:05:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 2.8517206477732793) internal successors, (5635), 1976 states have internal predecessors, (5635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 5635 transitions. [2025-04-13 18:05:07,472 INFO L79 Accepts]: Start accepts. Automaton has 1977 states and 5635 transitions. Word has length 56 [2025-04-13 18:05:07,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:07,472 INFO L485 AbstractCegarLoop]: Abstraction has 1977 states and 5635 transitions. [2025-04-13 18:05:07,473 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 18:05:07,473 INFO L278 IsEmpty]: Start isEmpty. Operand 1977 states and 5635 transitions. [2025-04-13 18:05:07,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:07,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:07,475 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:07,482 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 18:05:07,675 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 18:05:07,675 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 18:05:07,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1776210163, now seen corresponding path program 84 times [2025-04-13 18:05:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:07,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202294077] [2025-04-13 18:05:07,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:07,681 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:07,689 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:07,690 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:07,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:07,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202294077] [2025-04-13 18:05:07,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202294077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:07,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:07,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508190129] [2025-04-13 18:05:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:07,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:07,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:07,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:07,818 INFO L87 Difference]: Start difference. First operand 1977 states and 5635 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 18:05:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:08,278 INFO L93 Difference]: Finished difference Result 2402 states and 6839 transitions. [2025-04-13 18:05:08,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:05:08,278 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 18:05:08,278 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:08,287 INFO L225 Difference]: With dead ends: 2402 [2025-04-13 18:05:08,287 INFO L226 Difference]: Without dead ends: 2238 [2025-04-13 18:05:08,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:08,288 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 270 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:08,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 526 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2025-04-13 18:05:08,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2037. [2025-04-13 18:05:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 2.8359528487229864) internal successors, (5774), 2036 states have internal predecessors, (5774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 5774 transitions. [2025-04-13 18:05:08,316 INFO L79 Accepts]: Start accepts. Automaton has 2037 states and 5774 transitions. Word has length 56 [2025-04-13 18:05:08,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:08,316 INFO L485 AbstractCegarLoop]: Abstraction has 2037 states and 5774 transitions. [2025-04-13 18:05:08,316 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 18:05:08,319 INFO L278 IsEmpty]: Start isEmpty. Operand 2037 states and 5774 transitions. [2025-04-13 18:05:08,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:08,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:08,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 18:05:08,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 18:05:08,321 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 18:05:08,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -282529759, now seen corresponding path program 85 times [2025-04-13 18:05:08,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:08,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250972670] [2025-04-13 18:05:08,326 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:08,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:08,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:08,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:08,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:09,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250972670] [2025-04-13 18:05:09,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250972670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:09,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388536120] [2025-04-13 18:05:09,279 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:09,281 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 18:05:09,283 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 18:05:09,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:09,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:09,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:09,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:09,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:09,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:09,572 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:09,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 18:05:09,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 18:05:09,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:09,800 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:09,800 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 18:05:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388536120] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:09,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:09,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:05:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184366524] [2025-04-13 18:05:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:09,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:09,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:09,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:09,823 INFO L87 Difference]: Start difference. First operand 2037 states and 5774 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 18:05:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:10,538 INFO L93 Difference]: Finished difference Result 2215 states and 6227 transitions. [2025-04-13 18:05:10,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:05:10,539 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 18:05:10,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:10,548 INFO L225 Difference]: With dead ends: 2215 [2025-04-13 18:05:10,548 INFO L226 Difference]: Without dead ends: 2150 [2025-04-13 18:05:10,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=1991, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:05:10,550 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 199 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:10,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 370 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2025-04-13 18:05:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2042. [2025-04-13 18:05:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 2041 states have (on average 2.83390494855463) internal successors, (5784), 2041 states have internal predecessors, (5784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 5784 transitions. [2025-04-13 18:05:10,577 INFO L79 Accepts]: Start accepts. Automaton has 2042 states and 5784 transitions. Word has length 56 [2025-04-13 18:05:10,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:10,578 INFO L485 AbstractCegarLoop]: Abstraction has 2042 states and 5784 transitions. [2025-04-13 18:05:10,578 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 18:05:10,578 INFO L278 IsEmpty]: Start isEmpty. Operand 2042 states and 5784 transitions. [2025-04-13 18:05:10,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:10,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:10,581 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:10,588 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 18:05:10,781 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 18:05:10,782 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 18:05:10,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash 294547531, now seen corresponding path program 86 times [2025-04-13 18:05:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:10,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890479361] [2025-04-13 18:05:10,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:10,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:10,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:10,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:10,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 18:05:10,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:10,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890479361] [2025-04-13 18:05:10,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890479361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:10,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:10,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:10,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887151400] [2025-04-13 18:05:10,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:10,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:10,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:10,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:10,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:10,964 INFO L87 Difference]: Start difference. First operand 2042 states and 5784 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 18:05:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:11,494 INFO L93 Difference]: Finished difference Result 2383 states and 6721 transitions. [2025-04-13 18:05:11,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:05:11,495 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 18:05:11,495 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:11,503 INFO L225 Difference]: With dead ends: 2383 [2025-04-13 18:05:11,503 INFO L226 Difference]: Without dead ends: 2319 [2025-04-13 18:05:11,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:05:11,504 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 323 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:11,504 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 561 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:11,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2025-04-13 18:05:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2047. [2025-04-13 18:05:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2047 states, 2046 states have (on average 2.8318670576735094) internal successors, (5794), 2046 states have internal predecessors, (5794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 5794 transitions. [2025-04-13 18:05:11,528 INFO L79 Accepts]: Start accepts. Automaton has 2047 states and 5794 transitions. Word has length 56 [2025-04-13 18:05:11,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:11,528 INFO L485 AbstractCegarLoop]: Abstraction has 2047 states and 5794 transitions. [2025-04-13 18:05:11,528 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 18:05:11,528 INFO L278 IsEmpty]: Start isEmpty. Operand 2047 states and 5794 transitions. [2025-04-13 18:05:11,530 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:11,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:11,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:11,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 18:05:11,530 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 18:05:11,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1699466845, now seen corresponding path program 87 times [2025-04-13 18:05:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:11,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627981250] [2025-04-13 18:05:11,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:11,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:11,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:11,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:11,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:11,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:11,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627981250] [2025-04-13 18:05:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627981250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:11,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321013375] [2025-04-13 18:05:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:11,663 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:11,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:11,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:11,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:11,663 INFO L87 Difference]: Start difference. First operand 2047 states and 5794 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 18:05:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:12,122 INFO L93 Difference]: Finished difference Result 2188 states and 6143 transitions. [2025-04-13 18:05:12,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:05:12,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 18:05:12,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:12,131 INFO L225 Difference]: With dead ends: 2188 [2025-04-13 18:05:12,132 INFO L226 Difference]: Without dead ends: 2114 [2025-04-13 18:05:12,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:05:12,133 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 177 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:12,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 357 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2025-04-13 18:05:12,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2027. [2025-04-13 18:05:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 2.8376110562685093) internal successors, (5749), 2026 states have internal predecessors, (5749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 5749 transitions. [2025-04-13 18:05:12,157 INFO L79 Accepts]: Start accepts. Automaton has 2027 states and 5749 transitions. Word has length 56 [2025-04-13 18:05:12,157 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:12,157 INFO L485 AbstractCegarLoop]: Abstraction has 2027 states and 5749 transitions. [2025-04-13 18:05:12,157 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 18:05:12,157 INFO L278 IsEmpty]: Start isEmpty. Operand 2027 states and 5749 transitions. [2025-04-13 18:05:12,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:12,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:12,159 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:12,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 18:05:12,160 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 18:05:12,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1344534227, now seen corresponding path program 88 times [2025-04-13 18:05:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:12,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986628084] [2025-04-13 18:05:12,163 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:12,170 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:12,173 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 18:05:12,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:12,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:12,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:12,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986628084] [2025-04-13 18:05:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986628084] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:12,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742313467] [2025-04-13 18:05:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:12,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:12,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:12,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:12,299 INFO L87 Difference]: Start difference. First operand 2027 states and 5749 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 18:05:12,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:12,826 INFO L93 Difference]: Finished difference Result 2299 states and 6526 transitions. [2025-04-13 18:05:12,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:05:12,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 18:05:12,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:12,835 INFO L225 Difference]: With dead ends: 2299 [2025-04-13 18:05:12,835 INFO L226 Difference]: Without dead ends: 2234 [2025-04-13 18:05:12,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:05:12,836 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 306 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:12,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 555 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2025-04-13 18:05:12,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2037. [2025-04-13 18:05:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 2.833497053045187) internal successors, (5769), 2036 states have internal predecessors, (5769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 5769 transitions. [2025-04-13 18:05:12,863 INFO L79 Accepts]: Start accepts. Automaton has 2037 states and 5769 transitions. Word has length 56 [2025-04-13 18:05:12,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:12,863 INFO L485 AbstractCegarLoop]: Abstraction has 2037 states and 5769 transitions. [2025-04-13 18:05:12,863 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 18:05:12,863 INFO L278 IsEmpty]: Start isEmpty. Operand 2037 states and 5769 transitions. [2025-04-13 18:05:12,865 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:12,865 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:12,865 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:12,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 18:05:12,865 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 18:05:12,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:12,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1912438471, now seen corresponding path program 89 times [2025-04-13 18:05:12,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:12,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804940647] [2025-04-13 18:05:12,866 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:12,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:12,875 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:12,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:12,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:12,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:13,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804940647] [2025-04-13 18:05:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804940647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:13,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031857448] [2025-04-13 18:05:13,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:13,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:13,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:13,983 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 18:05:13,985 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 18:05:14,051 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:14,072 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:14,072 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:14,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:14,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:14,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:14,272 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 18:05:14,278 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 18:05:14,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:14,429 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:14,430 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 18:05:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031857448] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:14,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:14,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:05:14,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576329228] [2025-04-13 18:05:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:14,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:14,465 INFO L87 Difference]: Start difference. First operand 2037 states and 5769 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 18:05:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:15,089 INFO L93 Difference]: Finished difference Result 2174 states and 6105 transitions. [2025-04-13 18:05:15,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:05:15,089 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 18:05:15,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:15,099 INFO L225 Difference]: With dead ends: 2174 [2025-04-13 18:05:15,099 INFO L226 Difference]: Without dead ends: 2030 [2025-04-13 18:05:15,100 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=1655, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:05:15,100 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 206 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:15,100 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 357 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-04-13 18:05:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2019. [2025-04-13 18:05:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 2.829534192269574) internal successors, (5710), 2018 states have internal predecessors, (5710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 5710 transitions. [2025-04-13 18:05:15,129 INFO L79 Accepts]: Start accepts. Automaton has 2019 states and 5710 transitions. Word has length 56 [2025-04-13 18:05:15,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:15,129 INFO L485 AbstractCegarLoop]: Abstraction has 2019 states and 5710 transitions. [2025-04-13 18:05:15,129 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 18:05:15,129 INFO L278 IsEmpty]: Start isEmpty. Operand 2019 states and 5710 transitions. [2025-04-13 18:05:15,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:15,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:15,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 18:05:15,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 18:05:15,331 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 18:05:15,331 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 18:05:15,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 652617739, now seen corresponding path program 90 times [2025-04-13 18:05:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:15,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136306567] [2025-04-13 18:05:15,332 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:15,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:15,341 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:15,341 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:15,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:15,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136306567] [2025-04-13 18:05:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136306567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831221901] [2025-04-13 18:05:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:15,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:15,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:15,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:15,485 INFO L87 Difference]: Start difference. First operand 2019 states and 5710 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 18:05:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:15,966 INFO L93 Difference]: Finished difference Result 2239 states and 6343 transitions. [2025-04-13 18:05:15,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:15,966 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 18:05:15,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:15,974 INFO L225 Difference]: With dead ends: 2239 [2025-04-13 18:05:15,974 INFO L226 Difference]: Without dead ends: 2146 [2025-04-13 18:05:15,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:15,975 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 249 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:15,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 570 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:15,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-04-13 18:05:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 1954. [2025-04-13 18:05:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1953 states have (on average 2.8489503328213006) internal successors, (5564), 1953 states have internal predecessors, (5564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 5564 transitions. [2025-04-13 18:05:16,008 INFO L79 Accepts]: Start accepts. Automaton has 1954 states and 5564 transitions. Word has length 56 [2025-04-13 18:05:16,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:16,009 INFO L485 AbstractCegarLoop]: Abstraction has 1954 states and 5564 transitions. [2025-04-13 18:05:16,009 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 18:05:16,009 INFO L278 IsEmpty]: Start isEmpty. Operand 1954 states and 5564 transitions. [2025-04-13 18:05:16,011 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:16,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:16,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 18:05:16,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 18:05:16,011 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 18:05:16,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash 115695755, now seen corresponding path program 91 times [2025-04-13 18:05:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:16,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886614360] [2025-04-13 18:05:16,011 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:16,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:16,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:16,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:16,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:17,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 18:05:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:17,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886614360] [2025-04-13 18:05:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886614360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:17,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755050745] [2025-04-13 18:05:17,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:17,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:17,154 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 18:05:17,155 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 18:05:17,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:17,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:17,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:17,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:17,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:17,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:17,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:17,505 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 18:05:17,510 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 18:05:17,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:17,713 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:17,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 18:05:17,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 18:05:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755050745] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 31 [2025-04-13 18:05:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523741072] [2025-04-13 18:05:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:17,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:17,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:17,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:17,740 INFO L87 Difference]: Start difference. First operand 1954 states and 5564 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 18:05:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:18,452 INFO L93 Difference]: Finished difference Result 2103 states and 5944 transitions. [2025-04-13 18:05:18,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:05:18,452 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 18:05:18,452 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:18,459 INFO L225 Difference]: With dead ends: 2103 [2025-04-13 18:05:18,460 INFO L226 Difference]: Without dead ends: 1996 [2025-04-13 18:05:18,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=2082, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:05:18,461 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 225 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:18,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 352 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-04-13 18:05:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1959. [2025-04-13 18:05:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1959 states, 1958 states have (on average 2.846782431052094) internal successors, (5574), 1958 states have internal predecessors, (5574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 5574 transitions. [2025-04-13 18:05:18,483 INFO L79 Accepts]: Start accepts. Automaton has 1959 states and 5574 transitions. Word has length 56 [2025-04-13 18:05:18,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:18,483 INFO L485 AbstractCegarLoop]: Abstraction has 1959 states and 5574 transitions. [2025-04-13 18:05: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 18:05:18,483 INFO L278 IsEmpty]: Start isEmpty. Operand 1959 states and 5574 transitions. [2025-04-13 18:05:18,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:18,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:18,485 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:18,492 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 18:05:18,685 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 18:05:18,686 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 18:05:18,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -389486321, now seen corresponding path program 92 times [2025-04-13 18:05:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:18,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468270803] [2025-04-13 18:05:18,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:18,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:18,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:18,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:18,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:18,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468270803] [2025-04-13 18:05:18,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468270803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:18,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:18,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185697264] [2025-04-13 18:05:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:18,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:18,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:18,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:18,823 INFO L87 Difference]: Start difference. First operand 1959 states and 5574 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 18:05:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:19,145 INFO L93 Difference]: Finished difference Result 2244 states and 6346 transitions. [2025-04-13 18:05:19,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:05:19,146 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 18:05:19,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:19,153 INFO L225 Difference]: With dead ends: 2244 [2025-04-13 18:05:19,153 INFO L226 Difference]: Without dead ends: 2040 [2025-04-13 18:05:19,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:05:19,154 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 185 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:19,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 555 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-04-13 18:05:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1939. [2025-04-13 18:05:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1938 states have (on average 2.847265221878225) internal successors, (5518), 1938 states have internal predecessors, (5518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 5518 transitions. [2025-04-13 18:05:19,175 INFO L79 Accepts]: Start accepts. Automaton has 1939 states and 5518 transitions. Word has length 56 [2025-04-13 18:05:19,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:19,175 INFO L485 AbstractCegarLoop]: Abstraction has 1939 states and 5518 transitions. [2025-04-13 18:05:19,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 18:05:19,175 INFO L278 IsEmpty]: Start isEmpty. Operand 1939 states and 5518 transitions. [2025-04-13 18:05:19,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:19,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:19,177 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:19,177 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 18:05:19,177 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 18:05:19,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1076408007, now seen corresponding path program 93 times [2025-04-13 18:05:19,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:19,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051974750] [2025-04-13 18:05:19,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:19,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:19,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:19,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:19,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:19,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:19,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 18:05:19,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:19,308 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051974750] [2025-04-13 18:05:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051974750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:19,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533552764] [2025-04-13 18:05:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:19,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:19,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:19,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:19,308 INFO L87 Difference]: Start difference. First operand 1939 states and 5518 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 18:05:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:19,677 INFO L93 Difference]: Finished difference Result 2067 states and 5841 transitions. [2025-04-13 18:05:19,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:05:19,677 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 18:05:19,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:19,685 INFO L225 Difference]: With dead ends: 2067 [2025-04-13 18:05:19,685 INFO L226 Difference]: Without dead ends: 1981 [2025-04-13 18:05:19,686 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 18:05:19,686 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 170 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:19,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 323 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-04-13 18:05:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1944. [2025-04-13 18:05:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1944 states, 1943 states have (on average 2.845084920226454) internal successors, (5528), 1943 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 5528 transitions. [2025-04-13 18:05:19,715 INFO L79 Accepts]: Start accepts. Automaton has 1944 states and 5528 transitions. Word has length 56 [2025-04-13 18:05:19,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:19,715 INFO L485 AbstractCegarLoop]: Abstraction has 1944 states and 5528 transitions. [2025-04-13 18:05:19,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 18:05:19,715 INFO L278 IsEmpty]: Start isEmpty. Operand 1944 states and 5528 transitions. [2025-04-13 18:05:19,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:19,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:19,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 18:05:19,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 18:05:19,718 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 18:05:19,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash 970598513, now seen corresponding path program 94 times [2025-04-13 18:05:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:19,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159537985] [2025-04-13 18:05:19,718 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:19,724 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:19,727 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 18:05:19,727 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:19,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159537985] [2025-04-13 18:05:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159537985] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:19,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227423512] [2025-04-13 18:05:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:19,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:19,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:19,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:19,832 INFO L87 Difference]: Start difference. First operand 1944 states and 5528 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 18:05:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:20,266 INFO L93 Difference]: Finished difference Result 2330 states and 6603 transitions. [2025-04-13 18:05:20,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:05:20,267 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 18:05:20,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:20,275 INFO L225 Difference]: With dead ends: 2330 [2025-04-13 18:05:20,275 INFO L226 Difference]: Without dead ends: 2166 [2025-04-13 18:05:20,276 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:20,276 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 289 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:20,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 515 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2025-04-13 18:05:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2014. [2025-04-13 18:05:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 2013 states have (on average 2.831594634873323) internal successors, (5700), 2013 states have internal predecessors, (5700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5700 transitions. [2025-04-13 18:05:20,299 INFO L79 Accepts]: Start accepts. Automaton has 2014 states and 5700 transitions. Word has length 56 [2025-04-13 18:05:20,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:20,299 INFO L485 AbstractCegarLoop]: Abstraction has 2014 states and 5700 transitions. [2025-04-13 18:05:20,299 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 18:05:20,299 INFO L278 IsEmpty]: Start isEmpty. Operand 2014 states and 5700 transitions. [2025-04-13 18:05:20,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:20,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:20,301 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:20,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 18:05:20,301 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 18:05:20,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 778248331, now seen corresponding path program 95 times [2025-04-13 18:05:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:20,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598839939] [2025-04-13 18:05:20,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:20,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:20,312 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:20,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:20,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:20,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598839939] [2025-04-13 18:05:20,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598839939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:20,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514261425] [2025-04-13 18:05:20,956 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:20,957 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 18:05:20,958 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 18:05:21,018 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:21,036 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:21,036 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:21,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:21,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:21,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:21,178 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:21,179 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 18:05:21,185 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 18:05:21,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:21,325 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:21,325 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 18:05:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514261425] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:21,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:05:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162431201] [2025-04-13 18:05:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:21,347 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:21,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:21,347 INFO L87 Difference]: Start difference. First operand 2014 states and 5700 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 18:05:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:21,860 INFO L93 Difference]: Finished difference Result 2121 states and 5966 transitions. [2025-04-13 18:05:21,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:05:21,860 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 18:05:21,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:21,867 INFO L225 Difference]: With dead ends: 2121 [2025-04-13 18:05:21,867 INFO L226 Difference]: Without dead ends: 2056 [2025-04-13 18:05:21,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=1902, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:05:21,868 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 183 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:21,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 351 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2025-04-13 18:05:21,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2019. [2025-04-13 18:05:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 2.829534192269574) internal successors, (5710), 2018 states have internal predecessors, (5710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 5710 transitions. [2025-04-13 18:05:21,889 INFO L79 Accepts]: Start accepts. Automaton has 2019 states and 5710 transitions. Word has length 56 [2025-04-13 18:05:21,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:21,889 INFO L485 AbstractCegarLoop]: Abstraction has 2019 states and 5710 transitions. [2025-04-13 18:05:21,889 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 18:05:21,889 INFO L278 IsEmpty]: Start isEmpty. Operand 2019 states and 5710 transitions. [2025-04-13 18:05:21,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:21,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:21,891 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:21,897 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 18:05:22,092 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 18:05:22,092 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 18:05:22,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1253611089, now seen corresponding path program 96 times [2025-04-13 18:05:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:22,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242231531] [2025-04-13 18:05:22,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:22,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:22,101 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:22,101 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:22,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:22,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242231531] [2025-04-13 18:05:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242231531] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305060266] [2025-04-13 18:05:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:22,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:22,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:22,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:22,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:22,210 INFO L87 Difference]: Start difference. First operand 2019 states and 5710 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 18:05:22,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:22,627 INFO L93 Difference]: Finished difference Result 2269 states and 6371 transitions. [2025-04-13 18:05:22,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:05:22,628 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 18:05:22,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:22,635 INFO L225 Difference]: With dead ends: 2269 [2025-04-13 18:05:22,635 INFO L226 Difference]: Without dead ends: 2205 [2025-04-13 18:05:22,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=1009, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:05:22,635 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 318 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:22,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 541 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2205 states. [2025-04-13 18:05:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2205 to 2024. [2025-04-13 18:05:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 2023 states have (on average 2.827483934750371) internal successors, (5720), 2023 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 5720 transitions. [2025-04-13 18:05:22,657 INFO L79 Accepts]: Start accepts. Automaton has 2024 states and 5720 transitions. Word has length 56 [2025-04-13 18:05:22,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:22,657 INFO L485 AbstractCegarLoop]: Abstraction has 2024 states and 5720 transitions. [2025-04-13 18:05:22,657 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 18:05:22,657 INFO L278 IsEmpty]: Start isEmpty. Operand 2024 states and 5720 transitions. [2025-04-13 18:05:22,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:22,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:22,659 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:22,659 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 18:05:22,659 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 18:05:22,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1534722361, now seen corresponding path program 97 times [2025-04-13 18:05:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:22,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801724934] [2025-04-13 18:05:22,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:22,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:22,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:22,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:22,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:22,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:23,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:23,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:23,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801724934] [2025-04-13 18:05:23,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801724934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:23,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107820541] [2025-04-13 18:05:23,334 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:23,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:23,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:23,336 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 18:05:23,337 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 18:05:23,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:23,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:23,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:23,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:23,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:23,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:23,565 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:23,565 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 18:05:23,572 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 18:05:23,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:23,714 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:23,714 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 18:05:23,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 18:05:23,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107820541] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:23,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:23,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:05:23,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754049116] [2025-04-13 18:05:23,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:23,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:23,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:23,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:23,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:23,734 INFO L87 Difference]: Start difference. First operand 2024 states and 5720 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 18:05:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:24,205 INFO L93 Difference]: Finished difference Result 2089 states and 5867 transitions. [2025-04-13 18:05:24,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:05:24,205 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 18:05:24,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:24,212 INFO L225 Difference]: With dead ends: 2089 [2025-04-13 18:05:24,212 INFO L226 Difference]: Without dead ends: 1922 [2025-04-13 18:05:24,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1739, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:05:24,213 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 154 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:24,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 336 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-04-13 18:05:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1911. [2025-04-13 18:05:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 2.8539267015706806) internal successors, (5451), 1910 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 18:05:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 5451 transitions. [2025-04-13 18:05:24,233 INFO L79 Accepts]: Start accepts. Automaton has 1911 states and 5451 transitions. Word has length 56 [2025-04-13 18:05:24,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:24,233 INFO L485 AbstractCegarLoop]: Abstraction has 1911 states and 5451 transitions. [2025-04-13 18:05:24,233 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 18:05:24,233 INFO L278 IsEmpty]: Start isEmpty. Operand 1911 states and 5451 transitions. [2025-04-13 18:05:24,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:24,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:24,235 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:24,241 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 18:05:24,435 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 18:05:24,436 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 18:05:24,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:24,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1402274449, now seen corresponding path program 98 times [2025-04-13 18:05:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:24,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679365811] [2025-04-13 18:05:24,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:24,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:24,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:24,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:24,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:24,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:24,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679365811] [2025-04-13 18:05:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679365811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302083488] [2025-04-13 18:05:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:24,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:24,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:24,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:24,552 INFO L87 Difference]: Start difference. First operand 1911 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 18:05:24,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:24,963 INFO L93 Difference]: Finished difference Result 2092 states and 5952 transitions. [2025-04-13 18:05:24,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:05:24,963 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 18:05:24,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:24,970 INFO L225 Difference]: With dead ends: 2092 [2025-04-13 18:05:24,970 INFO L226 Difference]: Without dead ends: 2027 [2025-04-13 18:05:24,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 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 18:05:24,971 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 303 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:24,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 535 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-04-13 18:05:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1921. [2025-04-13 18:05:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1920 states have (on average 2.849479166666667) internal successors, (5471), 1920 states have internal predecessors, (5471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 5471 transitions. [2025-04-13 18:05:24,991 INFO L79 Accepts]: Start accepts. Automaton has 1921 states and 5471 transitions. Word has length 56 [2025-04-13 18:05:24,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:24,991 INFO L485 AbstractCegarLoop]: Abstraction has 1921 states and 5471 transitions. [2025-04-13 18:05:24,991 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 18:05:24,991 INFO L278 IsEmpty]: Start isEmpty. Operand 1921 states and 5471 transitions. [2025-04-13 18:05:24,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:24,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:24,993 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:24,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 18:05:24,993 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 18:05:24,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 319288333, now seen corresponding path program 99 times [2025-04-13 18:05:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:24,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999323744] [2025-04-13 18:05:24,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:24,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:25,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:25,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:25,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:25,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 18:05:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:25,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999323744] [2025-04-13 18:05:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999323744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:25,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:25,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041916148] [2025-04-13 18:05:25,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:25,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:25,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:25,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:25,110 INFO L87 Difference]: Start difference. First operand 1921 states and 5471 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 18:05:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:25,424 INFO L93 Difference]: Finished difference Result 2096 states and 5905 transitions. [2025-04-13 18:05:25,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:05:25,424 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 18:05:25,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:25,431 INFO L225 Difference]: With dead ends: 2096 [2025-04-13 18:05:25,431 INFO L226 Difference]: Without dead ends: 1760 [2025-04-13 18:05:25,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:05:25,432 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 220 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:25,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 448 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-04-13 18:05:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1749. [2025-04-13 18:05:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 2.833524027459954) internal successors, (4953), 1748 states have internal predecessors, (4953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 4953 transitions. [2025-04-13 18:05:25,450 INFO L79 Accepts]: Start accepts. Automaton has 1749 states and 4953 transitions. Word has length 56 [2025-04-13 18:05:25,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:25,450 INFO L485 AbstractCegarLoop]: Abstraction has 1749 states and 4953 transitions. [2025-04-13 18:05:25,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 18:05:25,451 INFO L278 IsEmpty]: Start isEmpty. Operand 1749 states and 4953 transitions. [2025-04-13 18:05:25,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:25,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:25,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 18:05:25,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 18:05:25,452 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 18:05:25,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -895540881, now seen corresponding path program 100 times [2025-04-13 18:05:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:25,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135640290] [2025-04-13 18:05:25,453 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:25,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:25,459 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 18:05:25,459 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:25,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:25,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135640290] [2025-04-13 18:05:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135640290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761980372] [2025-04-13 18:05:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:25,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:25,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:25,540 INFO L87 Difference]: Start difference. First operand 1749 states and 4953 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 18:05:25,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:25,913 INFO L93 Difference]: Finished difference Result 1878 states and 5310 transitions. [2025-04-13 18:05:25,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:25,913 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 18:05:25,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:25,920 INFO L225 Difference]: With dead ends: 1878 [2025-04-13 18:05:25,921 INFO L226 Difference]: Without dead ends: 1785 [2025-04-13 18:05:25,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:25,921 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 223 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:25,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 533 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:05:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2025-04-13 18:05:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1684. [2025-04-13 18:05:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 2.8562091503267975) internal successors, (4807), 1683 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 4807 transitions. [2025-04-13 18:05:25,940 INFO L79 Accepts]: Start accepts. Automaton has 1684 states and 4807 transitions. Word has length 56 [2025-04-13 18:05:25,940 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:25,940 INFO L485 AbstractCegarLoop]: Abstraction has 1684 states and 4807 transitions. [2025-04-13 18:05:25,940 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 18:05:25,940 INFO L278 IsEmpty]: Start isEmpty. Operand 1684 states and 4807 transitions. [2025-04-13 18:05:25,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:25,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:25,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 18:05:25,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 18:05:25,942 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 18:05:25,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1145712273, now seen corresponding path program 101 times [2025-04-13 18:05:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:25,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273456136] [2025-04-13 18:05:25,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:25,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:25,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:25,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:25,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:26,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:26,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:26,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273456136] [2025-04-13 18:05:26,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273456136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:26,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316449585] [2025-04-13 18:05:26,870 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:26,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:26,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:26,871 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 18:05:26,872 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 18:05:26,931 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:26,949 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:26,950 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:26,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:26,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:05:26,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:27,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:27,147 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 18:05:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:27,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:05:27,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316449585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:27,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:05:27,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:05:27,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758206037] [2025-04-13 18:05:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:27,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:27,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:27,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:27,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:05:27,153 INFO L87 Difference]: Start difference. First operand 1684 states and 4807 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 18:05:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:27,909 INFO L93 Difference]: Finished difference Result 1929 states and 5450 transitions. [2025-04-13 18:05:27,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:27,910 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 18:05:27,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:27,916 INFO L225 Difference]: With dead ends: 1929 [2025-04-13 18:05:27,916 INFO L226 Difference]: Without dead ends: 1765 [2025-04-13 18:05:27,917 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1643, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:05:27,917 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 210 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:27,917 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 525 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:05:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2025-04-13 18:05:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1684. [2025-04-13 18:05:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 2.8265002970885322) internal successors, (4757), 1683 states have internal predecessors, (4757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 4757 transitions. [2025-04-13 18:05:27,935 INFO L79 Accepts]: Start accepts. Automaton has 1684 states and 4757 transitions. Word has length 56 [2025-04-13 18:05:27,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:27,935 INFO L485 AbstractCegarLoop]: Abstraction has 1684 states and 4757 transitions. [2025-04-13 18:05:27,935 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 18:05:27,935 INFO L278 IsEmpty]: Start isEmpty. Operand 1684 states and 4757 transitions. [2025-04-13 18:05:27,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:27,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:27,937 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:27,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 18:05:28,137 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 18:05:28,137 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 18:05:28,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1937644941, now seen corresponding path program 102 times [2025-04-13 18:05:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:28,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440635753] [2025-04-13 18:05:28,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:28,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:28,142 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:28,148 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:28,148 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:28,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:28,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440635753] [2025-04-13 18:05:28,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440635753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:28,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:28,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319861491] [2025-04-13 18:05:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:28,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:28,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:28,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:28,262 INFO L87 Difference]: Start difference. First operand 1684 states and 4757 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 18:05:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:28,680 INFO L93 Difference]: Finished difference Result 1969 states and 5529 transitions. [2025-04-13 18:05:28,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:28,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 18:05:28,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:28,687 INFO L225 Difference]: With dead ends: 1969 [2025-04-13 18:05:28,687 INFO L226 Difference]: Without dead ends: 1775 [2025-04-13 18:05:28,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:05:28,688 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 200 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:28,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 506 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2025-04-13 18:05:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1674. [2025-04-13 18:05:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1673 states have (on average 2.823670053795577) internal successors, (4724), 1673 states have internal predecessors, (4724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 4724 transitions. [2025-04-13 18:05:28,707 INFO L79 Accepts]: Start accepts. Automaton has 1674 states and 4724 transitions. Word has length 56 [2025-04-13 18:05:28,707 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:28,707 INFO L485 AbstractCegarLoop]: Abstraction has 1674 states and 4724 transitions. [2025-04-13 18:05:28,707 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 18:05:28,707 INFO L278 IsEmpty]: Start isEmpty. Operand 1674 states and 4724 transitions. [2025-04-13 18:05:28,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:28,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:28,709 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:28,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 18:05:28,709 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 18:05:28,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash 819304659, now seen corresponding path program 103 times [2025-04-13 18:05:28,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:28,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976023327] [2025-04-13 18:05:28,709 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:28,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:28,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:28,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:28,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:28,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:29,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:29,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976023327] [2025-04-13 18:05:29,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976023327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:29,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413081205] [2025-04-13 18:05:29,462 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:29,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:29,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:29,464 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 18:05:29,464 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 18:05:29,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:29,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:29,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:29,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:29,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:29,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:29,718 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:29,719 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 18:05:29,739 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 18:05:29,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:29,896 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:29,897 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 18:05:29,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 18:05:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413081205] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:29,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:29,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:05:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603896072] [2025-04-13 18:05:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:29,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:29,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:29,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:05:29,920 INFO L87 Difference]: Start difference. First operand 1674 states and 4724 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 18:05:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:30,486 INFO L93 Difference]: Finished difference Result 1810 states and 5092 transitions. [2025-04-13 18:05:30,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:05:30,486 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 18:05:30,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:30,493 INFO L225 Difference]: With dead ends: 1810 [2025-04-13 18:05:30,493 INFO L226 Difference]: Without dead ends: 1685 [2025-04-13 18:05:30,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=2157, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:05:30,494 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 197 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:30,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 450 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:30,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-04-13 18:05:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1614. [2025-04-13 18:05:30,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 2.819590824550527) internal successors, (4548), 1613 states have internal predecessors, (4548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:30,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 4548 transitions. [2025-04-13 18:05:30,513 INFO L79 Accepts]: Start accepts. Automaton has 1614 states and 4548 transitions. Word has length 56 [2025-04-13 18:05:30,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:30,513 INFO L485 AbstractCegarLoop]: Abstraction has 1614 states and 4548 transitions. [2025-04-13 18:05:30,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 18:05:30,513 INFO L278 IsEmpty]: Start isEmpty. Operand 1614 states and 4548 transitions. [2025-04-13 18:05:30,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:30,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:30,515 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:30,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 18:05:30,715 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 18:05:30,715 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 18:05:30,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash 649736365, now seen corresponding path program 104 times [2025-04-13 18:05:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:30,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275301914] [2025-04-13 18:05:30,716 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:30,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:30,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:30,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:30,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:30,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:30,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275301914] [2025-04-13 18:05:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275301914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:30,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:30,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:30,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870096118] [2025-04-13 18:05:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:30,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:30,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:30,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:30,873 INFO L87 Difference]: Start difference. First operand 1614 states and 4548 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 18:05:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:31,292 INFO L93 Difference]: Finished difference Result 1818 states and 5067 transitions. [2025-04-13 18:05:31,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:31,292 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 18:05:31,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:31,300 INFO L225 Difference]: With dead ends: 1818 [2025-04-13 18:05:31,300 INFO L226 Difference]: Without dead ends: 1546 [2025-04-13 18:05:31,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=719, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:05:31,301 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 218 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:31,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 500 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-04-13 18:05:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2025-04-13 18:05:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 2.8155339805825244) internal successors, (4350), 1545 states have internal predecessors, (4350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:31,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 4350 transitions. [2025-04-13 18:05:31,320 INFO L79 Accepts]: Start accepts. Automaton has 1546 states and 4350 transitions. Word has length 56 [2025-04-13 18:05:31,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:31,320 INFO L485 AbstractCegarLoop]: Abstraction has 1546 states and 4350 transitions. [2025-04-13 18:05:31,320 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 18:05:31,320 INFO L278 IsEmpty]: Start isEmpty. Operand 1546 states and 4350 transitions. [2025-04-13 18:05:31,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:31,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:31,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:31,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 18:05:31,322 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 18:05:31,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1314553861, now seen corresponding path program 105 times [2025-04-13 18:05:31,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:31,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022320577] [2025-04-13 18:05:31,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:31,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:31,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:31,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:31,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:31,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022320577] [2025-04-13 18:05:31,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022320577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351501676] [2025-04-13 18:05:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:31,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:31,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:31,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:31,435 INFO L87 Difference]: Start difference. First operand 1546 states and 4350 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 18:05:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:31,858 INFO L93 Difference]: Finished difference Result 1767 states and 4915 transitions. [2025-04-13 18:05:31,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:05:31,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 18:05:31,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:31,866 INFO L225 Difference]: With dead ends: 1767 [2025-04-13 18:05:31,866 INFO L226 Difference]: Without dead ends: 1703 [2025-04-13 18:05:31,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:31,867 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 205 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:31,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 460 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:31,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2025-04-13 18:05:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1556. [2025-04-13 18:05:31,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 2.8135048231511255) internal successors, (4375), 1555 states have internal predecessors, (4375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 4375 transitions. [2025-04-13 18:05:31,886 INFO L79 Accepts]: Start accepts. Automaton has 1556 states and 4375 transitions. Word has length 56 [2025-04-13 18:05:31,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:31,886 INFO L485 AbstractCegarLoop]: Abstraction has 1556 states and 4375 transitions. [2025-04-13 18:05:31,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 18:05:31,886 INFO L278 IsEmpty]: Start isEmpty. Operand 1556 states and 4375 transitions. [2025-04-13 18:05:31,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:31,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:31,887 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:31,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 18:05:31,888 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 18:05:31,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1793550733, now seen corresponding path program 106 times [2025-04-13 18:05:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:31,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642423455] [2025-04-13 18:05:31,888 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:31,892 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:31,895 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 18:05:31,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:31,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:31,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 18:05:31,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:31,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642423455] [2025-04-13 18:05:31,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642423455] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:31,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:31,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:31,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995046426] [2025-04-13 18:05:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:31,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:31,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:31,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:31,988 INFO L87 Difference]: Start difference. First operand 1556 states and 4375 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 18:05:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:32,563 INFO L93 Difference]: Finished difference Result 2177 states and 6094 transitions. [2025-04-13 18:05:32,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:32,563 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 18:05:32,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:32,571 INFO L225 Difference]: With dead ends: 2177 [2025-04-13 18:05:32,571 INFO L226 Difference]: Without dead ends: 1993 [2025-04-13 18:05:32,572 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:05:32,572 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 340 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:32,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 681 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-04-13 18:05:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1586. [2025-04-13 18:05:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 2.816403785488959) internal successors, (4464), 1585 states have internal predecessors, (4464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 4464 transitions. [2025-04-13 18:05:32,592 INFO L79 Accepts]: Start accepts. Automaton has 1586 states and 4464 transitions. Word has length 56 [2025-04-13 18:05:32,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:32,593 INFO L485 AbstractCegarLoop]: Abstraction has 1586 states and 4464 transitions. [2025-04-13 18:05:32,593 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 18:05:32,593 INFO L278 IsEmpty]: Start isEmpty. Operand 1586 states and 4464 transitions. [2025-04-13 18:05:32,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:32,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:32,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 18:05:32,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 18:05:32,595 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 18:05:32,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -753221667, now seen corresponding path program 107 times [2025-04-13 18:05:32,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:32,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460098295] [2025-04-13 18:05:32,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:32,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:32,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:32,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:32,609 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:34,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 18:05:34,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:34,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460098295] [2025-04-13 18:05:34,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460098295] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:34,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813218724] [2025-04-13 18:05:34,165 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:34,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:34,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:34,166 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 18:05:34,168 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 18:05:34,234 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:34,255 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:34,255 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:34,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:34,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:34,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:34,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:34,495 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 18:05:34,523 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 18:05:34,523 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:34,746 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:34,746 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 18:05:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813218724] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:05:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861352554] [2025-04-13 18:05:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:34,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:34,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:34,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:05:34,779 INFO L87 Difference]: Start difference. First operand 1586 states and 4464 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 18:05:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:35,661 INFO L93 Difference]: Finished difference Result 1801 states and 5045 transitions. [2025-04-13 18:05:35,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:05:35,661 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 18:05:35,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:35,669 INFO L225 Difference]: With dead ends: 1801 [2025-04-13 18:05:35,669 INFO L226 Difference]: Without dead ends: 1736 [2025-04-13 18:05:35,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=2732, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:05:35,670 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 237 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:35,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 481 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-04-13 18:05:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1591. [2025-04-13 18:05:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1590 states have (on average 2.8138364779874214) internal successors, (4474), 1590 states have internal predecessors, (4474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 4474 transitions. [2025-04-13 18:05:35,691 INFO L79 Accepts]: Start accepts. Automaton has 1591 states and 4474 transitions. Word has length 56 [2025-04-13 18:05:35,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:35,691 INFO L485 AbstractCegarLoop]: Abstraction has 1591 states and 4474 transitions. [2025-04-13 18:05:35,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 18:05:35,691 INFO L278 IsEmpty]: Start isEmpty. Operand 1591 states and 4474 transitions. [2025-04-13 18:05:35,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:35,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:35,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 18:05:35,700 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 18:05:35,894 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 18:05:35,894 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 18:05:35,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1741867859, now seen corresponding path program 108 times [2025-04-13 18:05:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:35,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652418077] [2025-04-13 18:05:35,895 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:35,899 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:35,907 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:35,908 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:35,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:36,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652418077] [2025-04-13 18:05:36,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652418077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:36,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:36,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:36,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302738534] [2025-04-13 18:05:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:36,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:36,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:36,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:36,066 INFO L87 Difference]: Start difference. First operand 1591 states and 4474 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 18:05:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:36,674 INFO L93 Difference]: Finished difference Result 2117 states and 6035 transitions. [2025-04-13 18:05:36,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:05:36,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 18:05:36,674 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:36,682 INFO L225 Difference]: With dead ends: 2117 [2025-04-13 18:05:36,682 INFO L226 Difference]: Without dead ends: 2058 [2025-04-13 18:05:36,683 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:05:36,683 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 301 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:36,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 564 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:36,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2025-04-13 18:05:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1653. [2025-04-13 18:05:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1652 states have (on average 2.8238498789346247) internal successors, (4665), 1652 states have internal predecessors, (4665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:36,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 4665 transitions. [2025-04-13 18:05:36,705 INFO L79 Accepts]: Start accepts. Automaton has 1653 states and 4665 transitions. Word has length 56 [2025-04-13 18:05:36,705 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:36,705 INFO L485 AbstractCegarLoop]: Abstraction has 1653 states and 4665 transitions. [2025-04-13 18:05:36,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 18:05:36,706 INFO L278 IsEmpty]: Start isEmpty. Operand 1653 states and 4665 transitions. [2025-04-13 18:05:36,707 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:36,707 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:36,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 18:05:36,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 18:05:36,707 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 18:05:36,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:36,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1228774937, now seen corresponding path program 109 times [2025-04-13 18:05:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:36,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260368315] [2025-04-13 18:05:36,708 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:36,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:36,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:36,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:36,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:37,838 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260368315] [2025-04-13 18:05:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260368315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:37,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40175984] [2025-04-13 18:05:37,840 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:37,842 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 18:05:37,844 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 18:05:37,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:37,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:37,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:38,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:38,176 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 18:05:38,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 18:05:38,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:38,396 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:38,396 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 18:05:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40175984] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:38,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:05:38,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121832544] [2025-04-13 18:05:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:38,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:38,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:38,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:38,425 INFO L87 Difference]: Start difference. First operand 1653 states and 4665 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 18:05:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:39,129 INFO L93 Difference]: Finished difference Result 1826 states and 5127 transitions. [2025-04-13 18:05:39,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:39,129 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 18:05:39,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:39,137 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 18:05:39,137 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 18:05:39,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=2260, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:05:39,138 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 211 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:39,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 459 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 18:05:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1643. [2025-04-13 18:05:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1642 states have (on average 2.825822168087698) internal successors, (4640), 1642 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4640 transitions. [2025-04-13 18:05:39,158 INFO L79 Accepts]: Start accepts. Automaton has 1643 states and 4640 transitions. Word has length 56 [2025-04-13 18:05:39,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:39,159 INFO L485 AbstractCegarLoop]: Abstraction has 1643 states and 4640 transitions. [2025-04-13 18:05:39,159 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 18:05:39,159 INFO L278 IsEmpty]: Start isEmpty. Operand 1643 states and 4640 transitions. [2025-04-13 18:05:39,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:39,161 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:39,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 18:05:39,168 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 18:05:39,366 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 18:05:39,366 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 18:05:39,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1249079185, now seen corresponding path program 110 times [2025-04-13 18:05:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:39,366 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654212499] [2025-04-13 18:05:39,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:39,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:39,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:39,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:39,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:39,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:39,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 18:05:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:39,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654212499] [2025-04-13 18:05:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654212499] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840686362] [2025-04-13 18:05:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:39,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:39,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:39,499 INFO L87 Difference]: Start difference. First operand 1643 states and 4640 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 18:05:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:40,095 INFO L93 Difference]: Finished difference Result 2096 states and 5975 transitions. [2025-04-13 18:05:40,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:40,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 18:05:40,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:40,103 INFO L225 Difference]: With dead ends: 2096 [2025-04-13 18:05:40,104 INFO L226 Difference]: Without dead ends: 2044 [2025-04-13 18:05:40,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:05:40,104 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 262 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:40,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 579 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2025-04-13 18:05:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1639. [2025-04-13 18:05:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1638 states have (on average 2.8253968253968256) internal successors, (4628), 1638 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 4628 transitions. [2025-04-13 18:05:40,127 INFO L79 Accepts]: Start accepts. Automaton has 1639 states and 4628 transitions. Word has length 56 [2025-04-13 18:05:40,127 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:40,127 INFO L485 AbstractCegarLoop]: Abstraction has 1639 states and 4628 transitions. [2025-04-13 18:05:40,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 18:05:40,127 INFO L278 IsEmpty]: Start isEmpty. Operand 1639 states and 4628 transitions. [2025-04-13 18:05:40,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:40,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:40,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 18:05:40,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 18:05:40,129 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 18:05:40,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1052398649, now seen corresponding path program 111 times [2025-04-13 18:05:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:40,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952565468] [2025-04-13 18:05:40,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:40,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:40,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:40,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:40,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 18:05:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:40,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952565468] [2025-04-13 18:05:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952565468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857076537] [2025-04-13 18:05:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:40,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:40,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:40,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:40,271 INFO L87 Difference]: Start difference. First operand 1639 states and 4628 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 18:05:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:40,719 INFO L93 Difference]: Finished difference Result 1887 states and 5326 transitions. [2025-04-13 18:05:40,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:05:40,720 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 18:05:40,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:40,728 INFO L225 Difference]: With dead ends: 1887 [2025-04-13 18:05:40,728 INFO L226 Difference]: Without dead ends: 1801 [2025-04-13 18:05:40,729 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 18:05:40,729 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 251 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:40,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 514 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2025-04-13 18:05:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1709. [2025-04-13 18:05:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 2.8348946135831383) internal successors, (4842), 1708 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 4842 transitions. [2025-04-13 18:05:40,751 INFO L79 Accepts]: Start accepts. Automaton has 1709 states and 4842 transitions. Word has length 56 [2025-04-13 18:05:40,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:40,752 INFO L485 AbstractCegarLoop]: Abstraction has 1709 states and 4842 transitions. [2025-04-13 18:05:40,752 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 18:05:40,752 INFO L278 IsEmpty]: Start isEmpty. Operand 1709 states and 4842 transitions. [2025-04-13 18:05:40,753 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:40,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:40,754 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:40,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2025-04-13 18:05:40,754 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 18:05:40,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash 905531031, now seen corresponding path program 112 times [2025-04-13 18:05:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:40,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778542696] [2025-04-13 18:05:40,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:40,759 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:40,762 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 18:05:40,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:40,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778542696] [2025-04-13 18:05:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778542696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377218764] [2025-04-13 18:05:40,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:40,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:40,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:40,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:40,855 INFO L87 Difference]: Start difference. First operand 1709 states and 4842 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 18:05:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:41,465 INFO L93 Difference]: Finished difference Result 2170 states and 6197 transitions. [2025-04-13 18:05:41,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:05:41,466 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 18:05:41,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:41,475 INFO L225 Difference]: With dead ends: 2170 [2025-04-13 18:05:41,475 INFO L226 Difference]: Without dead ends: 2110 [2025-04-13 18:05:41,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:05:41,476 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 270 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:41,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 582 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:41,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2025-04-13 18:05:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1705. [2025-04-13 18:05:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 2.834507042253521) internal successors, (4830), 1704 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 4830 transitions. [2025-04-13 18:05:41,499 INFO L79 Accepts]: Start accepts. Automaton has 1705 states and 4830 transitions. Word has length 56 [2025-04-13 18:05:41,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:41,499 INFO L485 AbstractCegarLoop]: Abstraction has 1705 states and 4830 transitions. [2025-04-13 18:05:41,499 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 18:05:41,499 INFO L278 IsEmpty]: Start isEmpty. Operand 1705 states and 4830 transitions. [2025-04-13 18:05:41,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:41,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:41,502 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:41,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2025-04-13 18:05:41,502 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 18:05:41,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1350558325, now seen corresponding path program 113 times [2025-04-13 18:05:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:41,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379419090] [2025-04-13 18:05:41,503 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:41,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:41,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:41,515 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:41,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:41,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:42,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379419090] [2025-04-13 18:05:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379419090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:42,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255085442] [2025-04-13 18:05:42,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:42,630 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 18:05:42,632 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 18:05:42,700 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:42,727 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:42,727 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:42,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:42,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:05:42,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:42,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:42,959 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 18:05:43,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 18:05:43,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:05:43,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255085442] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:43,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:05:43,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:05:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423965332] [2025-04-13 18:05:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:43,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:43,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:43,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:05:43,016 INFO L87 Difference]: Start difference. First operand 1705 states and 4830 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 18:05:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:43,802 INFO L93 Difference]: Finished difference Result 1860 states and 5209 transitions. [2025-04-13 18:05:43,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:05:43,802 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 18:05:43,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:43,810 INFO L225 Difference]: With dead ends: 1860 [2025-04-13 18:05:43,810 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 18:05:43,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:05:43,811 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 190 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 441 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:43,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 441 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 18:05:43,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1715. [2025-04-13 18:05:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 2.8296382730455076) internal successors, (4850), 1714 states have internal predecessors, (4850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 4850 transitions. [2025-04-13 18:05:43,831 INFO L79 Accepts]: Start accepts. Automaton has 1715 states and 4850 transitions. Word has length 56 [2025-04-13 18:05:43,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:43,831 INFO L485 AbstractCegarLoop]: Abstraction has 1715 states and 4850 transitions. [2025-04-13 18:05:43,831 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 18:05:43,831 INFO L278 IsEmpty]: Start isEmpty. Operand 1715 states and 4850 transitions. [2025-04-13 18:05:43,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:43,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:43,833 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:43,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2025-04-13 18:05:44,035 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 18:05:44,035 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 18:05:44,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash 771506927, now seen corresponding path program 114 times [2025-04-13 18:05:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:44,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583374256] [2025-04-13 18:05:44,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:44,041 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:44,047 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:44,047 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:44,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:44,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 18:05:44,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:44,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583374256] [2025-04-13 18:05:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583374256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420248189] [2025-04-13 18:05:44,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:44,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:44,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:44,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:44,182 INFO L87 Difference]: Start difference. First operand 1715 states and 4850 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 18:05:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:44,836 INFO L93 Difference]: Finished difference Result 2245 states and 6386 transitions. [2025-04-13 18:05:44,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:05:44,836 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 18:05:44,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:44,845 INFO L225 Difference]: With dead ends: 2245 [2025-04-13 18:05:44,846 INFO L226 Difference]: Without dead ends: 2057 [2025-04-13 18:05:44,846 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:05:44,847 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 345 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:44,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 646 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2025-04-13 18:05:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1671. [2025-04-13 18:05:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 2.8179640718562875) internal successors, (4706), 1670 states have internal predecessors, (4706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 4706 transitions. [2025-04-13 18:05:44,868 INFO L79 Accepts]: Start accepts. Automaton has 1671 states and 4706 transitions. Word has length 56 [2025-04-13 18:05:44,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:44,869 INFO L485 AbstractCegarLoop]: Abstraction has 1671 states and 4706 transitions. [2025-04-13 18:05:44,869 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 18:05:44,869 INFO L278 IsEmpty]: Start isEmpty. Operand 1671 states and 4706 transitions. [2025-04-13 18:05:44,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:44,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:44,871 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:44,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2025-04-13 18:05:44,871 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 18:05:44,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 631438279, now seen corresponding path program 115 times [2025-04-13 18:05:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:44,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394903261] [2025-04-13 18:05:44,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:44,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:44,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:45,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 18:05:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:45,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394903261] [2025-04-13 18:05:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394903261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:45,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529263112] [2025-04-13 18:05:45,829 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:45,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:45,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:45,831 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 18:05:45,832 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 18:05:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:45,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:45,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:45,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:45,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:46,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:46,171 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 18:05:46,179 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 18:05:46,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:46,422 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:46,422 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 18:05:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529263112] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:05:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266791962] [2025-04-13 18:05:46,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:46,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:46,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:46,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:46,531 INFO L87 Difference]: Start difference. First operand 1671 states and 4706 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 18:05:47,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:47,283 INFO L93 Difference]: Finished difference Result 1746 states and 4886 transitions. [2025-04-13 18:05:47,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:05:47,283 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 18:05:47,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:47,291 INFO L225 Difference]: With dead ends: 1746 [2025-04-13 18:05:47,291 INFO L226 Difference]: Without dead ends: 1627 [2025-04-13 18:05:47,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=2259, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:05:47,292 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 193 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:47,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 494 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2025-04-13 18:05:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1606. [2025-04-13 18:05:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 2.8411214953271027) internal successors, (4560), 1605 states have internal predecessors, (4560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4560 transitions. [2025-04-13 18:05:47,312 INFO L79 Accepts]: Start accepts. Automaton has 1606 states and 4560 transitions. Word has length 56 [2025-04-13 18:05:47,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:47,312 INFO L485 AbstractCegarLoop]: Abstraction has 1606 states and 4560 transitions. [2025-04-13 18:05:47,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 18:05:47,312 INFO L278 IsEmpty]: Start isEmpty. Operand 1606 states and 4560 transitions. [2025-04-13 18:05:47,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:47,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:47,314 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:47,321 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 18:05:47,514 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 18:05:47,515 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 18:05:47,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:47,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1335272121, now seen corresponding path program 116 times [2025-04-13 18:05:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:47,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666670647] [2025-04-13 18:05:47,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:47,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:47,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:47,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:47,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666670647] [2025-04-13 18:05:47,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666670647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:47,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:47,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:47,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520229871] [2025-04-13 18:05:47,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:47,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:47,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:47,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:47,652 INFO L87 Difference]: Start difference. First operand 1606 states and 4560 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 18:05:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:48,189 INFO L93 Difference]: Finished difference Result 2094 states and 5957 transitions. [2025-04-13 18:05:48,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:05:48,189 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 18:05:48,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:48,198 INFO L225 Difference]: With dead ends: 2094 [2025-04-13 18:05:48,198 INFO L226 Difference]: Without dead ends: 1910 [2025-04-13 18:05:48,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:48,199 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 282 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:48,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 669 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2025-04-13 18:05:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1586. [2025-04-13 18:05:48,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 2.8416403785488957) internal successors, (4504), 1585 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:48,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 4504 transitions. [2025-04-13 18:05:48,221 INFO L79 Accepts]: Start accepts. Automaton has 1586 states and 4504 transitions. Word has length 56 [2025-04-13 18:05:48,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:48,221 INFO L485 AbstractCegarLoop]: Abstraction has 1586 states and 4504 transitions. [2025-04-13 18:05:48,221 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 18:05:48,221 INFO L278 IsEmpty]: Start isEmpty. Operand 1586 states and 4504 transitions. [2025-04-13 18:05:48,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:48,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:48,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 18:05:48,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2025-04-13 18:05:48,224 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 18:05:48,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -221576331, now seen corresponding path program 117 times [2025-04-13 18:05:48,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:48,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120116699] [2025-04-13 18:05:48,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:48,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:48,232 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:48,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:48,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:48,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:48,389 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120116699] [2025-04-13 18:05:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120116699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:05:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982748490] [2025-04-13 18:05:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:48,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:48,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:48,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:05:48,390 INFO L87 Difference]: Start difference. First operand 1586 states and 4504 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 18:05:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:48,841 INFO L93 Difference]: Finished difference Result 1851 states and 5223 transitions. [2025-04-13 18:05:48,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:05:48,842 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 18:05:48,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:48,853 INFO L225 Difference]: With dead ends: 1851 [2025-04-13 18:05:48,853 INFO L226 Difference]: Without dead ends: 1677 [2025-04-13 18:05:48,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:05:48,854 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 239 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:48,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 494 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2025-04-13 18:05:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1576. [2025-04-13 18:05:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 2.8387301587301588) internal successors, (4471), 1575 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4471 transitions. [2025-04-13 18:05:48,879 INFO L79 Accepts]: Start accepts. Automaton has 1576 states and 4471 transitions. Word has length 56 [2025-04-13 18:05:48,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:48,879 INFO L485 AbstractCegarLoop]: Abstraction has 1576 states and 4471 transitions. [2025-04-13 18:05:48,879 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 18:05:48,879 INFO L278 IsEmpty]: Start isEmpty. Operand 1576 states and 4471 transitions. [2025-04-13 18:05:48,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:48,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:48,881 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:48,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2025-04-13 18:05:48,881 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 18:05:48,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -881656811, now seen corresponding path program 118 times [2025-04-13 18:05:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:48,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468638092] [2025-04-13 18:05:48,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:48,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:48,889 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 18:05:48,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:48,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:48,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:48,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468638092] [2025-04-13 18:05:48,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468638092] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:48,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:48,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:48,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886602406] [2025-04-13 18:05:48,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:48,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:48,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:48,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:48,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:48,977 INFO L87 Difference]: Start difference. First operand 1576 states and 4471 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 18:05:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:49,561 INFO L93 Difference]: Finished difference Result 2051 states and 5864 transitions. [2025-04-13 18:05:49,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:05:49,561 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 18:05:49,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:49,570 INFO L225 Difference]: With dead ends: 2051 [2025-04-13 18:05:49,570 INFO L226 Difference]: Without dead ends: 1973 [2025-04-13 18:05:49,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=1184, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:05:49,571 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 282 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:49,571 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 607 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-04-13 18:05:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1586. [2025-04-13 18:05:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 2.8416403785488957) internal successors, (4504), 1585 states have internal predecessors, (4504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 4504 transitions. [2025-04-13 18:05:49,592 INFO L79 Accepts]: Start accepts. Automaton has 1586 states and 4504 transitions. Word has length 56 [2025-04-13 18:05:49,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:49,593 INFO L485 AbstractCegarLoop]: Abstraction has 1586 states and 4504 transitions. [2025-04-13 18:05:49,593 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 18:05:49,593 INFO L278 IsEmpty]: Start isEmpty. Operand 1586 states and 4504 transitions. [2025-04-13 18:05:49,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:49,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:49,594 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:49,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2025-04-13 18:05:49,595 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 18:05:49,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash -969853295, now seen corresponding path program 119 times [2025-04-13 18:05:49,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:49,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988954877] [2025-04-13 18:05:49,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:49,602 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:49,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:49,610 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:49,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:50,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988954877] [2025-04-13 18:05:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988954877] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:50,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844199770] [2025-04-13 18:05:50,718 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:50,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:50,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:50,720 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 18:05:50,722 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 18:05:50,795 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:50,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:50,819 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:50,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:05:50,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:51,082 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:51,082 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 18:05:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:51,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:05:51,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844199770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:51,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:05:51,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:05:51,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450121844] [2025-04-13 18:05:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:51,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:51,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:51,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:05:51,090 INFO L87 Difference]: Start difference. First operand 1586 states and 4504 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 18:05:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:51,907 INFO L93 Difference]: Finished difference Result 1811 states and 5083 transitions. [2025-04-13 18:05:51,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:05:51,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 18:05:51,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:51,915 INFO L225 Difference]: With dead ends: 1811 [2025-04-13 18:05:51,915 INFO L226 Difference]: Without dead ends: 1607 [2025-04-13 18:05:51,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:05:51,916 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 163 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:51,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 510 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:05:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-04-13 18:05:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1566. [2025-04-13 18:05:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 2.8421725239616613) internal successors, (4448), 1565 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 4448 transitions. [2025-04-13 18:05:51,937 INFO L79 Accepts]: Start accepts. Automaton has 1566 states and 4448 transitions. Word has length 56 [2025-04-13 18:05:51,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:51,938 INFO L485 AbstractCegarLoop]: Abstraction has 1566 states and 4448 transitions. [2025-04-13 18:05:51,938 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 18:05:51,938 INFO L278 IsEmpty]: Start isEmpty. Operand 1566 states and 4448 transitions. [2025-04-13 18:05:51,939 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:51,940 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:51,940 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:51,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 18:05:52,140 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 18:05:52,141 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 18:05:52,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:52,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1975670743, now seen corresponding path program 120 times [2025-04-13 18:05:52,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:52,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983684821] [2025-04-13 18:05:52,141 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:52,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:52,147 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:52,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:52,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:52,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:52,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 18:05:52,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:52,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983684821] [2025-04-13 18:05:52,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983684821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:52,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:52,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860600521] [2025-04-13 18:05:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:52,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:52,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:52,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:52,268 INFO L87 Difference]: Start difference. First operand 1566 states and 4448 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 18:05:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:52,831 INFO L93 Difference]: Finished difference Result 2039 states and 5828 transitions. [2025-04-13 18:05:52,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:05:52,831 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 18:05:52,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:52,841 INFO L225 Difference]: With dead ends: 2039 [2025-04-13 18:05:52,841 INFO L226 Difference]: Without dead ends: 1980 [2025-04-13 18:05:52,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:05:52,842 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 258 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:52,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 599 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-04-13 18:05:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1622. [2025-04-13 18:05:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1621 states have (on average 2.8463911165946945) internal successors, (4614), 1621 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 18:05:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 4614 transitions. [2025-04-13 18:05:52,864 INFO L79 Accepts]: Start accepts. Automaton has 1622 states and 4614 transitions. Word has length 56 [2025-04-13 18:05:52,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:52,865 INFO L485 AbstractCegarLoop]: Abstraction has 1622 states and 4614 transitions. [2025-04-13 18:05:52,865 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 18:05:52,865 INFO L278 IsEmpty]: Start isEmpty. Operand 1622 states and 4614 transitions. [2025-04-13 18:05:52,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:52,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:52,868 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:52,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2025-04-13 18:05:52,868 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 18:05:52,868 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1518478159, now seen corresponding path program 121 times [2025-04-13 18:05:52,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:52,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647814641] [2025-04-13 18:05:52,868 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:52,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:52,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:52,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:52,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:53,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:53,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647814641] [2025-04-13 18:05:53,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647814641] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:53,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126019500] [2025-04-13 18:05:53,782 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:05:53,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:53,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:53,784 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 18:05:53,786 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 18:05:53,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:05:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:05:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:53,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:53,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:54,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:54,146 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 18:05:54,171 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 18:05:54,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:54,397 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:54,398 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 18:05:54,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 18:05:54,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126019500] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:05:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315186064] [2025-04-13 18:05:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:54,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:54,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:05:54,439 INFO L87 Difference]: Start difference. First operand 1622 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 18:05:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:55,119 INFO L93 Difference]: Finished difference Result 1977 states and 5590 transitions. [2025-04-13 18:05:55,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:05:55,119 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 18:05:55,119 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:55,128 INFO L225 Difference]: With dead ends: 1977 [2025-04-13 18:05:55,128 INFO L226 Difference]: Without dead ends: 1813 [2025-04-13 18:05:55,129 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=2351, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:05:55,129 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 245 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:55,129 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 495 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-04-13 18:05:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1752. [2025-04-13 18:05:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 2.836093660765277) internal successors, (4966), 1751 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4966 transitions. [2025-04-13 18:05:55,151 INFO L79 Accepts]: Start accepts. Automaton has 1752 states and 4966 transitions. Word has length 56 [2025-04-13 18:05:55,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:55,151 INFO L485 AbstractCegarLoop]: Abstraction has 1752 states and 4966 transitions. [2025-04-13 18:05:55,151 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 18:05:55,151 INFO L278 IsEmpty]: Start isEmpty. Operand 1752 states and 4966 transitions. [2025-04-13 18:05:55,153 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:55,153 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:55,154 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:55,161 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 18:05:55,354 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 18:05:55,354 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 18:05:55,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1482882069, now seen corresponding path program 122 times [2025-04-13 18:05:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:55,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732725025] [2025-04-13 18:05:55,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:05:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:55,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:55,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:55,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:05:55,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:55,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732725025] [2025-04-13 18:05:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732725025] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:55,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:55,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078089350] [2025-04-13 18:05:55,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:55,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:55,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:55,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:55,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:55,477 INFO L87 Difference]: Start difference. First operand 1752 states and 4966 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 18:05:56,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:56,083 INFO L93 Difference]: Finished difference Result 2275 states and 6520 transitions. [2025-04-13 18:05:56,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:05:56,083 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 18:05:56,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:56,093 INFO L225 Difference]: With dead ends: 2275 [2025-04-13 18:05:56,093 INFO L226 Difference]: Without dead ends: 2219 [2025-04-13 18:05:56,094 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:05:56,094 INFO L437 NwaCegarLoop]: 90 mSDtfsCounter, 248 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:56,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 666 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:05:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2219 states. [2025-04-13 18:05:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2219 to 1744. [2025-04-13 18:05:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1743 states have (on average 2.8376362593230064) internal successors, (4946), 1743 states have internal predecessors, (4946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 4946 transitions. [2025-04-13 18:05:56,119 INFO L79 Accepts]: Start accepts. Automaton has 1744 states and 4946 transitions. Word has length 56 [2025-04-13 18:05:56,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:56,119 INFO L485 AbstractCegarLoop]: Abstraction has 1744 states and 4946 transitions. [2025-04-13 18:05:56,119 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 18:05:56,119 INFO L278 IsEmpty]: Start isEmpty. Operand 1744 states and 4946 transitions. [2025-04-13 18:05:56,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:56,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:56,121 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:56,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2025-04-13 18:05:56,121 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 18:05:56,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1888749329, now seen corresponding path program 123 times [2025-04-13 18:05:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:56,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018114336] [2025-04-13 18:05:56,122 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:05:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:56,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:56,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:56,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:05:56,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:56,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 18:05:56,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:56,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018114336] [2025-04-13 18:05:56,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018114336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:56,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:56,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:56,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061755221] [2025-04-13 18:05:56,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:56,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:56,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:56,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:56,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:56,239 INFO L87 Difference]: Start difference. First operand 1744 states and 4946 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 18:05:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:56,661 INFO L93 Difference]: Finished difference Result 1944 states and 5445 transitions. [2025-04-13 18:05:56,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:05:56,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 18:05:56,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:56,670 INFO L225 Difference]: With dead ends: 1944 [2025-04-13 18:05:56,670 INFO L226 Difference]: Without dead ends: 1880 [2025-04-13 18:05:56,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:05:56,671 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 223 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:56,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 442 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2025-04-13 18:05:56,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1749. [2025-04-13 18:05:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 2.8352402745995424) internal successors, (4956), 1748 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 18:05:56,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 4956 transitions. [2025-04-13 18:05:56,695 INFO L79 Accepts]: Start accepts. Automaton has 1749 states and 4956 transitions. Word has length 56 [2025-04-13 18:05:56,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:56,696 INFO L485 AbstractCegarLoop]: Abstraction has 1749 states and 4956 transitions. [2025-04-13 18:05:56,696 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 18:05:56,696 INFO L278 IsEmpty]: Start isEmpty. Operand 1749 states and 4956 transitions. [2025-04-13 18:05:56,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:56,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:56,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:56,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2025-04-13 18:05:56,699 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 18:05:56,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:56,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2010421517, now seen corresponding path program 124 times [2025-04-13 18:05:56,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:56,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854706842] [2025-04-13 18:05:56,699 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:05:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:56,704 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:56,707 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 18:05:56,707 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:05:56,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05: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 18:05:56,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:56,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854706842] [2025-04-13 18:05:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854706842] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:56,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:56,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164234419] [2025-04-13 18:05:56,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:56,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:56,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:56,793 INFO L87 Difference]: Start difference. First operand 1749 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 18:05:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:57,321 INFO L93 Difference]: Finished difference Result 2178 states and 6202 transitions. [2025-04-13 18:05:57,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:05:57,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 18:05:57,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:57,330 INFO L225 Difference]: With dead ends: 2178 [2025-04-13 18:05:57,331 INFO L226 Difference]: Without dead ends: 2119 [2025-04-13 18:05:57,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:05:57,331 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 257 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:57,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 553 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-04-13 18:05:57,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1757. [2025-04-13 18:05:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 2.8337129840546695) internal successors, (4976), 1756 states have internal predecessors, (4976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 4976 transitions. [2025-04-13 18:05:57,364 INFO L79 Accepts]: Start accepts. Automaton has 1757 states and 4976 transitions. Word has length 56 [2025-04-13 18:05:57,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:57,365 INFO L485 AbstractCegarLoop]: Abstraction has 1757 states and 4976 transitions. [2025-04-13 18:05:57,365 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 18:05:57,365 INFO L278 IsEmpty]: Start isEmpty. Operand 1757 states and 4976 transitions. [2025-04-13 18:05:57,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:57,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:57,367 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:57,367 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2025-04-13 18:05:57,367 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 18:05:57,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1844885773, now seen corresponding path program 125 times [2025-04-13 18:05:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:57,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188953178] [2025-04-13 18:05:57,368 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:57,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:57,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:57,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:57,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:57,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:05:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:58,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188953178] [2025-04-13 18:05:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188953178] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:58,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585224207] [2025-04-13 18:05:58,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:05:58,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:05:58,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:05:58,354 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 18:05:58,356 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 18:05:58,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:58,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:05:58,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:05:58,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:58,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:05:58,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:05:58,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:05:58,672 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 18:05:58,679 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 18:05:58,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:05:58,878 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:05:58,878 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 18:05:58,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:05:58,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585224207] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:05:58,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:05:58,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 31 [2025-04-13 18:05:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349507816] [2025-04-13 18:05:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:58,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:05:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:58,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:05:58,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=908, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:05:58,905 INFO L87 Difference]: Start difference. First operand 1757 states and 4976 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 18:05:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:05:59,552 INFO L93 Difference]: Finished difference Result 1904 states and 5362 transitions. [2025-04-13 18:05:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:05:59,552 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 18:05:59,552 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:05:59,560 INFO L225 Difference]: With dead ends: 1904 [2025-04-13 18:05:59,560 INFO L226 Difference]: Without dead ends: 1839 [2025-04-13 18:05:59,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=2070, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:05:59,561 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 253 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:05:59,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 439 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:05:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-04-13 18:05:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1762. [2025-04-13 18:05:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1762 states, 1761 states have (on average 2.831345826235094) internal successors, (4986), 1761 states have internal predecessors, (4986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:05:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 4986 transitions. [2025-04-13 18:05:59,583 INFO L79 Accepts]: Start accepts. Automaton has 1762 states and 4986 transitions. Word has length 56 [2025-04-13 18:05:59,583 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:05:59,583 INFO L485 AbstractCegarLoop]: Abstraction has 1762 states and 4986 transitions. [2025-04-13 18:05:59,583 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 18:05:59,583 INFO L278 IsEmpty]: Start isEmpty. Operand 1762 states and 4986 transitions. [2025-04-13 18:05:59,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:05:59,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:05:59,585 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:05:59,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 18:05:59,785 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 18:05:59,786 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 18:05:59,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:05:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1791757105, now seen corresponding path program 126 times [2025-04-13 18:05:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:05:59,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278601907] [2025-04-13 18:05:59,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:05:59,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:05:59,791 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:05:59,796 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:05:59,796 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:05:59,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:05:59,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 18:05:59,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:05:59,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278601907] [2025-04-13 18:05:59,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278601907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:05:59,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:05:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:05:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642410361] [2025-04-13 18:05:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:05:59,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:05:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:05:59,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:05:59,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:05:59,938 INFO L87 Difference]: Start difference. First operand 1762 states and 4986 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 18:06:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:00,453 INFO L93 Difference]: Finished difference Result 2172 states and 6177 transitions. [2025-04-13 18:06:00,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:06:00,454 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 18:06:00,454 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:00,462 INFO L225 Difference]: With dead ends: 2172 [2025-04-13 18:06:00,462 INFO L226 Difference]: Without dead ends: 2120 [2025-04-13 18:06:00,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:00,463 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 227 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:00,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 553 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 972 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2025-04-13 18:06:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1758. [2025-04-13 18:06:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1757 states have (on average 2.8309618668184404) internal successors, (4974), 1757 states have internal predecessors, (4974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:00,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 4974 transitions. [2025-04-13 18:06:00,489 INFO L79 Accepts]: Start accepts. Automaton has 1758 states and 4974 transitions. Word has length 56 [2025-04-13 18:06:00,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:00,490 INFO L485 AbstractCegarLoop]: Abstraction has 1758 states and 4974 transitions. [2025-04-13 18:06:00,490 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 18:06:00,490 INFO L278 IsEmpty]: Start isEmpty. Operand 1758 states and 4974 transitions. [2025-04-13 18:06:00,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:00,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:00,493 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:00,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2025-04-13 18:06:00,495 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 18:06:00,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 137110831, now seen corresponding path program 127 times [2025-04-13 18:06:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:00,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575149308] [2025-04-13 18:06:00,497 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:00,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:00,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:00,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:00,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:01,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:01,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575149308] [2025-04-13 18:06:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575149308] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:01,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162815684] [2025-04-13 18:06:01,052 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:01,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:01,054 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 18:06:01,056 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 18:06:01,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:01,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:01,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:01,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:01,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:01,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:01,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:01,350 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 18:06:01,358 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 18:06:01,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:01,539 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:01,543 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 18:06:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162815684] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15, 12] total 29 [2025-04-13 18:06:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822156223] [2025-04-13 18:06:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:01,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:01,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:01,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:01,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:01,570 INFO L87 Difference]: Start difference. First operand 1758 states and 4974 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 18:06:02,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:02,175 INFO L93 Difference]: Finished difference Result 1863 states and 5241 transitions. [2025-04-13 18:06:02,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:06:02,176 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 18:06:02,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:02,185 INFO L225 Difference]: With dead ends: 1863 [2025-04-13 18:06:02,185 INFO L226 Difference]: Without dead ends: 1749 [2025-04-13 18:06:02,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1809, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:06:02,188 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 223 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:02,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 452 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-04-13 18:06:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1698. [2025-04-13 18:06:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1697 states have (on average 2.8037713612256923) internal successors, (4758), 1697 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 4758 transitions. [2025-04-13 18:06:02,258 INFO L79 Accepts]: Start accepts. Automaton has 1698 states and 4758 transitions. Word has length 56 [2025-04-13 18:06:02,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:02,259 INFO L485 AbstractCegarLoop]: Abstraction has 1698 states and 4758 transitions. [2025-04-13 18:06:02,259 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 18:06:02,259 INFO L278 IsEmpty]: Start isEmpty. Operand 1698 states and 4758 transitions. [2025-04-13 18:06:02,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:02,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:02,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 18:06:02,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:02,463 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 18:06:02,463 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 18:06:02,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1448208951, now seen corresponding path program 128 times [2025-04-13 18:06:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:02,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111403301] [2025-04-13 18:06:02,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:02,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:02,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:02,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:02,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:02,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 18:06:02,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:02,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111403301] [2025-04-13 18:06:02,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111403301] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:02,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:02,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:02,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564009952] [2025-04-13 18:06:02,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:02,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:02,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:02,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:02,580 INFO L87 Difference]: Start difference. First operand 1698 states and 4758 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 18:06:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:03,167 INFO L93 Difference]: Finished difference Result 2391 states and 6818 transitions. [2025-04-13 18:06:03,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:06:03,167 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 18:06:03,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:03,177 INFO L225 Difference]: With dead ends: 2391 [2025-04-13 18:06:03,177 INFO L226 Difference]: Without dead ends: 2327 [2025-04-13 18:06:03,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:06:03,178 INFO L437 NwaCegarLoop]: 94 mSDtfsCounter, 261 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:03,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 695 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2025-04-13 18:06:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 1690. [2025-04-13 18:06:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1689 states have (on average 2.8052101835405567) internal successors, (4738), 1689 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4738 transitions. [2025-04-13 18:06:03,208 INFO L79 Accepts]: Start accepts. Automaton has 1690 states and 4738 transitions. Word has length 56 [2025-04-13 18:06:03,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:03,208 INFO L485 AbstractCegarLoop]: Abstraction has 1690 states and 4738 transitions. [2025-04-13 18:06:03,208 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 18:06:03,208 INFO L278 IsEmpty]: Start isEmpty. Operand 1690 states and 4738 transitions. [2025-04-13 18:06:03,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:03,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:03,214 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:03,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2025-04-13 18:06:03,214 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 18:06:03,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash 316223003, now seen corresponding path program 129 times [2025-04-13 18:06:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:03,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511900113] [2025-04-13 18:06:03,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:03,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:03,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:03,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:03,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:03,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 18:06:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:03,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511900113] [2025-04-13 18:06:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511900113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:03,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228004942] [2025-04-13 18:06:03,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:03,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:03,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:03,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:03,331 INFO L87 Difference]: Start difference. First operand 1690 states and 4738 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 18:06:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:03,764 INFO L93 Difference]: Finished difference Result 1911 states and 5294 transitions. [2025-04-13 18:06:03,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:03,764 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 18:06:03,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:03,772 INFO L225 Difference]: With dead ends: 1911 [2025-04-13 18:06:03,773 INFO L226 Difference]: Without dead ends: 1847 [2025-04-13 18:06:03,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:06:03,773 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 243 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 450 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.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:03,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 450 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2025-04-13 18:06:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1700. [2025-04-13 18:06:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1699 states have (on average 2.803413772807534) internal successors, (4763), 1699 states have internal predecessors, (4763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:03,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 4763 transitions. [2025-04-13 18:06:03,794 INFO L79 Accepts]: Start accepts. Automaton has 1700 states and 4763 transitions. Word has length 56 [2025-04-13 18:06:03,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:03,795 INFO L485 AbstractCegarLoop]: Abstraction has 1700 states and 4763 transitions. [2025-04-13 18:06:03,795 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 18:06:03,795 INFO L278 IsEmpty]: Start isEmpty. Operand 1700 states and 4763 transitions. [2025-04-13 18:06:03,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:03,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:03,797 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:03,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2025-04-13 18:06:03,797 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 18:06:03,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1447715719, now seen corresponding path program 130 times [2025-04-13 18:06:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:03,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317703147] [2025-04-13 18:06:03,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:03,802 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:03,804 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 18:06:03,804 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:03,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:03,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 18:06:03,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:03,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317703147] [2025-04-13 18:06:03,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317703147] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:03,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:03,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:03,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116191341] [2025-04-13 18:06:03,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:03,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:03,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:03,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:03,890 INFO L87 Difference]: Start difference. First operand 1700 states and 4763 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 18:06:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:04,386 INFO L93 Difference]: Finished difference Result 2187 states and 6207 transitions. [2025-04-13 18:06:04,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:06:04,386 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 18:06:04,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:04,396 INFO L225 Difference]: With dead ends: 2187 [2025-04-13 18:06:04,397 INFO L226 Difference]: Without dead ends: 2128 [2025-04-13 18:06:04,397 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:04,397 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 254 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:04,398 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 494 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-04-13 18:06:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1752. [2025-04-13 18:06:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1751 states have (on average 2.810394060536836) internal successors, (4921), 1751 states have internal predecessors, (4921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4921 transitions. [2025-04-13 18:06:04,425 INFO L79 Accepts]: Start accepts. Automaton has 1752 states and 4921 transitions. Word has length 56 [2025-04-13 18:06:04,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:04,425 INFO L485 AbstractCegarLoop]: Abstraction has 1752 states and 4921 transitions. [2025-04-13 18:06:04,425 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 18:06:04,425 INFO L278 IsEmpty]: Start isEmpty. Operand 1752 states and 4921 transitions. [2025-04-13 18:06:04,427 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:04,427 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:04,427 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:04,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2025-04-13 18:06:04,427 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 18:06:04,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash 877555197, now seen corresponding path program 131 times [2025-04-13 18:06:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:04,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956531435] [2025-04-13 18:06:04,428 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:04,432 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:04,445 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:04,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:04,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:05,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:05,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956531435] [2025-04-13 18:06:05,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956531435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:05,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938336100] [2025-04-13 18:06:05,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:05,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:05,439 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 18:06:05,445 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 18:06:05,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:05,560 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:05,560 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:05,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:05,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:05,928 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:05,928 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 18:06:05,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 18:06:05,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:06:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938336100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:05,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:06:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:06:05,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434973668] [2025-04-13 18:06:05,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:05,937 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:05,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:05,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:06:05,937 INFO L87 Difference]: Start difference. First operand 1752 states and 4921 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 18:06:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:06,848 INFO L93 Difference]: Finished difference Result 1967 states and 5493 transitions. [2025-04-13 18:06:06,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:06,848 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 18:06:06,848 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:06,858 INFO L225 Difference]: With dead ends: 1967 [2025-04-13 18:06:06,858 INFO L226 Difference]: Without dead ends: 1902 [2025-04-13 18:06:06,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=176, Invalid=1630, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:06:06,859 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 263 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:06,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 438 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-04-13 18:06:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1757. [2025-04-13 18:06:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1756 states have (on average 2.808086560364465) internal successors, (4931), 1756 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 4931 transitions. [2025-04-13 18:06:06,881 INFO L79 Accepts]: Start accepts. Automaton has 1757 states and 4931 transitions. Word has length 56 [2025-04-13 18:06:06,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:06,881 INFO L485 AbstractCegarLoop]: Abstraction has 1757 states and 4931 transitions. [2025-04-13 18:06:06,882 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 18:06:06,882 INFO L278 IsEmpty]: Start isEmpty. Operand 1757 states and 4931 transitions. [2025-04-13 18:06:06,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:06,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:06,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 18:06:06,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 18:06:07,084 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 18:06:07,084 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 18:06:07,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:07,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1940504393, now seen corresponding path program 132 times [2025-04-13 18:06:07,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:07,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126412361] [2025-04-13 18:06:07,085 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:07,091 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:07,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:07,095 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:07,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:07,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:07,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126412361] [2025-04-13 18:06:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126412361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705845889] [2025-04-13 18:06:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:07,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:07,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:07,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:07,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:07,207 INFO L87 Difference]: Start difference. First operand 1757 states and 4931 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 18:06:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:07,698 INFO L93 Difference]: Finished difference Result 2181 states and 6182 transitions. [2025-04-13 18:06:07,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:06:07,698 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 18:06:07,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:07,709 INFO L225 Difference]: With dead ends: 2181 [2025-04-13 18:06:07,709 INFO L226 Difference]: Without dead ends: 2129 [2025-04-13 18:06:07,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:06:07,710 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 220 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:07,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 502 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-04-13 18:06:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1753. [2025-04-13 18:06:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 2.807648401826484) internal successors, (4919), 1752 states have internal predecessors, (4919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 4919 transitions. [2025-04-13 18:06:07,739 INFO L79 Accepts]: Start accepts. Automaton has 1753 states and 4919 transitions. Word has length 56 [2025-04-13 18:06:07,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:07,739 INFO L485 AbstractCegarLoop]: Abstraction has 1753 states and 4919 transitions. [2025-04-13 18:06:07,739 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 18:06:07,739 INFO L278 IsEmpty]: Start isEmpty. Operand 1753 states and 4919 transitions. [2025-04-13 18:06:07,741 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:07,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:07,741 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:07,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2025-04-13 18:06:07,742 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 18:06:07,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1435415495, now seen corresponding path program 133 times [2025-04-13 18:06:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:07,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415119057] [2025-04-13 18:06:07,742 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:07,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:07,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:07,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:07,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06: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 18:06:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:08,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415119057] [2025-04-13 18:06:08,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415119057] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:08,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64571197] [2025-04-13 18:06:08,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:08,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:08,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:08,311 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 18:06:08,312 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 18:06:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:08,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:08,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:08,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:08,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:08,637 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 18:06:08,645 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 18:06:08,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:08,832 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:08,832 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 18:06:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64571197] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15, 12] total 29 [2025-04-13 18:06:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895788107] [2025-04-13 18:06:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:08,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:08,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:08,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:08,857 INFO L87 Difference]: Start difference. First operand 1753 states and 4919 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 18:06:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:09,551 INFO L93 Difference]: Finished difference Result 1926 states and 5372 transitions. [2025-04-13 18:06:09,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:09,551 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 18:06:09,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:09,560 INFO L225 Difference]: With dead ends: 1926 [2025-04-13 18:06:09,561 INFO L226 Difference]: Without dead ends: 1862 [2025-04-13 18:06:09,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=2158, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:06:09,562 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 245 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:09,562 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 471 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-04-13 18:06:09,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1743. [2025-04-13 18:06:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1742 states have (on average 2.8065442020665903) internal successors, (4889), 1742 states have internal predecessors, (4889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 4889 transitions. [2025-04-13 18:06:09,586 INFO L79 Accepts]: Start accepts. Automaton has 1743 states and 4889 transitions. Word has length 56 [2025-04-13 18:06:09,586 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:09,586 INFO L485 AbstractCegarLoop]: Abstraction has 1743 states and 4889 transitions. [2025-04-13 18:06:09,587 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 18:06:09,587 INFO L278 IsEmpty]: Start isEmpty. Operand 1743 states and 4889 transitions. [2025-04-13 18:06:09,588 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:09,588 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:09,589 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:09,595 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 18:06:09,789 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 18:06:09,789 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 18:06:09,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:09,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2010914749, now seen corresponding path program 134 times [2025-04-13 18:06:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:09,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616631148] [2025-04-13 18:06:09,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:09,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:09,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:09,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:09,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:09,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:09,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:09,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616631148] [2025-04-13 18:06:09,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616631148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:09,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:09,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:09,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187158535] [2025-04-13 18:06:09,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:09,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:09,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:09,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:09,917 INFO L87 Difference]: Start difference. First operand 1743 states and 4889 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 18:06:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:10,410 INFO L93 Difference]: Finished difference Result 2175 states and 6160 transitions. [2025-04-13 18:06:10,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:06:10,410 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 18:06:10,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:10,421 INFO L225 Difference]: With dead ends: 2175 [2025-04-13 18:06:10,422 INFO L226 Difference]: Without dead ends: 2115 [2025-04-13 18:06:10,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:06:10,423 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 229 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:10,423 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 505 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-04-13 18:06:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1739. [2025-04-13 18:06:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 2.8060989643268126) internal successors, (4877), 1738 states have internal predecessors, (4877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:10,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 4877 transitions. [2025-04-13 18:06:10,447 INFO L79 Accepts]: Start accepts. Automaton has 1739 states and 4877 transitions. Word has length 56 [2025-04-13 18:06:10,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:10,447 INFO L485 AbstractCegarLoop]: Abstraction has 1739 states and 4877 transitions. [2025-04-13 18:06:10,447 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 18:06:10,447 INFO L278 IsEmpty]: Start isEmpty. Operand 1739 states and 4877 transitions. [2025-04-13 18:06:10,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:10,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:10,449 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:10,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2025-04-13 18:06:10,449 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 18:06:10,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 280218539, now seen corresponding path program 135 times [2025-04-13 18:06:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:10,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426545861] [2025-04-13 18:06:10,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:10,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:10,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:10,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:10,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:10,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:10,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426545861] [2025-04-13 18:06:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426545861] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:10,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213797674] [2025-04-13 18:06:10,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:10,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:10,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:10,563 INFO L87 Difference]: Start difference. First operand 1739 states and 4877 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 18:06:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:11,026 INFO L93 Difference]: Finished difference Result 1928 states and 5377 transitions. [2025-04-13 18:06:11,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:06:11,026 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 18:06:11,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:11,035 INFO L225 Difference]: With dead ends: 1928 [2025-04-13 18:06:11,035 INFO L226 Difference]: Without dead ends: 1863 [2025-04-13 18:06:11,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:11,036 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 250 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:11,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 470 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-04-13 18:06:11,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1749. [2025-04-13 18:06:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1748 states have (on average 2.8043478260869565) internal successors, (4902), 1748 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 4902 transitions. [2025-04-13 18:06:11,061 INFO L79 Accepts]: Start accepts. Automaton has 1749 states and 4902 transitions. Word has length 56 [2025-04-13 18:06:11,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:11,062 INFO L485 AbstractCegarLoop]: Abstraction has 1749 states and 4902 transitions. [2025-04-13 18:06:11,062 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 18:06:11,062 INFO L278 IsEmpty]: Start isEmpty. Operand 1749 states and 4902 transitions. [2025-04-13 18:06:11,064 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:11,064 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:11,064 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:11,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2025-04-13 18:06:11,064 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 18:06:11,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1876890645, now seen corresponding path program 136 times [2025-04-13 18:06:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:11,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463289981] [2025-04-13 18:06:11,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:11,069 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:11,072 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 18:06:11,072 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:11,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 18:06:11,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:11,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463289981] [2025-04-13 18:06:11,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463289981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:11,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:11,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222205460] [2025-04-13 18:06:11,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:11,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:11,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:11,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:11,164 INFO L87 Difference]: Start difference. First operand 1749 states and 4902 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 18:06:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:11,647 INFO L93 Difference]: Finished difference Result 2198 states and 6192 transitions. [2025-04-13 18:06:11,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:11,647 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 18:06:11,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:11,657 INFO L225 Difference]: With dead ends: 2198 [2025-04-13 18:06:11,657 INFO L226 Difference]: Without dead ends: 1966 [2025-04-13 18:06:11,658 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:06:11,658 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 265 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:11,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 562 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-04-13 18:06:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1661. [2025-04-13 18:06:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1660 states have (on average 2.7855421686746986) internal successors, (4624), 1660 states have internal predecessors, (4624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 4624 transitions. [2025-04-13 18:06:11,683 INFO L79 Accepts]: Start accepts. Automaton has 1661 states and 4624 transitions. Word has length 56 [2025-04-13 18:06:11,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:11,684 INFO L485 AbstractCegarLoop]: Abstraction has 1661 states and 4624 transitions. [2025-04-13 18:06:11,684 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 18:06:11,684 INFO L278 IsEmpty]: Start isEmpty. Operand 1661 states and 4624 transitions. [2025-04-13 18:06:11,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:11,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:11,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 18:06:11,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2025-04-13 18:06:11,686 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 18:06:11,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2032752153, now seen corresponding path program 137 times [2025-04-13 18:06:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:11,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091267015] [2025-04-13 18:06:11,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:11,691 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:11,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:11,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:12,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091267015] [2025-04-13 18:06:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091267015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:12,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682431653] [2025-04-13 18:06:12,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:12,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:12,569 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 18:06:12,573 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 18:06:12,654 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:12,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:12,675 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:12,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:12,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:12,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:12,917 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:12,918 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 18:06:12,926 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 18:06:12,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:13,118 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:13,119 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 18:06:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:13,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682431653] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:13,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:13,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:06:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462950818] [2025-04-13 18:06:13,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:13,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:13,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:13,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:13,145 INFO L87 Difference]: Start difference. First operand 1661 states and 4624 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 18:06:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:13,944 INFO L93 Difference]: Finished difference Result 1808 states and 5000 transitions. [2025-04-13 18:06:13,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:13,944 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 18:06:13,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:13,954 INFO L225 Difference]: With dead ends: 1808 [2025-04-13 18:06:13,954 INFO L226 Difference]: Without dead ends: 1689 [2025-04-13 18:06:13,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:06:13,955 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 246 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 474 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:13,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 474 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2025-04-13 18:06:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1596. [2025-04-13 18:06:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 2.8043887147335425) internal successors, (4473), 1595 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4473 transitions. [2025-04-13 18:06:13,976 INFO L79 Accepts]: Start accepts. Automaton has 1596 states and 4473 transitions. Word has length 56 [2025-04-13 18:06:13,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:13,976 INFO L485 AbstractCegarLoop]: Abstraction has 1596 states and 4473 transitions. [2025-04-13 18:06:13,976 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 18:06:13,976 INFO L278 IsEmpty]: Start isEmpty. Operand 1596 states and 4473 transitions. [2025-04-13 18:06:13,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:13,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 18:06:13,985 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 18:06:14,178 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 18:06:14,179 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 18:06:14,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash -447194543, now seen corresponding path program 138 times [2025-04-13 18:06:14,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:14,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282142056] [2025-04-13 18:06:14,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:14,184 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:14,188 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:14,188 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:14,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:14,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:14,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282142056] [2025-04-13 18:06:14,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282142056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:14,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:14,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058633801] [2025-04-13 18:06:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:14,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:14,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:14,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:14,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:14,310 INFO L87 Difference]: Start difference. First operand 1596 states and 4473 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 18:06:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:14,816 INFO L93 Difference]: Finished difference Result 2041 states and 5788 transitions. [2025-04-13 18:06:14,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:14,816 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 18:06:14,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:14,825 INFO L225 Difference]: With dead ends: 2041 [2025-04-13 18:06:14,825 INFO L226 Difference]: Without dead ends: 1982 [2025-04-13 18:06:14,826 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:14,826 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 246 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:14,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 564 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2025-04-13 18:06:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1658. [2025-04-13 18:06:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 2.8147254073627037) internal successors, (4664), 1657 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 18:06:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 4664 transitions. [2025-04-13 18:06:14,848 INFO L79 Accepts]: Start accepts. Automaton has 1658 states and 4664 transitions. Word has length 56 [2025-04-13 18:06:14,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:14,848 INFO L485 AbstractCegarLoop]: Abstraction has 1658 states and 4664 transitions. [2025-04-13 18:06:14,848 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 18:06:14,848 INFO L278 IsEmpty]: Start isEmpty. Operand 1658 states and 4664 transitions. [2025-04-13 18:06:14,850 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:14,850 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:14,850 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:14,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2025-04-13 18:06:14,850 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 18:06:14,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash -134314263, now seen corresponding path program 139 times [2025-04-13 18:06:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:14,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633195358] [2025-04-13 18:06:14,850 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:14,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:14,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:14,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:14,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:15,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 18:06:15,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:15,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633195358] [2025-04-13 18:06:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633195358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:15,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98626500] [2025-04-13 18:06:15,831 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:15,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:15,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:15,834 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 18:06:15,835 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 18:06:15,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:15,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:16,199 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:16,199 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 18:06:16,205 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 18:06:16,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:16,447 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:16,448 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 18:06:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98626500] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:16,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:06:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318699595] [2025-04-13 18:06:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:16,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:16,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1035, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:16,476 INFO L87 Difference]: Start difference. First operand 1658 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 18:06:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:17,315 INFO L93 Difference]: Finished difference Result 1853 states and 5200 transitions. [2025-04-13 18:06:17,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:17,315 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 18:06:17,315 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:17,325 INFO L225 Difference]: With dead ends: 1853 [2025-04-13 18:06:17,325 INFO L226 Difference]: Without dead ends: 1717 [2025-04-13 18:06:17,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=2648, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 18:06:17,327 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 321 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:17,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 568 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-04-13 18:06:17,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1608. [2025-04-13 18:06:17,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 2.8133167392657126) internal successors, (4521), 1607 states have internal predecessors, (4521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:17,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4521 transitions. [2025-04-13 18:06:17,349 INFO L79 Accepts]: Start accepts. Automaton has 1608 states and 4521 transitions. Word has length 56 [2025-04-13 18:06:17,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:17,349 INFO L485 AbstractCegarLoop]: Abstraction has 1608 states and 4521 transitions. [2025-04-13 18:06:17,349 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 18:06:17,350 INFO L278 IsEmpty]: Start isEmpty. Operand 1608 states and 4521 transitions. [2025-04-13 18:06:17,351 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:17,351 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:17,351 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:17,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:17,556 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 18:06:17,556 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 18:06:17,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash -939983217, now seen corresponding path program 140 times [2025-04-13 18:06:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:17,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913759255] [2025-04-13 18:06:17,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:17,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:17,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:17,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:17,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:17,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913759255] [2025-04-13 18:06:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913759255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:17,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:17,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:17,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849654824] [2025-04-13 18:06:17,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:17,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:17,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:17,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:17,699 INFO L87 Difference]: Start difference. First operand 1608 states and 4521 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 18:06:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:18,199 INFO L93 Difference]: Finished difference Result 1980 states and 5610 transitions. [2025-04-13 18:06:18,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:18,200 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 18:06:18,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:18,209 INFO L225 Difference]: With dead ends: 1980 [2025-04-13 18:06:18,209 INFO L226 Difference]: Without dead ends: 1928 [2025-04-13 18:06:18,210 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:18,210 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 571 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 18:06:18,210 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 571 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-04-13 18:06:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1604. [2025-04-13 18:06:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 2.812850904553961) internal successors, (4509), 1603 states have internal predecessors, (4509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 4509 transitions. [2025-04-13 18:06:18,232 INFO L79 Accepts]: Start accepts. Automaton has 1604 states and 4509 transitions. Word has length 56 [2025-04-13 18:06:18,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:18,232 INFO L485 AbstractCegarLoop]: Abstraction has 1604 states and 4509 transitions. [2025-04-13 18:06:18,232 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 18:06:18,232 INFO L278 IsEmpty]: Start isEmpty. Operand 1604 states and 4509 transitions. [2025-04-13 18:06:18,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:18,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:18,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:18,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2025-04-13 18:06:18,234 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 18:06:18,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2015566543, now seen corresponding path program 141 times [2025-04-13 18:06:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:18,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480021265] [2025-04-13 18:06:18,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:18,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:18,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:18,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:18,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:18,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:18,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 18:06:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:18,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480021265] [2025-04-13 18:06:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480021265] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990420318] [2025-04-13 18:06:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:18,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:18,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:18,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:18,379 INFO L87 Difference]: Start difference. First operand 1604 states and 4509 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 18:06:18,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:18,863 INFO L93 Difference]: Finished difference Result 1826 states and 5062 transitions. [2025-04-13 18:06:18,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:18,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 18:06:18,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:18,873 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 18:06:18,873 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 18:06:18,874 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:18,874 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 249 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:18,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 465 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 18:06:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1619. [2025-04-13 18:06:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1618 states have (on average 2.811495673671199) internal successors, (4549), 1618 states have internal predecessors, (4549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 4549 transitions. [2025-04-13 18:06:18,903 INFO L79 Accepts]: Start accepts. Automaton has 1619 states and 4549 transitions. Word has length 56 [2025-04-13 18:06:18,904 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:18,904 INFO L485 AbstractCegarLoop]: Abstraction has 1619 states and 4549 transitions. [2025-04-13 18:06:18,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 18:06:18,904 INFO L278 IsEmpty]: Start isEmpty. Operand 1619 states and 4549 transitions. [2025-04-13 18:06:18,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:18,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:18,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 18:06:18,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2025-04-13 18:06:18,906 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 18:06:18,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1283531371, now seen corresponding path program 142 times [2025-04-13 18:06:18,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:18,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677597071] [2025-04-13 18:06:18,907 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:18,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:18,911 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:18,914 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 18:06:18,914 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:18,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:19,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677597071] [2025-04-13 18:06:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677597071] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:19,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:19,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:19,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928314717] [2025-04-13 18:06:19,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:19,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:19,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:19,003 INFO L87 Difference]: Start difference. First operand 1619 states and 4549 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 18:06:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:19,514 INFO L93 Difference]: Finished difference Result 1999 states and 5658 transitions. [2025-04-13 18:06:19,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:19,515 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 18:06:19,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:19,524 INFO L225 Difference]: With dead ends: 1999 [2025-04-13 18:06:19,524 INFO L226 Difference]: Without dead ends: 1939 [2025-04-13 18:06:19,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:19,525 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 222 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 574 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:19,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 574 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2025-04-13 18:06:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1615. [2025-04-13 18:06:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 2.8110285006195785) internal successors, (4537), 1614 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 4537 transitions. [2025-04-13 18:06:19,550 INFO L79 Accepts]: Start accepts. Automaton has 1615 states and 4537 transitions. Word has length 56 [2025-04-13 18:06:19,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:19,550 INFO L485 AbstractCegarLoop]: Abstraction has 1615 states and 4537 transitions. [2025-04-13 18:06:19,550 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 18:06:19,550 INFO L278 IsEmpty]: Start isEmpty. Operand 1615 states and 4537 transitions. [2025-04-13 18:06:19,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:19,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:19,552 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:19,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2025-04-13 18:06:19,552 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 18:06:19,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1454234349, now seen corresponding path program 143 times [2025-04-13 18:06:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:19,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779101090] [2025-04-13 18:06:19,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:19,559 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:19,568 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:19,568 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:19,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:21,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779101090] [2025-04-13 18:06:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779101090] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:21,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277062064] [2025-04-13 18:06:21,214 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:21,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:21,216 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 18:06:21,218 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 18:06:21,311 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:21,333 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:21,333 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:21,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:21,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:21,562 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:21,563 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 18:06:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:21,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:06:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277062064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:06:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:06:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460017109] [2025-04-13 18:06:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:21,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:06:21,592 INFO L87 Difference]: Start difference. First operand 1615 states and 4537 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 18:06:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:22,464 INFO L93 Difference]: Finished difference Result 1826 states and 5091 transitions. [2025-04-13 18:06:22,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:06:22,464 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 18:06:22,464 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:22,474 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 18:06:22,474 INFO L226 Difference]: Without dead ends: 1761 [2025-04-13 18:06:22,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:06:22,475 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 260 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 399 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.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:22,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 399 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-04-13 18:06:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1620. [2025-04-13 18:06:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1619 states have (on average 2.8085237801111798) internal successors, (4547), 1619 states have internal predecessors, (4547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 4547 transitions. [2025-04-13 18:06:22,496 INFO L79 Accepts]: Start accepts. Automaton has 1620 states and 4547 transitions. Word has length 56 [2025-04-13 18:06:22,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:22,496 INFO L485 AbstractCegarLoop]: Abstraction has 1620 states and 4547 transitions. [2025-04-13 18:06:22,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 18:06:22,496 INFO L278 IsEmpty]: Start isEmpty. Operand 1620 states and 4547 transitions. [2025-04-13 18:06:22,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:22,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:22,498 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:22,505 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 18:06:22,699 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 18:06:22,699 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 18:06:22,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:22,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1417555475, now seen corresponding path program 144 times [2025-04-13 18:06:22,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:22,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628273019] [2025-04-13 18:06:22,699 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:22,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:22,706 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:22,715 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:22,715 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:22,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628273019] [2025-04-13 18:06:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628273019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:22,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:22,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547800840] [2025-04-13 18:06:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:22,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:22,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:22,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:22,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:22,841 INFO L87 Difference]: Start difference. First operand 1620 states and 4547 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 18:06:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:23,349 INFO L93 Difference]: Finished difference Result 2069 states and 5837 transitions. [2025-04-13 18:06:23,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:23,349 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 18:06:23,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:23,358 INFO L225 Difference]: With dead ends: 2069 [2025-04-13 18:06:23,358 INFO L226 Difference]: Without dead ends: 1881 [2025-04-13 18:06:23,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:23,359 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 268 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:23,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 633 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-04-13 18:06:23,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1576. [2025-04-13 18:06:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 2.7955555555555556) internal successors, (4403), 1575 states have internal predecessors, (4403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 4403 transitions. [2025-04-13 18:06:23,381 INFO L79 Accepts]: Start accepts. Automaton has 1576 states and 4403 transitions. Word has length 56 [2025-04-13 18:06:23,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:23,381 INFO L485 AbstractCegarLoop]: Abstraction has 1576 states and 4403 transitions. [2025-04-13 18:06:23,381 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 18:06:23,381 INFO L278 IsEmpty]: Start isEmpty. Operand 1576 states and 4403 transitions. [2025-04-13 18:06:23,383 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:23,383 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:23,383 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:23,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2025-04-13 18:06:23,383 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 18:06:23,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:23,383 INFO L85 PathProgramCache]: Analyzing trace with hash 527762255, now seen corresponding path program 145 times [2025-04-13 18:06:23,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:23,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763130573] [2025-04-13 18:06:23,383 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:23,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:23,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:23,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:23,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:23,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:24,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:24,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:24,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763130573] [2025-04-13 18:06:24,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763130573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:24,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516318453] [2025-04-13 18:06:24,238 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:24,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:24,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:24,240 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 18:06:24,241 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 18:06:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:24,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:24,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:24,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:24,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:24,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:24,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:24,579 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 18:06:24,626 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 18:06:24,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:24,836 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:24,836 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 18:06:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516318453] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:06:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296934990] [2025-04-13 18:06:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:24,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:24,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:24,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:24,867 INFO L87 Difference]: Start difference. First operand 1576 states and 4403 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 18:06:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:25,617 INFO L93 Difference]: Finished difference Result 1745 states and 4838 transitions. [2025-04-13 18:06:25,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:25,617 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 18:06:25,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:25,626 INFO L225 Difference]: With dead ends: 1745 [2025-04-13 18:06:25,626 INFO L226 Difference]: Without dead ends: 1681 [2025-04-13 18:06:25,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=2552, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:06:25,627 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 224 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:25,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 460 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2025-04-13 18:06:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1566. [2025-04-13 18:06:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 2.797444089456869) internal successors, (4378), 1565 states have internal predecessors, (4378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:25,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 4378 transitions. [2025-04-13 18:06:25,649 INFO L79 Accepts]: Start accepts. Automaton has 1566 states and 4378 transitions. Word has length 56 [2025-04-13 18:06:25,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:25,649 INFO L485 AbstractCegarLoop]: Abstraction has 1566 states and 4378 transitions. [2025-04-13 18:06:25,649 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 18:06:25,649 INFO L278 IsEmpty]: Start isEmpty. Operand 1566 states and 4378 transitions. [2025-04-13 18:06:25,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:25,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:25,651 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:25,658 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 18:06:25,851 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 18:06:25,852 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 18:06:25,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash -853790281, now seen corresponding path program 146 times [2025-04-13 18:06:25,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:25,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520915135] [2025-04-13 18:06:25,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:25,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:25,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:25,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:25,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:26,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:26,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520915135] [2025-04-13 18:06:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520915135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656125750] [2025-04-13 18:06:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:26,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:26,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:26,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:26,003 INFO L87 Difference]: Start difference. First operand 1566 states and 4378 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 18:06:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:26,683 INFO L93 Difference]: Finished difference Result 1973 states and 5529 transitions. [2025-04-13 18:06:26,683 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:06:26,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 18:06:26,683 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:26,692 INFO L225 Difference]: With dead ends: 1973 [2025-04-13 18:06:26,692 INFO L226 Difference]: Without dead ends: 1779 [2025-04-13 18:06:26,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:06:26,693 INFO L437 NwaCegarLoop]: 73 mSDtfsCounter, 206 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:26,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 632 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-04-13 18:06:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1536. [2025-04-13 18:06:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 2.8006514657980457) internal successors, (4299), 1535 states have internal predecessors, (4299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 4299 transitions. [2025-04-13 18:06:26,713 INFO L79 Accepts]: Start accepts. Automaton has 1536 states and 4299 transitions. Word has length 56 [2025-04-13 18:06:26,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:26,713 INFO L485 AbstractCegarLoop]: Abstraction has 1536 states and 4299 transitions. [2025-04-13 18:06:26,713 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 18:06:26,713 INFO L278 IsEmpty]: Start isEmpty. Operand 1536 states and 4299 transitions. [2025-04-13 18:06:26,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:26,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:26,715 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:26,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 18:06:26,715 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 18:06:26,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1753411331, now seen corresponding path program 147 times [2025-04-13 18:06:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:26,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649140913] [2025-04-13 18:06:26,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:26,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:26,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:26,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:26,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:26,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:26,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:26,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649140913] [2025-04-13 18:06:26,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649140913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:26,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:26,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:26,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119243744] [2025-04-13 18:06:26,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:26,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:26,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:26,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:26,836 INFO L87 Difference]: Start difference. First operand 1536 states and 4299 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 18:06:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:27,468 INFO L93 Difference]: Finished difference Result 1837 states and 5123 transitions. [2025-04-13 18:06:27,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:06:27,469 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 18:06:27,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:27,478 INFO L225 Difference]: With dead ends: 1837 [2025-04-13 18:06:27,478 INFO L226 Difference]: Without dead ends: 1751 [2025-04-13 18:06:27,479 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:06:27,479 INFO L437 NwaCegarLoop]: 78 mSDtfsCounter, 378 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:27,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 616 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-04-13 18:06:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1541. [2025-04-13 18:06:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 2.798051948051948) internal successors, (4309), 1540 states have internal predecessors, (4309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 4309 transitions. [2025-04-13 18:06:27,499 INFO L79 Accepts]: Start accepts. Automaton has 1541 states and 4309 transitions. Word has length 56 [2025-04-13 18:06:27,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:27,499 INFO L485 AbstractCegarLoop]: Abstraction has 1541 states and 4309 transitions. [2025-04-13 18:06:27,499 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 18:06:27,499 INFO L278 IsEmpty]: Start isEmpty. Operand 1541 states and 4309 transitions. [2025-04-13 18:06:27,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:27,501 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:27,501 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:27,501 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2025-04-13 18:06:27,501 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 18:06:27,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1859794413, now seen corresponding path program 148 times [2025-04-13 18:06:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:27,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022968894] [2025-04-13 18:06:27,502 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:27,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:27,509 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 18:06:27,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:27,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:27,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022968894] [2025-04-13 18:06:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022968894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:27,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:27,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735366358] [2025-04-13 18:06:27,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:27,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:27,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:27,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:27,604 INFO L87 Difference]: Start difference. First operand 1541 states and 4309 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 18:06:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:28,115 INFO L93 Difference]: Finished difference Result 1885 states and 5312 transitions. [2025-04-13 18:06:28,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:28,115 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 18:06:28,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:28,124 INFO L225 Difference]: With dead ends: 1885 [2025-04-13 18:06:28,124 INFO L226 Difference]: Without dead ends: 1788 [2025-04-13 18:06:28,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:28,125 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 261 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:28,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 484 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2025-04-13 18:06:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1603. [2025-04-13 18:06:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 2.808988764044944) internal successors, (4500), 1602 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:28,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 4500 transitions. [2025-04-13 18:06:28,146 INFO L79 Accepts]: Start accepts. Automaton has 1603 states and 4500 transitions. Word has length 56 [2025-04-13 18:06:28,146 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:28,146 INFO L485 AbstractCegarLoop]: Abstraction has 1603 states and 4500 transitions. [2025-04-13 18:06:28,146 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 18:06:28,146 INFO L278 IsEmpty]: Start isEmpty. Operand 1603 states and 4500 transitions. [2025-04-13 18:06:28,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:28,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:28,148 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:28,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 18:06:28,148 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 18:06:28,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2051571007, now seen corresponding path program 149 times [2025-04-13 18:06:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:28,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393029802] [2025-04-13 18:06:28,148 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:28,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:28,163 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:28,163 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:28,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:28,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393029802] [2025-04-13 18:06:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393029802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:28,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895955456] [2025-04-13 18:06:28,937 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:28,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:28,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:28,939 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 18:06:28,941 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 18:06:29,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:29,042 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:29,042 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:29,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:29,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:29,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:29,254 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:29,254 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 18:06:29,263 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 18:06:29,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:29,458 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:29,458 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 18:06:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:29,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895955456] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:29,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:06:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762961908] [2025-04-13 18:06:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:29,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:29,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:29,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:29,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:29,481 INFO L87 Difference]: Start difference. First operand 1603 states and 4500 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 18:06:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:30,262 INFO L93 Difference]: Finished difference Result 1788 states and 4982 transitions. [2025-04-13 18:06:30,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:06:30,262 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 18:06:30,263 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:30,271 INFO L225 Difference]: With dead ends: 1788 [2025-04-13 18:06:30,271 INFO L226 Difference]: Without dead ends: 1723 [2025-04-13 18:06:30,272 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=2553, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:06:30,272 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 251 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:30,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 480 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-04-13 18:06:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1608. [2025-04-13 18:06:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1607 states have (on average 2.806471686372122) internal successors, (4510), 1607 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4510 transitions. [2025-04-13 18:06:30,292 INFO L79 Accepts]: Start accepts. Automaton has 1608 states and 4510 transitions. Word has length 56 [2025-04-13 18:06:30,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:30,293 INFO L485 AbstractCegarLoop]: Abstraction has 1608 states and 4510 transitions. [2025-04-13 18:06:30,293 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 18:06:30,293 INFO L278 IsEmpty]: Start isEmpty. Operand 1608 states and 4510 transitions. [2025-04-13 18:06:30,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:30,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:30,294 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:30,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 18:06:30,499 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 18:06:30,499 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 18:06:30,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1749307317, now seen corresponding path program 150 times [2025-04-13 18:06:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:30,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261603024] [2025-04-13 18:06:30,499 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:30,507 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:30,511 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:30,511 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:30,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 18:06:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:30,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261603024] [2025-04-13 18:06:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261603024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473921813] [2025-04-13 18:06:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:30,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:30,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:30,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:30,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:30,627 INFO L87 Difference]: Start difference. First operand 1608 states and 4510 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 18:06:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:31,092 INFO L93 Difference]: Finished difference Result 1879 states and 5287 transitions. [2025-04-13 18:06:31,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:06:31,092 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 18:06:31,092 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:31,101 INFO L225 Difference]: With dead ends: 1879 [2025-04-13 18:06:31,101 INFO L226 Difference]: Without dead ends: 1820 [2025-04-13 18:06:31,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:31,101 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 157 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:31,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 487 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2025-04-13 18:06:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1664. [2025-04-13 18:06:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 2.8117859290438965) internal successors, (4676), 1663 states have internal predecessors, (4676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4676 transitions. [2025-04-13 18:06:31,122 INFO L79 Accepts]: Start accepts. Automaton has 1664 states and 4676 transitions. Word has length 56 [2025-04-13 18:06:31,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:31,122 INFO L485 AbstractCegarLoop]: Abstraction has 1664 states and 4676 transitions. [2025-04-13 18:06:31,122 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 18:06:31,122 INFO L278 IsEmpty]: Start isEmpty. Operand 1664 states and 4676 transitions. [2025-04-13 18:06:31,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:31,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:31,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 18:06:31,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 18:06:31,124 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 18:06:31,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -69574403, now seen corresponding path program 151 times [2025-04-13 18:06:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:31,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471254074] [2025-04-13 18:06:31,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:31,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:31,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:31,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:31,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:31,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471254074] [2025-04-13 18:06:31,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471254074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:31,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184070825] [2025-04-13 18:06:31,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:31,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:31,742 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 18:06:31,744 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 18:06:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:31,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:31,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:31,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:31,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:31,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:32,078 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:32,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 18:06:32,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 18:06:32,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:32,285 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:32,285 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 18:06:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184070825] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:06:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287345168] [2025-04-13 18:06:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:32,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:32,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:32,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:32,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:32,313 INFO L87 Difference]: Start difference. First operand 1664 states and 4676 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 18:06:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:33,070 INFO L93 Difference]: Finished difference Result 1807 states and 5039 transitions. [2025-04-13 18:06:33,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:33,071 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 18:06:33,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:33,080 INFO L225 Difference]: With dead ends: 1807 [2025-04-13 18:06:33,080 INFO L226 Difference]: Without dead ends: 1738 [2025-04-13 18:06:33,081 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=2361, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:06:33,081 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 227 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:33,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 469 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-04-13 18:06:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1649. [2025-04-13 18:06:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 2.816140776699029) internal successors, (4641), 1648 states have internal predecessors, (4641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 4641 transitions. [2025-04-13 18:06:33,102 INFO L79 Accepts]: Start accepts. Automaton has 1649 states and 4641 transitions. Word has length 56 [2025-04-13 18:06:33,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:33,102 INFO L485 AbstractCegarLoop]: Abstraction has 1649 states and 4641 transitions. [2025-04-13 18:06:33,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 18:06:33,102 INFO L278 IsEmpty]: Start isEmpty. Operand 1649 states and 4641 transitions. [2025-04-13 18:06:33,104 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:33,104 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:33,104 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:33,112 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 18:06:33,307 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 18:06:33,308 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 18:06:33,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1256518643, now seen corresponding path program 152 times [2025-04-13 18:06:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:33,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422546434] [2025-04-13 18:06:33,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:33,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:33,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:33,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:33,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:33,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:33,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422546434] [2025-04-13 18:06:33,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422546434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:33,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:33,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:33,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988112398] [2025-04-13 18:06:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:33,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:33,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:33,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:33,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:33,452 INFO L87 Difference]: Start difference. First operand 1649 states and 4641 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 18:06:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:33,891 INFO L93 Difference]: Finished difference Result 1830 states and 5154 transitions. [2025-04-13 18:06:33,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:06:33,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 18:06:33,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:33,901 INFO L225 Difference]: With dead ends: 1830 [2025-04-13 18:06:33,901 INFO L226 Difference]: Without dead ends: 1770 [2025-04-13 18:06:33,902 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:33,902 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 144 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:33,902 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 477 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:33,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-04-13 18:06:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1637. [2025-04-13 18:06:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1636 states have (on average 2.817237163814181) internal successors, (4609), 1636 states have internal predecessors, (4609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 4609 transitions. [2025-04-13 18:06:33,923 INFO L79 Accepts]: Start accepts. Automaton has 1637 states and 4609 transitions. Word has length 56 [2025-04-13 18:06:33,923 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:33,923 INFO L485 AbstractCegarLoop]: Abstraction has 1637 states and 4609 transitions. [2025-04-13 18:06:33,923 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 18:06:33,923 INFO L278 IsEmpty]: Start isEmpty. Operand 1637 states and 4609 transitions. [2025-04-13 18:06:33,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:33,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:33,925 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:33,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 18:06:33,925 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 18:06:33,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -179209227, now seen corresponding path program 153 times [2025-04-13 18:06:33,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:33,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785594323] [2025-04-13 18:06:33,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:33,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:33,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:33,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:34,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 18:06:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:34,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785594323] [2025-04-13 18:06:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785594323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:34,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344463877] [2025-04-13 18:06:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:34,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:34,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:34,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:34,058 INFO L87 Difference]: Start difference. First operand 1637 states and 4609 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 18:06:34,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:34,493 INFO L93 Difference]: Finished difference Result 1770 states and 4947 transitions. [2025-04-13 18:06:34,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:06:34,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 18:06:34,494 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:34,502 INFO L225 Difference]: With dead ends: 1770 [2025-04-13 18:06:34,502 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 18:06:34,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:06:34,503 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 254 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:34,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 398 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 18:06:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1647. [2025-04-13 18:06:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1646 states have (on average 2.8122721749696233) internal successors, (4629), 1646 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4629 transitions. [2025-04-13 18:06:34,523 INFO L79 Accepts]: Start accepts. Automaton has 1647 states and 4629 transitions. Word has length 56 [2025-04-13 18:06:34,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:34,523 INFO L485 AbstractCegarLoop]: Abstraction has 1647 states and 4629 transitions. [2025-04-13 18:06:34,523 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 18:06:34,523 INFO L278 IsEmpty]: Start isEmpty. Operand 1647 states and 4629 transitions. [2025-04-13 18:06:34,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:34,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:34,525 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:34,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2025-04-13 18:06:34,525 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 18:06:34,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -829107693, now seen corresponding path program 154 times [2025-04-13 18:06:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:34,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517583983] [2025-04-13 18:06:34,525 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:34,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:34,533 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 18:06:34,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:34,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:34,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517583983] [2025-04-13 18:06:34,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517583983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:34,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:34,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256166729] [2025-04-13 18:06:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:34,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:34,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:34,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:34,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:34,628 INFO L87 Difference]: Start difference. First operand 1647 states and 4629 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 18:06:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:35,148 INFO L93 Difference]: Finished difference Result 1904 states and 5350 transitions. [2025-04-13 18:06:35,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:35,148 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 18:06:35,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:35,161 INFO L225 Difference]: With dead ends: 1904 [2025-04-13 18:06:35,161 INFO L226 Difference]: Without dead ends: 1845 [2025-04-13 18:06:35,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:35,162 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 215 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:35,162 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 587 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2025-04-13 18:06:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1655. [2025-04-13 18:06:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 2.8107617896009676) internal successors, (4649), 1654 states have internal predecessors, (4649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4649 transitions. [2025-04-13 18:06:35,185 INFO L79 Accepts]: Start accepts. Automaton has 1655 states and 4649 transitions. Word has length 56 [2025-04-13 18:06:35,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:35,186 INFO L485 AbstractCegarLoop]: Abstraction has 1655 states and 4649 transitions. [2025-04-13 18:06:35,186 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 18:06:35,186 INFO L278 IsEmpty]: Start isEmpty. Operand 1655 states and 4649 transitions. [2025-04-13 18:06:35,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:35,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:35,188 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:35,188 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 18:06:35,188 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 18:06:35,188 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash 483343349, now seen corresponding path program 155 times [2025-04-13 18:06:35,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:35,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437702775] [2025-04-13 18:06:35,188 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:35,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:35,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:35,200 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:35,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:36,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 18:06:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:36,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437702775] [2025-04-13 18:06:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437702775] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:36,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978081610] [2025-04-13 18:06:36,090 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:36,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:36,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:36,093 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 18:06:36,094 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 18:06:36,181 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:36,212 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:36,212 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:36,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:36,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:36,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:36,382 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:36,382 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 18:06:36,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 18:06:36,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:06:36,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978081610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:36,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:06:36,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:06:36,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824743012] [2025-04-13 18:06:36,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:36,403 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:36,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:36,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:36,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:06:36,403 INFO L87 Difference]: Start difference. First operand 1655 states and 4649 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 18:06:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:37,044 INFO L93 Difference]: Finished difference Result 1762 states and 4915 transitions. [2025-04-13 18:06:37,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:06:37,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 18:06:37,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:37,052 INFO L225 Difference]: With dead ends: 1762 [2025-04-13 18:06:37,053 INFO L226 Difference]: Without dead ends: 1697 [2025-04-13 18:06:37,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:06:37,053 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 162 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:37,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 383 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-04-13 18:06:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1660. [2025-04-13 18:06:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1659 states have (on average 2.8083182640144666) internal successors, (4659), 1659 states have internal predecessors, (4659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 4659 transitions. [2025-04-13 18:06:37,075 INFO L79 Accepts]: Start accepts. Automaton has 1660 states and 4659 transitions. Word has length 56 [2025-04-13 18:06:37,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:37,075 INFO L485 AbstractCegarLoop]: Abstraction has 1660 states and 4659 transitions. [2025-04-13 18:06:37,075 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 18:06:37,075 INFO L278 IsEmpty]: Start isEmpty. Operand 1660 states and 4659 transitions. [2025-04-13 18:06:37,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:37,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:37,077 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:37,084 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 18:06:37,278 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 18:06:37,278 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 18:06:37,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1321896367, now seen corresponding path program 156 times [2025-04-13 18:06:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:37,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178164946] [2025-04-13 18:06:37,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:37,283 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:37,287 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:37,287 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:37,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:37,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:37,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178164946] [2025-04-13 18:06:37,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178164946] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:37,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:37,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:37,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473492455] [2025-04-13 18:06:37,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:37,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:37,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:37,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:37,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:37,398 INFO L87 Difference]: Start difference. First operand 1660 states and 4659 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 18:06:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:37,854 INFO L93 Difference]: Finished difference Result 1898 states and 5325 transitions. [2025-04-13 18:06:37,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:37,854 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 18:06:37,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:37,862 INFO L225 Difference]: With dead ends: 1898 [2025-04-13 18:06:37,862 INFO L226 Difference]: Without dead ends: 1846 [2025-04-13 18:06:37,863 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:06:37,863 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 187 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:37,863 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 583 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-04-13 18:06:37,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1656. [2025-04-13 18:06:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.8078549848942598) internal successors, (4647), 1655 states have internal predecessors, (4647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4647 transitions. [2025-04-13 18:06:37,883 INFO L79 Accepts]: Start accepts. Automaton has 1656 states and 4647 transitions. Word has length 56 [2025-04-13 18:06:37,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:37,884 INFO L485 AbstractCegarLoop]: Abstraction has 1656 states and 4647 transitions. [2025-04-13 18:06:37,884 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 18:06:37,884 INFO L278 IsEmpty]: Start isEmpty. Operand 1656 states and 4647 transitions. [2025-04-13 18:06:37,885 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:37,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:37,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 18:06:37,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2025-04-13 18:06:37,886 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 18:06:37,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1829627343, now seen corresponding path program 157 times [2025-04-13 18:06:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:37,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446275356] [2025-04-13 18:06:37,886 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:37,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:37,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:37,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:37,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:38,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446275356] [2025-04-13 18:06:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446275356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:38,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390293596] [2025-04-13 18:06:38,674 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:38,675 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 18:06:38,676 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 18:06:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:38,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:38,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:38,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:38,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:38,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:38,950 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:38,950 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 18:06:38,987 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 18:06:38,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:39,155 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:39,155 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 18:06:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390293596] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:39,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:06:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880720255] [2025-04-13 18:06:39,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:39,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:39,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:39,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:39,175 INFO L87 Difference]: Start difference. First operand 1656 states and 4647 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 18:06:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:39,609 INFO L93 Difference]: Finished difference Result 1721 states and 4794 transitions. [2025-04-13 18:06:39,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:06:39,609 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 18:06:39,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:39,617 INFO L225 Difference]: With dead ends: 1721 [2025-04-13 18:06:39,617 INFO L226 Difference]: Without dead ends: 1565 [2025-04-13 18:06:39,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=1991, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:06:39,618 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 143 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:39,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 370 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-04-13 18:06:39,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1554. [2025-04-13 18:06:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1553 states have (on average 2.8415969092079845) internal successors, (4413), 1553 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 4413 transitions. [2025-04-13 18:06:39,641 INFO L79 Accepts]: Start accepts. Automaton has 1554 states and 4413 transitions. Word has length 56 [2025-04-13 18:06:39,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:39,641 INFO L485 AbstractCegarLoop]: Abstraction has 1554 states and 4413 transitions. [2025-04-13 18:06:39,641 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 18:06:39,641 INFO L278 IsEmpty]: Start isEmpty. Operand 1554 states and 4413 transitions. [2025-04-13 18:06:39,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:39,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:39,643 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:39,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:39,843 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 18:06:39,844 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 18:06:39,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1665444521, now seen corresponding path program 158 times [2025-04-13 18:06:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:39,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072826052] [2025-04-13 18:06:39,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:39,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:39,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:39,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:39,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:39,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:39,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072826052] [2025-04-13 18:06:39,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072826052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:39,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:06:39,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697417229] [2025-04-13 18:06:39,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:39,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:39,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:39,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:06:39,951 INFO L87 Difference]: Start difference. First operand 1554 states and 4413 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 18:06:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:40,396 INFO L93 Difference]: Finished difference Result 2075 states and 5948 transitions. [2025-04-13 18:06:40,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:06:40,396 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 18:06:40,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:40,405 INFO L225 Difference]: With dead ends: 2075 [2025-04-13 18:06:40,405 INFO L226 Difference]: Without dead ends: 2007 [2025-04-13 18:06:40,405 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:06:40,405 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 222 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:40,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 740 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-04-13 18:06:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1542. [2025-04-13 18:06:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 2.8429591174561972) internal successors, (4381), 1541 states have internal predecessors, (4381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 4381 transitions. [2025-04-13 18:06:40,425 INFO L79 Accepts]: Start accepts. Automaton has 1542 states and 4381 transitions. Word has length 56 [2025-04-13 18:06:40,425 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:40,425 INFO L485 AbstractCegarLoop]: Abstraction has 1542 states and 4381 transitions. [2025-04-13 18:06:40,425 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 18:06:40,425 INFO L278 IsEmpty]: Start isEmpty. Operand 1542 states and 4381 transitions. [2025-04-13 18:06:40,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:40,426 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:40,427 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:40,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-13 18:06:40,427 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 18:06:40,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1223922485, now seen corresponding path program 159 times [2025-04-13 18:06:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:40,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687540748] [2025-04-13 18:06:40,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:40,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:40,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:40,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:40,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:40,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 18:06:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:40,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687540748] [2025-04-13 18:06:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687540748] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619275998] [2025-04-13 18:06:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:40,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:40,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:40,531 INFO L87 Difference]: Start difference. First operand 1542 states and 4381 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 18:06:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:40,892 INFO L93 Difference]: Finished difference Result 2179 states and 6239 transitions. [2025-04-13 18:06:40,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:06:40,892 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 18:06:40,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:40,901 INFO L225 Difference]: With dead ends: 2179 [2025-04-13 18:06:40,901 INFO L226 Difference]: Without dead ends: 2015 [2025-04-13 18:06:40,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=962, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:06:40,902 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 318 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:40,902 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 499 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-04-13 18:06:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1672. [2025-04-13 18:06:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 2.8378216636744464) internal successors, (4742), 1671 states have internal predecessors, (4742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 4742 transitions. [2025-04-13 18:06:40,922 INFO L79 Accepts]: Start accepts. Automaton has 1672 states and 4742 transitions. Word has length 56 [2025-04-13 18:06:40,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:40,922 INFO L485 AbstractCegarLoop]: Abstraction has 1672 states and 4742 transitions. [2025-04-13 18:06:40,922 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 18:06:40,922 INFO L278 IsEmpty]: Start isEmpty. Operand 1672 states and 4742 transitions. [2025-04-13 18:06:40,924 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:40,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:40,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 18:06:40,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2025-04-13 18:06:40,924 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 18:06:40,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash 209764277, now seen corresponding path program 160 times [2025-04-13 18:06:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:40,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964472232] [2025-04-13 18:06:40,924 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:40,928 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:40,931 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 18:06:40,931 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:40,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:41,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 18:06:41,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:41,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964472232] [2025-04-13 18:06:41,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964472232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:41,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:41,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:41,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260802776] [2025-04-13 18:06:41,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:41,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:41,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:41,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:41,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:41,006 INFO L87 Difference]: Start difference. First operand 1672 states and 4742 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 18:06:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:41,327 INFO L93 Difference]: Finished difference Result 1935 states and 5499 transitions. [2025-04-13 18:06:41,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:06:41,327 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 18:06:41,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:41,335 INFO L225 Difference]: With dead ends: 1935 [2025-04-13 18:06:41,335 INFO L226 Difference]: Without dead ends: 1876 [2025-04-13 18:06:41,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:06:41,336 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:41,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 469 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:41,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-04-13 18:06:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1724. [2025-04-13 18:06:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 2.8438769587928032) internal successors, (4900), 1723 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 4900 transitions. [2025-04-13 18:06:41,356 INFO L79 Accepts]: Start accepts. Automaton has 1724 states and 4900 transitions. Word has length 56 [2025-04-13 18:06:41,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:41,356 INFO L485 AbstractCegarLoop]: Abstraction has 1724 states and 4900 transitions. [2025-04-13 18:06:41,356 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 18:06:41,356 INFO L278 IsEmpty]: Start isEmpty. Operand 1724 states and 4900 transitions. [2025-04-13 18:06:41,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:41,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:41,358 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:41,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-13 18:06:41,358 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 18:06:41,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2111662293, now seen corresponding path program 161 times [2025-04-13 18:06:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:41,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165613726] [2025-04-13 18:06:41,359 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:41,363 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:41,370 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:41,370 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:41,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:41,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165613726] [2025-04-13 18:06:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165613726] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:41,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404719402] [2025-04-13 18:06:41,982 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:41,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:41,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:41,984 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 18:06:41,985 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 18:06:42,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:42,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:42,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:42,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:42,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:42,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:42,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:42,255 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 18:06:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:42,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:06:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404719402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:06:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:06:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192192410] [2025-04-13 18:06:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:42,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:42,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:42,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:42,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:06:42,262 INFO L87 Difference]: Start difference. First operand 1724 states and 4900 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 18:06:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:43,063 INFO L93 Difference]: Finished difference Result 2186 states and 6206 transitions. [2025-04-13 18:06:43,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:06:43,063 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 18:06:43,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:43,071 INFO L225 Difference]: With dead ends: 2186 [2025-04-13 18:06:43,071 INFO L226 Difference]: Without dead ends: 2122 [2025-04-13 18:06:43,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:06:43,072 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 295 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:43,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 477 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2025-04-13 18:06:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1729. [2025-04-13 18:06:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 2.841435185185185) internal successors, (4910), 1728 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 4910 transitions. [2025-04-13 18:06:43,093 INFO L79 Accepts]: Start accepts. Automaton has 1729 states and 4910 transitions. Word has length 56 [2025-04-13 18:06:43,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:43,093 INFO L485 AbstractCegarLoop]: Abstraction has 1729 states and 4910 transitions. [2025-04-13 18:06:43,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 18:06:43,093 INFO L278 IsEmpty]: Start isEmpty. Operand 1729 states and 4910 transitions. [2025-04-13 18:06:43,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:43,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:43,095 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:43,102 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 18:06:43,295 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 18:06:43,295 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 18:06:43,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash -283024397, now seen corresponding path program 162 times [2025-04-13 18:06:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:43,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254646641] [2025-04-13 18:06:43,296 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:43,300 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:43,304 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:43,304 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:43,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:43,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254646641] [2025-04-13 18:06:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254646641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310146868] [2025-04-13 18:06:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:43,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:43,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:43,398 INFO L87 Difference]: Start difference. First operand 1729 states and 4910 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 18:06:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:43,726 INFO L93 Difference]: Finished difference Result 1929 states and 5474 transitions. [2025-04-13 18:06:43,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:43,726 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 18:06:43,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:43,735 INFO L225 Difference]: With dead ends: 1929 [2025-04-13 18:06:43,735 INFO L226 Difference]: Without dead ends: 1877 [2025-04-13 18:06:43,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:06:43,735 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 169 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:43,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 471 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-04-13 18:06:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1725. [2025-04-13 18:06:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 2.8410672853828305) internal successors, (4898), 1724 states have internal predecessors, (4898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 4898 transitions. [2025-04-13 18:06:43,755 INFO L79 Accepts]: Start accepts. Automaton has 1725 states and 4898 transitions. Word has length 56 [2025-04-13 18:06:43,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:43,755 INFO L485 AbstractCegarLoop]: Abstraction has 1725 states and 4898 transitions. [2025-04-13 18:06:43,755 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 18:06:43,755 INFO L278 IsEmpty]: Start isEmpty. Operand 1725 states and 4898 transitions. [2025-04-13 18:06:43,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:43,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:43,757 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:43,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2025-04-13 18:06:43,757 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 18:06:43,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1550330099, now seen corresponding path program 163 times [2025-04-13 18:06:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:43,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006626621] [2025-04-13 18:06:43,758 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:43,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:43,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:43,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:43,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:43,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:44,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006626621] [2025-04-13 18:06:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006626621] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:44,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254942349] [2025-04-13 18:06:44,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:44,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:44,324 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 18:06:44,324 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 18:06:44,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:44,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:44,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:44,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:44,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:44,602 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:44,603 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 18:06:44,609 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 18:06:44,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:44,755 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:44,755 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 18:06:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254942349] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:06:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173097195] [2025-04-13 18:06:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:44,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:44,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:44,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:44,781 INFO L87 Difference]: Start difference. First operand 1725 states and 4898 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 18:06:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:45,348 INFO L93 Difference]: Finished difference Result 2134 states and 6091 transitions. [2025-04-13 18:06:45,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:06:45,349 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 18:06:45,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:45,357 INFO L225 Difference]: With dead ends: 2134 [2025-04-13 18:06:45,357 INFO L226 Difference]: Without dead ends: 2069 [2025-04-13 18:06:45,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=2244, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:06:45,358 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 262 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:45,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 471 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2025-04-13 18:06:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1730. [2025-04-13 18:06:45,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 2.8386350491613648) internal successors, (4908), 1729 states have internal predecessors, (4908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 4908 transitions. [2025-04-13 18:06:45,382 INFO L79 Accepts]: Start accepts. Automaton has 1730 states and 4908 transitions. Word has length 56 [2025-04-13 18:06:45,382 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:45,382 INFO L485 AbstractCegarLoop]: Abstraction has 1730 states and 4908 transitions. [2025-04-13 18:06:45,382 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 18:06:45,382 INFO L278 IsEmpty]: Start isEmpty. Operand 1730 states and 4908 transitions. [2025-04-13 18:06:45,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:45,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:45,384 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:45,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:45,584 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 18:06:45,584 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 18:06:45,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -626572551, now seen corresponding path program 164 times [2025-04-13 18:06:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:45,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302908276] [2025-04-13 18:06:45,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:45,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:45,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:45,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:45,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:45,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:45,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302908276] [2025-04-13 18:06:45,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302908276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:45,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:45,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987986045] [2025-04-13 18:06:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:45,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:45,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:45,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:45,688 INFO L87 Difference]: Start difference. First operand 1730 states and 4908 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 18:06:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:46,018 INFO L93 Difference]: Finished difference Result 1938 states and 5492 transitions. [2025-04-13 18:06:46,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:46,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 18:06:46,018 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:46,027 INFO L225 Difference]: With dead ends: 1938 [2025-04-13 18:06:46,027 INFO L226 Difference]: Without dead ends: 1878 [2025-04-13 18:06:46,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:06:46,027 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 178 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:46,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 473 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2025-04-13 18:06:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1726. [2025-04-13 18:06:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 2.838260869565217) internal successors, (4896), 1725 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4896 transitions. [2025-04-13 18:06:46,047 INFO L79 Accepts]: Start accepts. Automaton has 1726 states and 4896 transitions. Word has length 56 [2025-04-13 18:06:46,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:46,047 INFO L485 AbstractCegarLoop]: Abstraction has 1726 states and 4896 transitions. [2025-04-13 18:06:46,047 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 18:06:46,047 INFO L278 IsEmpty]: Start isEmpty. Operand 1726 states and 4896 transitions. [2025-04-13 18:06:46,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:46,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:46,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 18:06:46,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-13 18:06:46,049 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 18:06:46,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 431666505, now seen corresponding path program 165 times [2025-04-13 18:06:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:46,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882828126] [2025-04-13 18:06:46,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:46,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:46,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:46,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:46,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:46,157 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882828126] [2025-04-13 18:06:46,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882828126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:46,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:46,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:46,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668282680] [2025-04-13 18:06:46,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:46,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:46,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:46,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:46,158 INFO L87 Difference]: Start difference. First operand 1726 states and 4896 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 18:06:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:46,476 INFO L93 Difference]: Finished difference Result 2093 states and 5970 transitions. [2025-04-13 18:06:46,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:46,476 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 18:06:46,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:46,484 INFO L225 Difference]: With dead ends: 2093 [2025-04-13 18:06:46,485 INFO L226 Difference]: Without dead ends: 1979 [2025-04-13 18:06:46,485 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:06:46,485 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 209 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:46,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 437 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2025-04-13 18:06:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1666. [2025-04-13 18:06:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 2.834834834834835) internal successors, (4720), 1665 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 18:06:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 4720 transitions. [2025-04-13 18:06:46,505 INFO L79 Accepts]: Start accepts. Automaton has 1666 states and 4720 transitions. Word has length 56 [2025-04-13 18:06:46,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:46,505 INFO L485 AbstractCegarLoop]: Abstraction has 1666 states and 4720 transitions. [2025-04-13 18:06:46,505 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 18:06:46,505 INFO L278 IsEmpty]: Start isEmpty. Operand 1666 states and 4720 transitions. [2025-04-13 18:06:46,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:46,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:46,507 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:46,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2025-04-13 18:06:46,507 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 18:06:46,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash -760596655, now seen corresponding path program 166 times [2025-04-13 18:06:46,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:46,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651156237] [2025-04-13 18:06:46,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:46,512 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:46,514 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 18:06:46,514 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:46,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:46,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 18:06:46,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:46,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651156237] [2025-04-13 18:06:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651156237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315916460] [2025-04-13 18:06:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:46,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:46,591 INFO L87 Difference]: Start difference. First operand 1666 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 18:06:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:46,914 INFO L93 Difference]: Finished difference Result 1959 states and 5525 transitions. [2025-04-13 18:06:46,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:06:46,914 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 18:06:46,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:46,922 INFO L225 Difference]: With dead ends: 1959 [2025-04-13 18:06:46,922 INFO L226 Difference]: Without dead ends: 1683 [2025-04-13 18:06:46,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:06:46,923 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 197 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 586 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 18:06:46,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 586 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:46,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-04-13 18:06:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1632. [2025-04-13 18:06:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1631 states have (on average 2.8038013488657265) internal successors, (4573), 1631 states have internal predecessors, (4573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 4573 transitions. [2025-04-13 18:06:46,942 INFO L79 Accepts]: Start accepts. Automaton has 1632 states and 4573 transitions. Word has length 56 [2025-04-13 18:06:46,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:46,942 INFO L485 AbstractCegarLoop]: Abstraction has 1632 states and 4573 transitions. [2025-04-13 18:06:46,942 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 18:06:46,942 INFO L278 IsEmpty]: Start isEmpty. Operand 1632 states and 4573 transitions. [2025-04-13 18:06:46,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:46,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:46,943 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:46,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-13 18:06:46,944 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 18:06:46,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash 610778677, now seen corresponding path program 167 times [2025-04-13 18:06:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:46,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137621195] [2025-04-13 18:06:46,944 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:46,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:46,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:46,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:46,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:47,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 18:06:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:47,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137621195] [2025-04-13 18:06:47,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137621195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:47,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142913012] [2025-04-13 18:06:47,580 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:47,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:47,582 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 18:06:47,582 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 18:06:47,667 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:47,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:47,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:47,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:47,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:47,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:47,866 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:47,867 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 18:06:47,872 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 18:06:47,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:48,067 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:48,067 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 18:06:48,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 18:06:48,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142913012] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:48,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:48,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:06:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037146177] [2025-04-13 18:06:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:48,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:48,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:48,095 INFO L87 Difference]: Start difference. First operand 1632 states and 4573 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 18:06:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:48,965 INFO L93 Difference]: Finished difference Result 2116 states and 5933 transitions. [2025-04-13 18:06:48,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:06:48,965 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 18:06:48,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:48,974 INFO L225 Difference]: With dead ends: 2116 [2025-04-13 18:06:48,974 INFO L226 Difference]: Without dead ends: 2052 [2025-04-13 18:06:48,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=3054, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:06:48,974 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 284 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:48,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 503 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2025-04-13 18:06:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1642. [2025-04-13 18:06:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1641 states have (on average 2.801950030469226) internal successors, (4598), 1641 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 4598 transitions. [2025-04-13 18:06:48,994 INFO L79 Accepts]: Start accepts. Automaton has 1642 states and 4598 transitions. Word has length 56 [2025-04-13 18:06:48,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:48,994 INFO L485 AbstractCegarLoop]: Abstraction has 1642 states and 4598 transitions. [2025-04-13 18:06:48,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 18:06:48,994 INFO L278 IsEmpty]: Start isEmpty. Operand 1642 states and 4598 transitions. [2025-04-13 18:06:48,995 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:48,995 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:48,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 18:06:49,002 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 18:06:49,196 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 18:06:49,196 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 18:06:49,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2066121815, now seen corresponding path program 168 times [2025-04-13 18:06:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:49,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678885132] [2025-04-13 18:06:49,196 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:49,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:49,201 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:49,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:49,205 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:49,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:49,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 18:06:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:49,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678885132] [2025-04-13 18:06:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678885132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248843786] [2025-04-13 18:06:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:49,296 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:49,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:49,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:49,297 INFO L87 Difference]: Start difference. First operand 1642 states and 4598 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 18:06:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:49,647 INFO L93 Difference]: Finished difference Result 1820 states and 5082 transitions. [2025-04-13 18:06:49,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:49,647 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 18:06:49,647 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:49,655 INFO L225 Difference]: With dead ends: 1820 [2025-04-13 18:06:49,655 INFO L226 Difference]: Without dead ends: 1742 [2025-04-13 18:06:49,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:49,655 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 218 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:49,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 556 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-04-13 18:06:49,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1642. [2025-04-13 18:06:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1641 states have (on average 2.801950030469226) internal successors, (4598), 1641 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 4598 transitions. [2025-04-13 18:06:49,674 INFO L79 Accepts]: Start accepts. Automaton has 1642 states and 4598 transitions. Word has length 56 [2025-04-13 18:06:49,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:49,674 INFO L485 AbstractCegarLoop]: Abstraction has 1642 states and 4598 transitions. [2025-04-13 18:06:49,674 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 18:06:49,674 INFO L278 IsEmpty]: Start isEmpty. Operand 1642 states and 4598 transitions. [2025-04-13 18:06:49,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:49,676 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:49,676 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:49,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 18:06:49,676 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 18:06:49,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1172110871, now seen corresponding path program 169 times [2025-04-13 18:06:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:49,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150013683] [2025-04-13 18:06:49,676 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:49,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:49,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:49,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:50,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:50,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150013683] [2025-04-13 18:06:50,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150013683] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:50,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296717609] [2025-04-13 18:06:50,505 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:50,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:50,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:50,507 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 18:06:50,511 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 18:06:50,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:50,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:50,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:50,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:50,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:50,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:50,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:50,839 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 18:06:50,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 18:06:50,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:51,058 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:51,058 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 18:06:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296717609] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:51,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:51,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:06:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648900841] [2025-04-13 18:06:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:51,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:51,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:51,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:51,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:51,091 INFO L87 Difference]: Start difference. First operand 1642 states and 4598 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 18:06:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:51,968 INFO L93 Difference]: Finished difference Result 2120 states and 5974 transitions. [2025-04-13 18:06:51,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:06:51,968 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 18:06:51,968 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:51,977 INFO L225 Difference]: With dead ends: 2120 [2025-04-13 18:06:51,977 INFO L226 Difference]: Without dead ends: 2055 [2025-04-13 18:06:51,978 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=3150, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:06:51,978 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 300 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:51,978 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 498 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:06:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2025-04-13 18:06:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 1647. [2025-04-13 18:06:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1646 states have (on average 2.79951397326853) internal successors, (4608), 1646 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 4608 transitions. [2025-04-13 18:06:52,000 INFO L79 Accepts]: Start accepts. Automaton has 1647 states and 4608 transitions. Word has length 56 [2025-04-13 18:06:52,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:52,000 INFO L485 AbstractCegarLoop]: Abstraction has 1647 states and 4608 transitions. [2025-04-13 18:06:52,000 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 18:06:52,000 INFO L278 IsEmpty]: Start isEmpty. Operand 1647 states and 4608 transitions. [2025-04-13 18:06:52,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:52,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:52,002 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:52,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2025-04-13 18:06:52,202 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 18:06:52,203 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 18:06:52,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 628482073, now seen corresponding path program 170 times [2025-04-13 18:06:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:52,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159658727] [2025-04-13 18:06:52,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:52,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:52,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:52,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:52,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:52,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 18:06:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:52,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159658727] [2025-04-13 18:06:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159658727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:52,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131295877] [2025-04-13 18:06:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:52,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:52,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:52,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:52,315 INFO L87 Difference]: Start difference. First operand 1647 states and 4608 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 18:06:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:52,741 INFO L93 Difference]: Finished difference Result 1833 states and 5112 transitions. [2025-04-13 18:06:52,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:52,741 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 18:06:52,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:52,752 INFO L225 Difference]: With dead ends: 1833 [2025-04-13 18:06:52,752 INFO L226 Difference]: Without dead ends: 1774 [2025-04-13 18:06:52,752 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=781, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:06:52,753 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 188 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:52,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 535 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-04-13 18:06:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1659. [2025-04-13 18:06:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1658 states have (on average 2.796139927623643) internal successors, (4636), 1658 states have internal predecessors, (4636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4636 transitions. [2025-04-13 18:06:52,774 INFO L79 Accepts]: Start accepts. Automaton has 1659 states and 4636 transitions. Word has length 56 [2025-04-13 18:06:52,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:52,774 INFO L485 AbstractCegarLoop]: Abstraction has 1659 states and 4636 transitions. [2025-04-13 18:06:52,774 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 18:06:52,775 INFO L278 IsEmpty]: Start isEmpty. Operand 1659 states and 4636 transitions. [2025-04-13 18:06:52,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:52,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:52,776 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:52,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-13 18:06:52,776 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 18:06:52,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:52,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1140859821, now seen corresponding path program 171 times [2025-04-13 18:06:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:52,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226642471] [2025-04-13 18:06:52,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:52,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:52,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:52,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:52,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:52,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226642471] [2025-04-13 18:06:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226642471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:52,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800584539] [2025-04-13 18:06:52,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:52,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:52,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:52,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:52,888 INFO L87 Difference]: Start difference. First operand 1659 states and 4636 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 18:06:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:53,336 INFO L93 Difference]: Finished difference Result 2095 states and 5893 transitions. [2025-04-13 18:06:53,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:06:53,336 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 18:06:53,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:53,345 INFO L225 Difference]: With dead ends: 2095 [2025-04-13 18:06:53,345 INFO L226 Difference]: Without dead ends: 2031 [2025-04-13 18:06:53,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:53,345 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 233 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:53,347 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 479 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2025-04-13 18:06:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1649. [2025-04-13 18:06:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 2.7979368932038833) internal successors, (4611), 1648 states have internal predecessors, (4611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 4611 transitions. [2025-04-13 18:06:53,369 INFO L79 Accepts]: Start accepts. Automaton has 1649 states and 4611 transitions. Word has length 56 [2025-04-13 18:06:53,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:53,369 INFO L485 AbstractCegarLoop]: Abstraction has 1649 states and 4611 transitions. [2025-04-13 18:06:53,369 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 18:06:53,370 INFO L278 IsEmpty]: Start isEmpty. Operand 1649 states and 4611 transitions. [2025-04-13 18:06:53,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:53,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:53,371 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:53,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2025-04-13 18:06:53,371 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 18:06:53,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 135693399, now seen corresponding path program 172 times [2025-04-13 18:06:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:53,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598159014] [2025-04-13 18:06:53,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:06:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:53,376 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:53,379 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 18:06:53,379 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:06:53,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:53,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598159014] [2025-04-13 18:06:53,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598159014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:53,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:53,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:53,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872784827] [2025-04-13 18:06:53,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:53,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:53,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:53,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:53,476 INFO L87 Difference]: Start difference. First operand 1649 states and 4611 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 18:06:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:53,901 INFO L93 Difference]: Finished difference Result 1929 states and 5427 transitions. [2025-04-13 18:06:53,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:53,901 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 18:06:53,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:53,910 INFO L225 Difference]: With dead ends: 1929 [2025-04-13 18:06:53,910 INFO L226 Difference]: Without dead ends: 1873 [2025-04-13 18:06:53,910 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:53,910 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 180 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:53,910 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 602 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-04-13 18:06:53,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1641. [2025-04-13 18:06:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1640 states have (on average 2.799390243902439) internal successors, (4591), 1640 states have internal predecessors, (4591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 4591 transitions. [2025-04-13 18:06:53,935 INFO L79 Accepts]: Start accepts. Automaton has 1641 states and 4591 transitions. Word has length 56 [2025-04-13 18:06:53,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:53,935 INFO L485 AbstractCegarLoop]: Abstraction has 1641 states and 4591 transitions. [2025-04-13 18:06:53,935 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 18:06:53,935 INFO L278 IsEmpty]: Start isEmpty. Operand 1641 states and 4591 transitions. [2025-04-13 18:06:53,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:53,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:53,937 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:53,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2025-04-13 18:06:53,938 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 18:06:53,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:53,938 INFO L85 PathProgramCache]: Analyzing trace with hash 872933889, now seen corresponding path program 173 times [2025-04-13 18:06:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:53,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623516189] [2025-04-13 18:06:53,938 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:53,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:53,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:53,956 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:53,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:55,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623516189] [2025-04-13 18:06:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623516189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:55,081 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837894090] [2025-04-13 18:06:55,081 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:06:55,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:55,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:55,082 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 18:06:55,084 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 18:06:55,175 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:55,196 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:55,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:06:55,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:55,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:06:55,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:55,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:55,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 18:06:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:55,483 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:06:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837894090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:06:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:06:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22895570] [2025-04-13 18:06:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:55,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:06:55,484 INFO L87 Difference]: Start difference. First operand 1641 states and 4591 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 18:06:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:56,410 INFO L93 Difference]: Finished difference Result 2036 states and 5736 transitions. [2025-04-13 18:06:56,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:06:56,410 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 18:06:56,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:56,419 INFO L225 Difference]: With dead ends: 2036 [2025-04-13 18:06:56,419 INFO L226 Difference]: Without dead ends: 1950 [2025-04-13 18:06:56,420 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=1879, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:06:56,420 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 285 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:56,420 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 441 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:06:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-04-13 18:06:56,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1646. [2025-04-13 18:06:56,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1645 states have (on average 2.7969604863221886) internal successors, (4601), 1645 states have internal predecessors, (4601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 4601 transitions. [2025-04-13 18:06:56,450 INFO L79 Accepts]: Start accepts. Automaton has 1646 states and 4601 transitions. Word has length 56 [2025-04-13 18:06:56,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:56,450 INFO L485 AbstractCegarLoop]: Abstraction has 1646 states and 4601 transitions. [2025-04-13 18:06:56,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 18:06:56,451 INFO L278 IsEmpty]: Start isEmpty. Operand 1646 states and 4601 transitions. [2025-04-13 18:06:56,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:56,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:56,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 18:06:56,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 18:06:56,653 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 18:06:56,653 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 18:06:56,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 937357109, now seen corresponding path program 174 times [2025-04-13 18:06:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:56,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722654232] [2025-04-13 18:06:56,653 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:06:56,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:56,658 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:56,662 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:56,662 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:06:56,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:56,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722654232] [2025-04-13 18:06:56,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722654232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:56,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:56,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774892335] [2025-04-13 18:06:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:56,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:56,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:56,754 INFO L87 Difference]: Start difference. First operand 1646 states and 4601 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 18:06:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:57,086 INFO L93 Difference]: Finished difference Result 1832 states and 5109 transitions. [2025-04-13 18:06:57,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:06:57,086 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 18:06:57,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:57,094 INFO L225 Difference]: With dead ends: 1832 [2025-04-13 18:06:57,095 INFO L226 Difference]: Without dead ends: 1773 [2025-04-13 18:06:57,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:06:57,095 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 189 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:57,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 507 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:06:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-04-13 18:06:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1654. [2025-04-13 18:06:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 2.795523290986086) internal successors, (4621), 1653 states have internal predecessors, (4621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 4621 transitions. [2025-04-13 18:06:57,116 INFO L79 Accepts]: Start accepts. Automaton has 1654 states and 4621 transitions. Word has length 56 [2025-04-13 18:06:57,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:57,117 INFO L485 AbstractCegarLoop]: Abstraction has 1654 states and 4621 transitions. [2025-04-13 18:06:57,117 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 18:06:57,117 INFO L278 IsEmpty]: Start isEmpty. Operand 1654 states and 4621 transitions. [2025-04-13 18:06:57,118 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:57,119 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:57,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2025-04-13 18:06:57,119 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 18:06:57,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 574774213, now seen corresponding path program 175 times [2025-04-13 18:06:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:57,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747537062] [2025-04-13 18:06:57,119 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:57,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:57,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:57,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:06:57,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:57,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747537062] [2025-04-13 18:06:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747537062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:57,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582338477] [2025-04-13 18:06:57,885 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:06:57,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:06:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:06:57,887 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 18:06:57,887 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 18:06:57,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:06:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:06:57,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:06:57,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:57,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:06:57,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:06:58,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:06:58,156 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 18:06:58,176 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 18:06:58,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:06:58,348 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:06:58,348 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 18:06:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582338477] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:06:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:06:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:06:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016503305] [2025-04-13 18:06:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:58,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:06:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:58,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:06:58,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:06:58,376 INFO L87 Difference]: Start difference. First operand 1654 states and 4621 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 18:06:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:59,129 INFO L93 Difference]: Finished difference Result 2054 states and 5781 transitions. [2025-04-13 18:06:59,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:06:59,129 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 18:06:59,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:59,138 INFO L225 Difference]: With dead ends: 2054 [2025-04-13 18:06:59,138 INFO L226 Difference]: Without dead ends: 1989 [2025-04-13 18:06:59,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=3044, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:06:59,139 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 282 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:59,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 510 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2025-04-13 18:06:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1659. [2025-04-13 18:06:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1658 states have (on average 2.793124246079614) internal successors, (4631), 1658 states have internal predecessors, (4631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 4631 transitions. [2025-04-13 18:06:59,161 INFO L79 Accepts]: Start accepts. Automaton has 1659 states and 4631 transitions. Word has length 56 [2025-04-13 18:06:59,161 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:59,161 INFO L485 AbstractCegarLoop]: Abstraction has 1659 states and 4631 transitions. [2025-04-13 18:06:59,161 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 18:06:59,161 INFO L278 IsEmpty]: Start isEmpty. Operand 1659 states and 4631 transitions. [2025-04-13 18:06:59,162 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:59,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:59,163 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:59,170 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 18:06:59,363 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 18:06:59,363 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 18:06:59,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:59,363 INFO L85 PathProgramCache]: Analyzing trace with hash 444568435, now seen corresponding path program 176 times [2025-04-13 18:06:59,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:59,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498532966] [2025-04-13 18:06:59,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:06:59,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:59,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:59,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:59,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:06:59,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:59,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:59,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:59,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498532966] [2025-04-13 18:06:59,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498532966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:59,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:59,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896145613] [2025-04-13 18:06:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:59,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:59,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:59,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:59,474 INFO L87 Difference]: Start difference. First operand 1659 states and 4631 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 18:06:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:06:59,858 INFO L93 Difference]: Finished difference Result 1826 states and 5084 transitions. [2025-04-13 18:06:59,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:06:59,859 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 18:06:59,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:06:59,867 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 18:06:59,867 INFO L226 Difference]: Without dead ends: 1774 [2025-04-13 18:06:59,868 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:06:59,868 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 161 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:06:59,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 505 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:06:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-04-13 18:06:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1655. [2025-04-13 18:06:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 2.7926239419588876) internal successors, (4619), 1654 states have internal predecessors, (4619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:06:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4619 transitions. [2025-04-13 18:06:59,888 INFO L79 Accepts]: Start accepts. Automaton has 1655 states and 4619 transitions. Word has length 56 [2025-04-13 18:06:59,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:06:59,888 INFO L485 AbstractCegarLoop]: Abstraction has 1655 states and 4619 transitions. [2025-04-13 18:06:59,888 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 18:06:59,888 INFO L278 IsEmpty]: Start isEmpty. Operand 1655 states and 4619 transitions. [2025-04-13 18:06:59,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:06:59,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:06:59,890 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:06:59,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2025-04-13 18:06:59,890 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 18:06:59,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:06:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1738196479, now seen corresponding path program 177 times [2025-04-13 18:06:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:06:59,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081136450] [2025-04-13 18:06:59,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:06:59,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:06:59,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:06:59,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:06:59,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:06:59,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:06:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:06:59,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:06:59,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081136450] [2025-04-13 18:06:59,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081136450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:06:59,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:06:59,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:06:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106646014] [2025-04-13 18:06:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:06:59,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:06:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:06:59,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:06:59,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:06:59,997 INFO L87 Difference]: Start difference. First operand 1655 states and 4619 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 18:07:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:00,383 INFO L93 Difference]: Finished difference Result 2013 states and 5660 transitions. [2025-04-13 18:07:00,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:07:00,383 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 18:07:00,384 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:00,392 INFO L225 Difference]: With dead ends: 2013 [2025-04-13 18:07:00,392 INFO L226 Difference]: Without dead ends: 1894 [2025-04-13 18:07:00,393 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 18:07:00,393 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 228 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:00,393 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 478 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2025-04-13 18:07:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1590. [2025-04-13 18:07:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 2.814977973568282) internal successors, (4473), 1589 states have internal predecessors, (4473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 4473 transitions. [2025-04-13 18:07:00,413 INFO L79 Accepts]: Start accepts. Automaton has 1590 states and 4473 transitions. Word has length 56 [2025-04-13 18:07:00,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:00,413 INFO L485 AbstractCegarLoop]: Abstraction has 1590 states and 4473 transitions. [2025-04-13 18:07:00,413 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 18:07:00,413 INFO L278 IsEmpty]: Start isEmpty. Operand 1590 states and 4473 transitions. [2025-04-13 18:07:00,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:00,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:00,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 18:07:00,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2025-04-13 18:07:00,415 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 18:07:00,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 101020281, now seen corresponding path program 178 times [2025-04-13 18:07:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:00,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908529215] [2025-04-13 18:07:00,415 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:00,420 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:00,422 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 18:07:00,422 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:00,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:00,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908529215] [2025-04-13 18:07:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908529215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:00,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002304251] [2025-04-13 18:07:00,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:00,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:00,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:00,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:00,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:00,496 INFO L87 Difference]: Start difference. First operand 1590 states and 4473 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 18:07:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:00,867 INFO L93 Difference]: Finished difference Result 2040 states and 5795 transitions. [2025-04-13 18:07:00,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:00,867 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 18:07:00,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:00,877 INFO L225 Difference]: With dead ends: 2040 [2025-04-13 18:07:00,877 INFO L226 Difference]: Without dead ends: 1976 [2025-04-13 18:07:00,878 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:00,878 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 194 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 646 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 18:07:00,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 646 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:00,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1976 states. [2025-04-13 18:07:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1976 to 1582. [2025-04-13 18:07:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 2.816571790006325) internal successors, (4453), 1581 states have internal predecessors, (4453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 4453 transitions. [2025-04-13 18:07:00,900 INFO L79 Accepts]: Start accepts. Automaton has 1582 states and 4453 transitions. Word has length 56 [2025-04-13 18:07:00,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:00,900 INFO L485 AbstractCegarLoop]: Abstraction has 1582 states and 4453 transitions. [2025-04-13 18:07:00,900 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 18:07:00,900 INFO L278 IsEmpty]: Start isEmpty. Operand 1582 states and 4453 transitions. [2025-04-13 18:07:00,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:00,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:00,902 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:00,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2025-04-13 18:07:00,902 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 18:07:00,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash -890451987, now seen corresponding path program 179 times [2025-04-13 18:07:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:00,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86650113] [2025-04-13 18:07:00,902 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:00,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:00,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:00,914 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:00,914 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:00,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:01,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 18:07:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:01,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86650113] [2025-04-13 18:07:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86650113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:01,789 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549181238] [2025-04-13 18:07:01,789 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:01,791 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 18:07:01,791 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 18:07:01,875 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:01,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:01,894 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:01,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:01,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:02,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:02,096 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 18:07:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:02,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549181238] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:02,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:07:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939701011] [2025-04-13 18:07:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:02,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:02,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:02,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:07:02,102 INFO L87 Difference]: Start difference. First operand 1582 states and 4453 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 18:07:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:03,024 INFO L93 Difference]: Finished difference Result 2129 states and 6026 transitions. [2025-04-13 18:07:03,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:03,024 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 18:07:03,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:03,033 INFO L225 Difference]: With dead ends: 2129 [2025-04-13 18:07:03,033 INFO L226 Difference]: Without dead ends: 1965 [2025-04-13 18:07:03,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:07:03,034 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 258 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:03,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 519 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2025-04-13 18:07:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1642. [2025-04-13 18:07:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1641 states have (on average 2.798293723339427) internal successors, (4592), 1641 states have internal predecessors, (4592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 4592 transitions. [2025-04-13 18:07:03,056 INFO L79 Accepts]: Start accepts. Automaton has 1642 states and 4592 transitions. Word has length 56 [2025-04-13 18:07:03,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:03,056 INFO L485 AbstractCegarLoop]: Abstraction has 1642 states and 4592 transitions. [2025-04-13 18:07:03,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 18:07:03,056 INFO L278 IsEmpty]: Start isEmpty. Operand 1642 states and 4592 transitions. [2025-04-13 18:07:03,058 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:03,058 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:03,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 18:07:03,065 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 18:07:03,258 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 18:07:03,258 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 18:07:03,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:03,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1500062907, now seen corresponding path program 180 times [2025-04-13 18:07:03,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:03,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211667552] [2025-04-13 18:07:03,259 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:03,264 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:03,267 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:03,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:03,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:03,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211667552] [2025-04-13 18:07:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211667552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:03,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802767314] [2025-04-13 18:07:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:03,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:03,374 INFO L87 Difference]: Start difference. First operand 1642 states and 4592 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 18:07:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:03,744 INFO L93 Difference]: Finished difference Result 1798 states and 5022 transitions. [2025-04-13 18:07:03,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:07:03,744 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 18:07:03,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:03,753 INFO L225 Difference]: With dead ends: 1798 [2025-04-13 18:07:03,753 INFO L226 Difference]: Without dead ends: 1739 [2025-04-13 18:07:03,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:07:03,754 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 152 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:03,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 447 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:03,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-04-13 18:07:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1650. [2025-04-13 18:07:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1649 states have (on average 2.7968465736810186) internal successors, (4612), 1649 states have internal predecessors, (4612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 4612 transitions. [2025-04-13 18:07:03,777 INFO L79 Accepts]: Start accepts. Automaton has 1650 states and 4612 transitions. Word has length 56 [2025-04-13 18:07:03,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:03,778 INFO L485 AbstractCegarLoop]: Abstraction has 1650 states and 4612 transitions. [2025-04-13 18:07:03,778 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 18:07:03,778 INFO L278 IsEmpty]: Start isEmpty. Operand 1650 states and 4612 transitions. [2025-04-13 18:07:03,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:03,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:03,780 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:03,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2025-04-13 18:07:03,780 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 18:07:03,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:03,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1778191795, now seen corresponding path program 181 times [2025-04-13 18:07:03,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:03,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911597380] [2025-04-13 18:07:03,780 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:03,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:03,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:04,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:04,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911597380] [2025-04-13 18:07:04,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911597380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:04,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551110417] [2025-04-13 18:07:04,555 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:04,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:04,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:04,557 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 18:07:04,559 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 18:07:04,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:04,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:04,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:04,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:04,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:04,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:04,943 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:04,943 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 18:07:04,949 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 18:07:04,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:05,178 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:05,178 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 18:07:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:05,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551110417] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:05,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:05,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:07:05,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27720143] [2025-04-13 18:07:05,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:05,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:05,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:05,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:05,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:05,210 INFO L87 Difference]: Start difference. First operand 1650 states and 4612 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 18:07:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:05,958 INFO L93 Difference]: Finished difference Result 2113 states and 5918 transitions. [2025-04-13 18:07:05,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:07:05,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 18:07:05,959 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:05,970 INFO L225 Difference]: With dead ends: 2113 [2025-04-13 18:07:05,970 INFO L226 Difference]: Without dead ends: 2049 [2025-04-13 18:07:05,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=198, Invalid=2454, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:07:05,971 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 216 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:05,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 491 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:05,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-04-13 18:07:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1655. [2025-04-13 18:07:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 2.7944377267230953) internal successors, (4622), 1654 states have internal predecessors, (4622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 4622 transitions. [2025-04-13 18:07:06,003 INFO L79 Accepts]: Start accepts. Automaton has 1655 states and 4622 transitions. Word has length 56 [2025-04-13 18:07:06,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:06,003 INFO L485 AbstractCegarLoop]: Abstraction has 1655 states and 4622 transitions. [2025-04-13 18:07:06,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 18:07:06,003 INFO L278 IsEmpty]: Start isEmpty. Operand 1655 states and 4622 transitions. [2025-04-13 18:07:06,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:06,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:06,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 18:07:06,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 18:07:06,207 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 18:07:06,208 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 18:07:06,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1007274233, now seen corresponding path program 182 times [2025-04-13 18:07:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:06,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053654532] [2025-04-13 18:07:06,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:06,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:06,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:06,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:06,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 18:07:06,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:06,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053654532] [2025-04-13 18:07:06,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053654532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:06,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:06,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:06,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119884567] [2025-04-13 18:07:06,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:06,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:06,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:06,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:06,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:06,326 INFO L87 Difference]: Start difference. First operand 1655 states and 4622 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 18:07:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:06,694 INFO L93 Difference]: Finished difference Result 1792 states and 4997 transitions. [2025-04-13 18:07:06,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:06,695 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 18:07:06,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:06,704 INFO L225 Difference]: With dead ends: 1792 [2025-04-13 18:07:06,704 INFO L226 Difference]: Without dead ends: 1740 [2025-04-13 18:07:06,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:06,705 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 159 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:06,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 442 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:06,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2025-04-13 18:07:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1651. [2025-04-13 18:07:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1650 states have (on average 2.793939393939394) internal successors, (4610), 1650 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 4610 transitions. [2025-04-13 18:07:06,726 INFO L79 Accepts]: Start accepts. Automaton has 1651 states and 4610 transitions. Word has length 56 [2025-04-13 18:07:06,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:06,727 INFO L485 AbstractCegarLoop]: Abstraction has 1651 states and 4610 transitions. [2025-04-13 18:07:06,727 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 18:07:06,727 INFO L278 IsEmpty]: Start isEmpty. Operand 1651 states and 4610 transitions. [2025-04-13 18:07:06,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:06,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:06,728 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:06,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2025-04-13 18:07:06,729 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 18:07:06,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1216859601, now seen corresponding path program 183 times [2025-04-13 18:07:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:06,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674281341] [2025-04-13 18:07:06,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:06,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:06,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:06,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:06,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:06,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674281341] [2025-04-13 18:07:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674281341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:06,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794373476] [2025-04-13 18:07:06,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:06,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:06,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:06,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:06,885 INFO L87 Difference]: Start difference. First operand 1651 states and 4610 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 18:07:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:07,338 INFO L93 Difference]: Finished difference Result 2035 states and 5731 transitions. [2025-04-13 18:07:07,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:07:07,339 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 18:07:07,339 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:07,350 INFO L225 Difference]: With dead ends: 2035 [2025-04-13 18:07:07,350 INFO L226 Difference]: Without dead ends: 1970 [2025-04-13 18:07:07,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:07,352 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 219 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 486 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.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:07,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 486 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-04-13 18:07:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1656. [2025-04-13 18:07:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.7915407854984893) internal successors, (4620), 1655 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4620 transitions. [2025-04-13 18:07:07,379 INFO L79 Accepts]: Start accepts. Automaton has 1656 states and 4620 transitions. Word has length 56 [2025-04-13 18:07:07,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:07,379 INFO L485 AbstractCegarLoop]: Abstraction has 1656 states and 4620 transitions. [2025-04-13 18:07:07,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 18:07:07,379 INFO L278 IsEmpty]: Start isEmpty. Operand 1656 states and 4620 transitions. [2025-04-13 18:07:07,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:07,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:07,382 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:07,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2025-04-13 18:07:07,382 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 18:07:07,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:07,382 INFO L85 PathProgramCache]: Analyzing trace with hash 663726079, now seen corresponding path program 184 times [2025-04-13 18:07:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:07,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819207768] [2025-04-13 18:07:07,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:07,387 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:07,390 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 18:07:07,390 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:07,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:07,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819207768] [2025-04-13 18:07:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819207768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710291497] [2025-04-13 18:07:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:07,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:07,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:07,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:07,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:07,479 INFO L87 Difference]: Start difference. First operand 1656 states and 4620 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 18:07:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:07,844 INFO L93 Difference]: Finished difference Result 1774 states and 4940 transitions. [2025-04-13 18:07:07,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:07:07,845 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 18:07:07,845 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:07,856 INFO L225 Difference]: With dead ends: 1774 [2025-04-13 18:07:07,856 INFO L226 Difference]: Without dead ends: 1626 [2025-04-13 18:07:07,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:07:07,857 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 155 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:07,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 438 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2025-04-13 18:07:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1564. [2025-04-13 18:07:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1563 states have (on average 2.798464491362764) internal successors, (4374), 1563 states have internal predecessors, (4374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 4374 transitions. [2025-04-13 18:07:07,880 INFO L79 Accepts]: Start accepts. Automaton has 1564 states and 4374 transitions. Word has length 56 [2025-04-13 18:07:07,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:07,880 INFO L485 AbstractCegarLoop]: Abstraction has 1564 states and 4374 transitions. [2025-04-13 18:07:07,880 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 18:07:07,880 INFO L278 IsEmpty]: Start isEmpty. Operand 1564 states and 4374 transitions. [2025-04-13 18:07:07,882 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:07,882 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:07,882 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:07,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2025-04-13 18:07:07,882 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 18:07:07,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 765137003, now seen corresponding path program 185 times [2025-04-13 18:07:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:07,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047957730] [2025-04-13 18:07:07,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:07,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:07,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:07,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:07,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:08,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:08,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047957730] [2025-04-13 18:07:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047957730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:08,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383272136] [2025-04-13 18:07:08,595 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:08,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:08,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:08,597 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 18:07:08,598 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 18:07:08,698 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:08,719 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:08,719 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:08,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:08,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:08,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:08,916 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:08,916 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 18:07:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:08,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383272136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:08,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:08,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:07:08,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480868976] [2025-04-13 18:07:08,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:08,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:08,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:08,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:08,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:07:08,926 INFO L87 Difference]: Start difference. First operand 1564 states and 4374 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 18:07:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:09,797 INFO L93 Difference]: Finished difference Result 1932 states and 5448 transitions. [2025-04-13 18:07:09,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:07:09,798 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 18:07:09,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:09,807 INFO L225 Difference]: With dead ends: 1932 [2025-04-13 18:07:09,808 INFO L226 Difference]: Without dead ends: 1818 [2025-04-13 18:07:09,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1716, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:07:09,809 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 231 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:09,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 476 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2025-04-13 18:07:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1504. [2025-04-13 18:07:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 1503 states have (on average 2.8196939454424483) internal successors, (4238), 1503 states have internal predecessors, (4238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 4238 transitions. [2025-04-13 18:07:09,831 INFO L79 Accepts]: Start accepts. Automaton has 1504 states and 4238 transitions. Word has length 56 [2025-04-13 18:07:09,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:09,831 INFO L485 AbstractCegarLoop]: Abstraction has 1504 states and 4238 transitions. [2025-04-13 18:07:09,831 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 18:07:09,831 INFO L278 IsEmpty]: Start isEmpty. Operand 1504 states and 4238 transitions. [2025-04-13 18:07:09,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:09,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:09,833 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:09,840 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 18:07:10,033 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 18:07:10,034 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 18:07:10,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1794383213, now seen corresponding path program 186 times [2025-04-13 18:07:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:10,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192770884] [2025-04-13 18:07:10,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:10,039 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:10,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:10,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:10,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:10,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192770884] [2025-04-13 18:07:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192770884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:10,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451960061] [2025-04-13 18:07:10,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:10,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:10,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:10,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:10,169 INFO L87 Difference]: Start difference. First operand 1504 states and 4238 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 18:07:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:10,585 INFO L93 Difference]: Finished difference Result 1706 states and 4815 transitions. [2025-04-13 18:07:10,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:07:10,585 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 18:07:10,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:10,596 INFO L225 Difference]: With dead ends: 1706 [2025-04-13 18:07:10,596 INFO L226 Difference]: Without dead ends: 1647 [2025-04-13 18:07:10,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:07:10,597 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 153 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:10,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 495 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:10,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-04-13 18:07:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1566. [2025-04-13 18:07:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 2.830031948881789) internal successors, (4429), 1565 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 4429 transitions. [2025-04-13 18:07:10,621 INFO L79 Accepts]: Start accepts. Automaton has 1566 states and 4429 transitions. Word has length 56 [2025-04-13 18:07:10,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:10,622 INFO L485 AbstractCegarLoop]: Abstraction has 1566 states and 4429 transitions. [2025-04-13 18:07:10,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 18:07:10,622 INFO L278 IsEmpty]: Start isEmpty. Operand 1566 states and 4429 transitions. [2025-04-13 18:07:10,623 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:10,623 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:10,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 18:07:10,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2025-04-13 18:07:10,624 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 18:07:10,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 955479243, now seen corresponding path program 187 times [2025-04-13 18:07:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:10,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095010173] [2025-04-13 18:07:10,624 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:10,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:10,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:10,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:11,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:11,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095010173] [2025-04-13 18:07:11,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095010173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:11,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194171393] [2025-04-13 18:07:11,212 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:11,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:11,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:11,215 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 18:07:11,217 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 18:07:11,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:11,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:11,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:11,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:11,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:11,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:11,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:11,647 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 18:07:11,654 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 18:07:11,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:11,876 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:11,876 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 18:07:11,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 18:07:11,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194171393] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:11,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:11,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:07:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480236768] [2025-04-13 18:07:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:11,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:11,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:11,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:11,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:11,905 INFO L87 Difference]: Start difference. First operand 1566 states and 4429 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 18:07:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:12,532 INFO L93 Difference]: Finished difference Result 1983 states and 5593 transitions. [2025-04-13 18:07:12,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:07:12,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 18:07:12,532 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:12,542 INFO L225 Difference]: With dead ends: 1983 [2025-04-13 18:07:12,542 INFO L226 Difference]: Without dead ends: 1779 [2025-04-13 18:07:12,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=2093, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:07:12,543 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 197 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:12,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 509 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-04-13 18:07:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1546. [2025-04-13 18:07:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 2.83042071197411) internal successors, (4373), 1545 states have internal predecessors, (4373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 4373 transitions. [2025-04-13 18:07:12,575 INFO L79 Accepts]: Start accepts. Automaton has 1546 states and 4373 transitions. Word has length 56 [2025-04-13 18:07:12,575 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:12,575 INFO L485 AbstractCegarLoop]: Abstraction has 1546 states and 4373 transitions. [2025-04-13 18:07:12,575 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 18:07:12,575 INFO L278 IsEmpty]: Start isEmpty. Operand 1546 states and 4373 transitions. [2025-04-13 18:07:12,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:12,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:12,577 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:12,585 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 18:07:12,779 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 18:07:12,779 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 18:07:12,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:12,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2007795409, now seen corresponding path program 188 times [2025-04-13 18:07:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:12,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638401535] [2025-04-13 18:07:12,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:12,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:12,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:12,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:12,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:12,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638401535] [2025-04-13 18:07:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638401535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:12,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:12,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:12,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326212999] [2025-04-13 18:07:12,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:12,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:12,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:12,916 INFO L87 Difference]: Start difference. First operand 1546 states and 4373 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 18:07:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:13,327 INFO L93 Difference]: Finished difference Result 1675 states and 4724 transitions. [2025-04-13 18:07:13,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:13,327 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 18:07:13,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:13,337 INFO L225 Difference]: With dead ends: 1675 [2025-04-13 18:07:13,337 INFO L226 Difference]: Without dead ends: 1623 [2025-04-13 18:07:13,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:13,338 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 148 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:13,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 498 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-04-13 18:07:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1542. [2025-04-13 18:07:13,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 2.829980532121999) internal successors, (4361), 1541 states have internal predecessors, (4361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 4361 transitions. [2025-04-13 18:07:13,358 INFO L79 Accepts]: Start accepts. Automaton has 1542 states and 4361 transitions. Word has length 56 [2025-04-13 18:07:13,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:13,358 INFO L485 AbstractCegarLoop]: Abstraction has 1542 states and 4361 transitions. [2025-04-13 18:07:13,359 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 18:07:13,359 INFO L278 IsEmpty]: Start isEmpty. Operand 1542 states and 4361 transitions. [2025-04-13 18:07:13,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:13,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:13,360 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:13,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2025-04-13 18:07:13,361 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 18:07:13,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 406854379, now seen corresponding path program 189 times [2025-04-13 18:07:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:13,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016782877] [2025-04-13 18:07:13,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:13,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:13,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:13,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:13,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:13,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016782877] [2025-04-13 18:07:13,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016782877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:13,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:13,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:13,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648467784] [2025-04-13 18:07:13,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:13,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:13,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:13,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:13,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:13,484 INFO L87 Difference]: Start difference. First operand 1542 states and 4361 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 18:07:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:13,925 INFO L93 Difference]: Finished difference Result 2059 states and 5835 transitions. [2025-04-13 18:07:13,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:07:13,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 18:07:13,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:13,935 INFO L225 Difference]: With dead ends: 2059 [2025-04-13 18:07:13,935 INFO L226 Difference]: Without dead ends: 1895 [2025-04-13 18:07:13,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:13,936 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 313 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:13,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 510 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-04-13 18:07:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1692. [2025-04-13 18:07:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1691 states have (on average 2.826138379657008) internal successors, (4779), 1691 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 4779 transitions. [2025-04-13 18:07:13,961 INFO L79 Accepts]: Start accepts. Automaton has 1692 states and 4779 transitions. Word has length 56 [2025-04-13 18:07:13,961 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:13,962 INFO L485 AbstractCegarLoop]: Abstraction has 1692 states and 4779 transitions. [2025-04-13 18:07:13,962 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 18:07:13,962 INFO L278 IsEmpty]: Start isEmpty. Operand 1692 states and 4779 transitions. [2025-04-13 18:07:13,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:13,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:13,964 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:13,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2025-04-13 18:07:13,964 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 18:07:13,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1664247255, now seen corresponding path program 190 times [2025-04-13 18:07:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:13,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333356009] [2025-04-13 18:07:13,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:13,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:13,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:13,973 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 18:07:13,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:14,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333356009] [2025-04-13 18:07:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333356009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120055872] [2025-04-13 18:07:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:14,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:14,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:14,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:14,062 INFO L87 Difference]: Start difference. First operand 1692 states and 4779 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 18:07:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:14,502 INFO L93 Difference]: Finished difference Result 1829 states and 5150 transitions. [2025-04-13 18:07:14,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:14,502 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 18:07:14,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:14,512 INFO L225 Difference]: With dead ends: 1829 [2025-04-13 18:07:14,512 INFO L226 Difference]: Without dead ends: 1769 [2025-04-13 18:07:14,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:14,513 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:14,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 501 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-04-13 18:07:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1688. [2025-04-13 18:07:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1688 states, 1687 states have (on average 2.8257261410788383) internal successors, (4767), 1687 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 4767 transitions. [2025-04-13 18:07:14,536 INFO L79 Accepts]: Start accepts. Automaton has 1688 states and 4767 transitions. Word has length 56 [2025-04-13 18:07:14,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:14,536 INFO L485 AbstractCegarLoop]: Abstraction has 1688 states and 4767 transitions. [2025-04-13 18:07:14,536 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 18:07:14,536 INFO L278 IsEmpty]: Start isEmpty. Operand 1688 states and 4767 transitions. [2025-04-13 18:07:14,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:14,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:14,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 18:07:14,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2025-04-13 18:07:14,538 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 18:07:14,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash -480885429, now seen corresponding path program 191 times [2025-04-13 18:07:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:14,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402361096] [2025-04-13 18:07:14,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:14,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:14,556 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:14,556 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:14,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:15,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:15,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:15,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402361096] [2025-04-13 18:07:15,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402361096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:15,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578361509] [2025-04-13 18:07:15,205 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:15,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:15,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:15,208 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 18:07:15,208 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 18:07:15,306 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:15,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:15,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:15,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:15,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:15,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:15,590 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:15,590 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 18:07:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:15,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:15,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578361509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:15,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:15,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:07:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75199494] [2025-04-13 18:07:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:15,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:15,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:15,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:15,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:07:15,598 INFO L87 Difference]: Start difference. First operand 1688 states and 4767 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 18:07:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:16,604 INFO L93 Difference]: Finished difference Result 2010 states and 5632 transitions. [2025-04-13 18:07:16,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:07:16,604 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 18:07:16,604 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:16,622 INFO L225 Difference]: With dead ends: 2010 [2025-04-13 18:07:16,622 INFO L226 Difference]: Without dead ends: 1946 [2025-04-13 18:07:16,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:07:16,623 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 322 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:16,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 451 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2025-04-13 18:07:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1693. [2025-04-13 18:07:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1692 states have (on average 2.8232860520094563) internal successors, (4777), 1692 states have internal predecessors, (4777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 4777 transitions. [2025-04-13 18:07:16,648 INFO L79 Accepts]: Start accepts. Automaton has 1693 states and 4777 transitions. Word has length 56 [2025-04-13 18:07:16,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:16,648 INFO L485 AbstractCegarLoop]: Abstraction has 1693 states and 4777 transitions. [2025-04-13 18:07:16,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 18:07:16,648 INFO L278 IsEmpty]: Start isEmpty. Operand 1693 states and 4777 transitions. [2025-04-13 18:07:16,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:16,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:16,650 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:16,656 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 18:07:16,850 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 18:07:16,850 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 18:07:16,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:16,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1530223151, now seen corresponding path program 192 times [2025-04-13 18:07:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:16,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246168430] [2025-04-13 18:07:16,853 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:16,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:16,862 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:16,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:16,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:16,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07: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 18:07:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:16,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246168430] [2025-04-13 18:07:16,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246168430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:16,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:16,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:16,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168286263] [2025-04-13 18:07:16,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:16,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:16,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:16,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:16,990 INFO L87 Difference]: Start difference. First operand 1693 states and 4777 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 18:07:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:17,399 INFO L93 Difference]: Finished difference Result 1899 states and 5329 transitions. [2025-04-13 18:07:17,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:07:17,399 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 18:07:17,400 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:17,409 INFO L225 Difference]: With dead ends: 1899 [2025-04-13 18:07:17,410 INFO L226 Difference]: Without dead ends: 1711 [2025-04-13 18:07:17,410 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:17,411 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 195 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:17,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 593 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2025-04-13 18:07:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1649. [2025-04-13 18:07:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 2.8112864077669903) internal successors, (4633), 1648 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 4633 transitions. [2025-04-13 18:07:17,437 INFO L79 Accepts]: Start accepts. Automaton has 1649 states and 4633 transitions. Word has length 56 [2025-04-13 18:07:17,438 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:17,438 INFO L485 AbstractCegarLoop]: Abstraction has 1649 states and 4633 transitions. [2025-04-13 18:07:17,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 18:07:17,438 INFO L278 IsEmpty]: Start isEmpty. Operand 1649 states and 4633 transitions. [2025-04-13 18:07:17,439 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:17,439 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:17,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 18:07:17,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2025-04-13 18:07:17,440 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 18:07:17,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 80446765, now seen corresponding path program 193 times [2025-04-13 18:07:17,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:17,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500158058] [2025-04-13 18:07:17,441 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:17,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:17,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:17,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:17,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:17,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:18,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500158058] [2025-04-13 18:07:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500158058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:18,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149797960] [2025-04-13 18:07:18,258 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:18,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:18,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:18,259 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 18:07:18,262 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 18:07:18,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:18,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:18,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:18,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:18,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:18,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:18,594 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:18,594 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 18:07:18,619 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 18:07:18,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:18,809 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:18,809 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 18:07:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:18,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149797960] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:18,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:18,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:07:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92030043] [2025-04-13 18:07:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:18,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:18,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:18,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:18,840 INFO L87 Difference]: Start difference. First operand 1649 states and 4633 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 18:07:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:19,549 INFO L93 Difference]: Finished difference Result 1918 states and 5385 transitions. [2025-04-13 18:07:19,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:19,550 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 18:07:19,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:19,559 INFO L225 Difference]: With dead ends: 1918 [2025-04-13 18:07:19,559 INFO L226 Difference]: Without dead ends: 1853 [2025-04-13 18:07:19,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=2428, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:07:19,563 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 300 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:19,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 430 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2025-04-13 18:07:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1654. [2025-04-13 18:07:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1653 states have (on average 2.808832425892317) internal successors, (4643), 1653 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 4643 transitions. [2025-04-13 18:07:19,590 INFO L79 Accepts]: Start accepts. Automaton has 1654 states and 4643 transitions. Word has length 56 [2025-04-13 18:07:19,590 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:19,590 INFO L485 AbstractCegarLoop]: Abstraction has 1654 states and 4643 transitions. [2025-04-13 18:07:19,590 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 18:07:19,590 INFO L278 IsEmpty]: Start isEmpty. Operand 1654 states and 4643 transitions. [2025-04-13 18:07:19,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:19,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:19,592 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:19,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 18:07:19,793 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 18:07:19,793 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 18:07:19,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2093988345, now seen corresponding path program 194 times [2025-04-13 18:07:19,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:19,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947025765] [2025-04-13 18:07:19,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:19,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:19,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:19,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:19,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:19,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 18:07:19,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:19,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947025765] [2025-04-13 18:07:19,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947025765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:19,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:19,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:19,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635357784] [2025-04-13 18:07:19,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:19,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:19,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:19,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:19,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:19,922 INFO L87 Difference]: Start difference. First operand 1654 states and 4643 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 18:07:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:20,285 INFO L93 Difference]: Finished difference Result 1818 states and 5056 transitions. [2025-04-13 18:07:20,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:07:20,285 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 18:07:20,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:20,296 INFO L225 Difference]: With dead ends: 1818 [2025-04-13 18:07:20,296 INFO L226 Difference]: Without dead ends: 1596 [2025-04-13 18:07:20,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:07:20,298 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:20,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 585 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2025-04-13 18:07:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1596. [2025-04-13 18:07:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 2.8150470219435735) internal successors, (4490), 1595 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4490 transitions. [2025-04-13 18:07:20,320 INFO L79 Accepts]: Start accepts. Automaton has 1596 states and 4490 transitions. Word has length 56 [2025-04-13 18:07:20,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:20,320 INFO L485 AbstractCegarLoop]: Abstraction has 1596 states and 4490 transitions. [2025-04-13 18:07:20,320 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 18:07:20,320 INFO L278 IsEmpty]: Start isEmpty. Operand 1596 states and 4490 transitions. [2025-04-13 18:07:20,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:20,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:20,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:20,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2025-04-13 18:07:20,322 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 18:07:20,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:20,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2062443369, now seen corresponding path program 195 times [2025-04-13 18:07:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:20,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133309019] [2025-04-13 18:07:20,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:20,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:20,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:20,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:20,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:20,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:20,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133309019] [2025-04-13 18:07:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133309019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875625663] [2025-04-13 18:07:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:20,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:20,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:20,474 INFO L87 Difference]: Start difference. First operand 1596 states and 4490 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 18:07:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:20,908 INFO L93 Difference]: Finished difference Result 1823 states and 5123 transitions. [2025-04-13 18:07:20,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:20,908 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 18:07:20,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:20,919 INFO L225 Difference]: With dead ends: 1823 [2025-04-13 18:07:20,919 INFO L226 Difference]: Without dead ends: 1709 [2025-04-13 18:07:20,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:20,920 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 245 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:20,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 419 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-04-13 18:07:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1536. [2025-04-13 18:07:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 2.8104234527687297) internal successors, (4314), 1535 states have internal predecessors, (4314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 4314 transitions. [2025-04-13 18:07:20,940 INFO L79 Accepts]: Start accepts. Automaton has 1536 states and 4314 transitions. Word has length 56 [2025-04-13 18:07:20,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:20,941 INFO L485 AbstractCegarLoop]: Abstraction has 1536 states and 4314 transitions. [2025-04-13 18:07:20,941 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 18:07:20,941 INFO L278 IsEmpty]: Start isEmpty. Operand 1536 states and 4314 transitions. [2025-04-13 18:07:20,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:20,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:20,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 18:07:20,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2025-04-13 18:07:20,942 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 18:07:20,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1758874603, now seen corresponding path program 196 times [2025-04-13 18:07:20,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:20,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459197762] [2025-04-13 18:07:20,943 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:20,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:20,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:20,951 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 18:07:20,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:20,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:21,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459197762] [2025-04-13 18:07:21,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459197762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:21,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:21,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:21,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991396820] [2025-04-13 18:07:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:21,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:21,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:21,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:21,034 INFO L87 Difference]: Start difference. First operand 1536 states and 4314 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 18:07:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:21,466 INFO L93 Difference]: Finished difference Result 1912 states and 5353 transitions. [2025-04-13 18:07:21,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:07:21,466 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 18:07:21,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:21,475 INFO L225 Difference]: With dead ends: 1912 [2025-04-13 18:07:21,475 INFO L226 Difference]: Without dead ends: 1748 [2025-04-13 18:07:21,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:07:21,476 INFO L437 NwaCegarLoop]: 76 mSDtfsCounter, 223 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:21,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 581 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2025-04-13 18:07:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1656. [2025-04-13 18:07:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 2.804833836858006) internal successors, (4642), 1655 states have internal predecessors, (4642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 4642 transitions. [2025-04-13 18:07:21,498 INFO L79 Accepts]: Start accepts. Automaton has 1656 states and 4642 transitions. Word has length 56 [2025-04-13 18:07:21,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:21,498 INFO L485 AbstractCegarLoop]: Abstraction has 1656 states and 4642 transitions. [2025-04-13 18:07:21,498 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 18:07:21,498 INFO L278 IsEmpty]: Start isEmpty. Operand 1656 states and 4642 transitions. [2025-04-13 18:07:21,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:21,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:21,500 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:21,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2025-04-13 18:07:21,500 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 18:07:21,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2053411755, now seen corresponding path program 197 times [2025-04-13 18:07:21,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:21,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419642584] [2025-04-13 18:07:21,500 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:21,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:21,505 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:21,512 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:21,512 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:21,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:22,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419642584] [2025-04-13 18:07:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419642584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:22,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165243305] [2025-04-13 18:07:22,219 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:22,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:22,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:22,221 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 18:07:22,224 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 18:07:22,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:22,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:22,341 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:22,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:22,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:22,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:22,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:22,585 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 18:07:22,591 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 18:07:22,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:22,800 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:22,801 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 18:07:22,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 18:07:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165243305] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:22,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:07:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613723726] [2025-04-13 18:07:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:22,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:22,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:22,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:22,834 INFO L87 Difference]: Start difference. First operand 1656 states and 4642 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 18:07:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:23,753 INFO L93 Difference]: Finished difference Result 1929 states and 5342 transitions. [2025-04-13 18:07:23,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:23,754 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 18:07:23,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:23,764 INFO L225 Difference]: With dead ends: 1929 [2025-04-13 18:07:23,764 INFO L226 Difference]: Without dead ends: 1865 [2025-04-13 18:07:23,768 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=3048, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:07:23,768 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 322 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 472 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:23,769 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 472 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2025-04-13 18:07:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1666. [2025-04-13 18:07:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1665 states have (on average 2.803003003003003) internal successors, (4667), 1665 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 4667 transitions. [2025-04-13 18:07:23,793 INFO L79 Accepts]: Start accepts. Automaton has 1666 states and 4667 transitions. Word has length 56 [2025-04-13 18:07:23,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:23,793 INFO L485 AbstractCegarLoop]: Abstraction has 1666 states and 4667 transitions. [2025-04-13 18:07:23,793 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 18:07:23,793 INFO L278 IsEmpty]: Start isEmpty. Operand 1666 states and 4667 transitions. [2025-04-13 18:07:23,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:23,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:23,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 18:07:23,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:23,995 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 18:07:23,996 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 18:07:23,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:23,996 INFO L85 PathProgramCache]: Analyzing trace with hash -465334999, now seen corresponding path program 198 times [2025-04-13 18:07:23,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:23,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667654727] [2025-04-13 18:07:23,996 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:24,001 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:24,005 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:24,005 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:24,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:24,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:24,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667654727] [2025-04-13 18:07:24,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667654727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:24,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:24,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268262283] [2025-04-13 18:07:24,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:24,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:24,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:24,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:24,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:24,115 INFO L87 Difference]: Start difference. First operand 1666 states and 4667 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 18:07:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:24,553 INFO L93 Difference]: Finished difference Result 2007 states and 5545 transitions. [2025-04-13 18:07:24,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:24,553 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 18:07:24,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:24,564 INFO L225 Difference]: With dead ends: 2007 [2025-04-13 18:07:24,564 INFO L226 Difference]: Without dead ends: 1943 [2025-04-13 18:07:24,564 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:07:24,564 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 210 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:24,565 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 466 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2025-04-13 18:07:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1766. [2025-04-13 18:07:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1765 states have (on average 2.7926345609065155) internal successors, (4929), 1765 states have internal predecessors, (4929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4929 transitions. [2025-04-13 18:07:24,595 INFO L79 Accepts]: Start accepts. Automaton has 1766 states and 4929 transitions. Word has length 56 [2025-04-13 18:07:24,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:24,595 INFO L485 AbstractCegarLoop]: Abstraction has 1766 states and 4929 transitions. [2025-04-13 18:07:24,595 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 18:07:24,595 INFO L278 IsEmpty]: Start isEmpty. Operand 1766 states and 4929 transitions. [2025-04-13 18:07:24,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:24,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:24,597 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:24,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2025-04-13 18:07:24,597 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 18:07:24,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1492079561, now seen corresponding path program 199 times [2025-04-13 18:07:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:24,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900606413] [2025-04-13 18:07:24,597 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:24,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:24,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:24,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:25,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 18:07:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:25,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900606413] [2025-04-13 18:07:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900606413] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:25,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639218061] [2025-04-13 18:07:25,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:25,461 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 18:07:25,462 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 18:07:25,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:25,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:25,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:25,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:25,793 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:25,793 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 18:07:25,819 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 18:07:25,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:26,009 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:26,009 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 18:07:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639218061] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:26,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:26,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:07:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99788361] [2025-04-13 18:07:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:26,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:26,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:26,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:26,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:26,039 INFO L87 Difference]: Start difference. First operand 1766 states and 4929 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 18:07:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:26,929 INFO L93 Difference]: Finished difference Result 2038 states and 5655 transitions. [2025-04-13 18:07:26,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:07:26,930 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 18:07:26,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:26,941 INFO L225 Difference]: With dead ends: 2038 [2025-04-13 18:07:26,941 INFO L226 Difference]: Without dead ends: 1973 [2025-04-13 18:07:26,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=3145, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:07:26,942 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 356 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:26,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 447 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-04-13 18:07:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1776. [2025-04-13 18:07:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1775 states have (on average 2.7881690140845072) internal successors, (4949), 1775 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:26,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 4949 transitions. [2025-04-13 18:07:26,968 INFO L79 Accepts]: Start accepts. Automaton has 1776 states and 4949 transitions. Word has length 56 [2025-04-13 18:07:26,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:26,968 INFO L485 AbstractCegarLoop]: Abstraction has 1776 states and 4949 transitions. [2025-04-13 18:07:26,968 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 18:07:26,969 INFO L278 IsEmpty]: Start isEmpty. Operand 1776 states and 4949 transitions. [2025-04-13 18:07:26,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:26,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 18:07:26,978 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 18:07:27,175 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 18:07:27,175 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 18:07:27,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:27,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2104416757, now seen corresponding path program 200 times [2025-04-13 18:07:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:27,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151576260] [2025-04-13 18:07:27,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:27,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:27,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:27,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:27,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 18:07:27,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:27,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151576260] [2025-04-13 18:07:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151576260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:27,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772822266] [2025-04-13 18:07:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:27,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:27,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:27,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:27,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:27,324 INFO L87 Difference]: Start difference. First operand 1776 states and 4949 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 18:07:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:27,734 INFO L93 Difference]: Finished difference Result 1964 states and 5452 transitions. [2025-04-13 18:07:27,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:07:27,734 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 18:07:27,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:27,745 INFO L225 Difference]: With dead ends: 1964 [2025-04-13 18:07:27,745 INFO L226 Difference]: Without dead ends: 1899 [2025-04-13 18:07:27,746 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:07:27,746 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 190 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:27,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 460 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-04-13 18:07:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1771. [2025-04-13 18:07:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 2.7903954802259885) internal successors, (4939), 1770 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 4939 transitions. [2025-04-13 18:07:27,773 INFO L79 Accepts]: Start accepts. Automaton has 1771 states and 4939 transitions. Word has length 56 [2025-04-13 18:07:27,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:27,773 INFO L485 AbstractCegarLoop]: Abstraction has 1771 states and 4939 transitions. [2025-04-13 18:07:27,773 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 18:07:27,773 INFO L278 IsEmpty]: Start isEmpty. Operand 1771 states and 4939 transitions. [2025-04-13 18:07:27,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:27,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:27,775 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:27,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2025-04-13 18:07:27,775 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 18:07:27,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 489917043, now seen corresponding path program 201 times [2025-04-13 18:07:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:27,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103866782] [2025-04-13 18:07:27,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:27,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:27,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:27,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:27,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:27,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 18:07:27,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:27,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103866782] [2025-04-13 18:07:27,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103866782] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:27,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:27,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798763893] [2025-04-13 18:07:27,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:27,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:27,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:27,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:27,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:27,890 INFO L87 Difference]: Start difference. First operand 1771 states and 4939 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 18:07:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:28,346 INFO L93 Difference]: Finished difference Result 2006 states and 5556 transitions. [2025-04-13 18:07:28,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:07: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 18:07:28,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:28,357 INFO L225 Difference]: With dead ends: 2006 [2025-04-13 18:07:28,358 INFO L226 Difference]: Without dead ends: 1942 [2025-04-13 18:07:28,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=955, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:07:28,359 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 276 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:28,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 454 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2025-04-13 18:07:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1771. [2025-04-13 18:07:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 2.7875706214689266) internal successors, (4934), 1770 states have internal predecessors, (4934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 4934 transitions. [2025-04-13 18:07:28,391 INFO L79 Accepts]: Start accepts. Automaton has 1771 states and 4934 transitions. Word has length 56 [2025-04-13 18:07:28,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:28,392 INFO L485 AbstractCegarLoop]: Abstraction has 1771 states and 4934 transitions. [2025-04-13 18:07:28,392 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 18:07:28,392 INFO L278 IsEmpty]: Start isEmpty. Operand 1771 states and 4934 transitions. [2025-04-13 18:07:28,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:28,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:28,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 18:07:28,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2025-04-13 18:07:28,395 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 18:07:28,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash -247409635, now seen corresponding path program 202 times [2025-04-13 18:07:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:28,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617853112] [2025-04-13 18:07:28,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:28,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:28,404 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 18:07:28,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:28,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:28,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617853112] [2025-04-13 18:07:28,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617853112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:28,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:28,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702985442] [2025-04-13 18:07:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:28,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:28,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:28,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:28,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:28,487 INFO L87 Difference]: Start difference. First operand 1771 states and 4934 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 18:07:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:28,879 INFO L93 Difference]: Finished difference Result 1917 states and 5318 transitions. [2025-04-13 18:07:28,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:07:28,879 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 18:07:28,880 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:28,890 INFO L225 Difference]: With dead ends: 1917 [2025-04-13 18:07:28,890 INFO L226 Difference]: Without dead ends: 1803 [2025-04-13 18:07:28,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:07:28,891 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 184 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:28,891 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 454 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-04-13 18:07:28,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1711. [2025-04-13 18:07:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1710 states have (on average 2.7824561403508774) internal successors, (4758), 1710 states have internal predecessors, (4758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 4758 transitions. [2025-04-13 18:07:28,914 INFO L79 Accepts]: Start accepts. Automaton has 1711 states and 4758 transitions. Word has length 56 [2025-04-13 18:07:28,914 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:28,914 INFO L485 AbstractCegarLoop]: Abstraction has 1711 states and 4758 transitions. [2025-04-13 18:07:28,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 18:07:28,914 INFO L278 IsEmpty]: Start isEmpty. Operand 1711 states and 4758 transitions. [2025-04-13 18:07:28,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:28,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:28,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 18:07:28,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2025-04-13 18:07:28,916 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 18:07:28,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1791256543, now seen corresponding path program 203 times [2025-04-13 18:07:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:28,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748077780] [2025-04-13 18:07:28,916 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:28,921 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:28,928 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:28,928 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:28,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:29,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748077780] [2025-04-13 18:07:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748077780] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:29,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166876576] [2025-04-13 18:07:29,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:29,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:29,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:29,590 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 18:07:29,591 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 18:07:29,689 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:29,711 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:29,711 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:29,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:29,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:29,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:29,928 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:29,928 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 18:07:29,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 18:07:29,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:29,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166876576] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:29,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:29,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:07:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759335405] [2025-04-13 18:07:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:29,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:29,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:29,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:29,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:07:29,934 INFO L87 Difference]: Start difference. First operand 1711 states and 4758 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 18:07:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:30,901 INFO L93 Difference]: Finished difference Result 1921 states and 5315 transitions. [2025-04-13 18:07:30,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:30,901 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 18:07:30,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:30,911 INFO L225 Difference]: With dead ends: 1921 [2025-04-13 18:07:30,911 INFO L226 Difference]: Without dead ends: 1835 [2025-04-13 18:07:30,911 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=1866, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:07:30,912 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 315 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:30,912 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 423 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:30,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-04-13 18:07:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1716. [2025-04-13 18:07:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 2.780174927113703) internal successors, (4768), 1715 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 4768 transitions. [2025-04-13 18:07:30,935 INFO L79 Accepts]: Start accepts. Automaton has 1716 states and 4768 transitions. Word has length 56 [2025-04-13 18:07:30,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:30,935 INFO L485 AbstractCegarLoop]: Abstraction has 1716 states and 4768 transitions. [2025-04-13 18:07:30,935 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 18:07:30,935 INFO L278 IsEmpty]: Start isEmpty. Operand 1716 states and 4768 transitions. [2025-04-13 18:07:30,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:30,937 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:30,944 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 18:07:31,137 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 18:07:31,138 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 18:07:31,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1434970419, now seen corresponding path program 204 times [2025-04-13 18:07:31,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:31,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830053183] [2025-04-13 18:07:31,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:31,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:31,143 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:31,147 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:31,147 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:31,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830053183] [2025-04-13 18:07:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830053183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:31,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203979918] [2025-04-13 18:07:31,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:31,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:31,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:31,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:31,256 INFO L87 Difference]: Start difference. First operand 1716 states and 4768 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 18:07:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:31,795 INFO L93 Difference]: Finished difference Result 2255 states and 6284 transitions. [2025-04-13 18:07:31,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:07:31,795 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 18:07:31,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:31,807 INFO L225 Difference]: With dead ends: 2255 [2025-04-13 18:07:31,807 INFO L226 Difference]: Without dead ends: 2191 [2025-04-13 18:07:31,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=1023, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:07:31,808 INFO L437 NwaCegarLoop]: 84 mSDtfsCounter, 251 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 644 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:31,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 644 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2025-04-13 18:07:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1726. [2025-04-13 18:07:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1725 states have (on average 2.778550724637681) internal successors, (4793), 1725 states have internal predecessors, (4793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4793 transitions. [2025-04-13 18:07:31,835 INFO L79 Accepts]: Start accepts. Automaton has 1726 states and 4793 transitions. Word has length 56 [2025-04-13 18:07:31,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:31,835 INFO L485 AbstractCegarLoop]: Abstraction has 1726 states and 4793 transitions. [2025-04-13 18:07:31,835 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 18:07:31,835 INFO L278 IsEmpty]: Start isEmpty. Operand 1726 states and 4793 transitions. [2025-04-13 18:07:31,837 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:31,837 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:31,837 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:31,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2025-04-13 18:07:31,837 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 18:07:31,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2089416219, now seen corresponding path program 205 times [2025-04-13 18:07:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:31,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562357897] [2025-04-13 18:07:31,837 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:31,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:31,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:31,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:31,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:32,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:32,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562357897] [2025-04-13 18:07:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562357897] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:32,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569653826] [2025-04-13 18:07:32,676 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:32,678 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 18:07:32,680 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 18:07:32,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:32,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:32,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:32,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:32,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:32,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:33,012 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:33,012 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 18:07:33,038 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 18:07:33,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:33,218 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:33,218 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 18:07:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569653826] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:07:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046529739] [2025-04-13 18:07:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:33,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:33,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:33,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:33,242 INFO L87 Difference]: Start difference. First operand 1726 states and 4793 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 18:07:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:33,994 INFO L93 Difference]: Finished difference Result 1915 states and 5293 transitions. [2025-04-13 18:07:33,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:33,994 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 18:07:33,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:34,003 INFO L225 Difference]: With dead ends: 1915 [2025-04-13 18:07:34,003 INFO L226 Difference]: Without dead ends: 1850 [2025-04-13 18:07:34,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=2934, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:07:34,004 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 329 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:34,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 463 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-04-13 18:07:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1731. [2025-04-13 18:07:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 2.776300578034682) internal successors, (4803), 1730 states have internal predecessors, (4803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 4803 transitions. [2025-04-13 18:07:34,025 INFO L79 Accepts]: Start accepts. Automaton has 1731 states and 4803 transitions. Word has length 56 [2025-04-13 18:07:34,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:34,025 INFO L485 AbstractCegarLoop]: Abstraction has 1731 states and 4803 transitions. [2025-04-13 18:07:34,025 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 18:07:34,025 INFO L278 IsEmpty]: Start isEmpty. Operand 1731 states and 4803 transitions. [2025-04-13 18:07:34,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:34,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:34,027 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:34,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:34,227 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 18:07:34,228 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 18:07:34,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1220915119, now seen corresponding path program 206 times [2025-04-13 18:07:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:34,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686982693] [2025-04-13 18:07:34,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:34,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:34,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:34,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:34,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:34,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686982693] [2025-04-13 18:07:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686982693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:34,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688088322] [2025-04-13 18:07:34,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:34,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:34,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:34,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:34,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:34,333 INFO L87 Difference]: Start difference. First operand 1731 states and 4803 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 18:07:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:34,713 INFO L93 Difference]: Finished difference Result 1998 states and 5519 transitions. [2025-04-13 18:07:34,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:07:34,713 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 18:07:34,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:34,723 INFO L225 Difference]: With dead ends: 1998 [2025-04-13 18:07:34,723 INFO L226 Difference]: Without dead ends: 1933 [2025-04-13 18:07:34,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:07:34,723 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 238 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:34,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 511 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2025-04-13 18:07:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1731. [2025-04-13 18:07:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1730 states have (on average 2.776300578034682) internal successors, (4803), 1730 states have internal predecessors, (4803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 4803 transitions. [2025-04-13 18:07:34,745 INFO L79 Accepts]: Start accepts. Automaton has 1731 states and 4803 transitions. Word has length 56 [2025-04-13 18:07:34,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:34,745 INFO L485 AbstractCegarLoop]: Abstraction has 1731 states and 4803 transitions. [2025-04-13 18:07:34,745 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 18:07:34,745 INFO L278 IsEmpty]: Start isEmpty. Operand 1731 states and 4803 transitions. [2025-04-13 18:07:34,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:34,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:34,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 18:07:34,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2025-04-13 18:07:34,747 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 18:07:34,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -107419615, now seen corresponding path program 207 times [2025-04-13 18:07:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:34,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710771963] [2025-04-13 18:07:34,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:34,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:34,752 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:34,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:34,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:34,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:34,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:34,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710771963] [2025-04-13 18:07:34,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710771963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:34,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:34,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666305550] [2025-04-13 18:07:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:34,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:34,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:34,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:34,848 INFO L87 Difference]: Start difference. First operand 1731 states and 4803 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 18:07:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:35,204 INFO L93 Difference]: Finished difference Result 1883 states and 5194 transitions. [2025-04-13 18:07:35,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:07:35,204 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 18:07:35,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:35,213 INFO L225 Difference]: With dead ends: 1883 [2025-04-13 18:07:35,213 INFO L226 Difference]: Without dead ends: 1764 [2025-04-13 18:07:35,214 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 18:07:35,214 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 265 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:35,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 457 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2025-04-13 18:07:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1671. [2025-04-13 18:07:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 2.7706586826347306) internal successors, (4627), 1670 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 4627 transitions. [2025-04-13 18:07:35,234 INFO L79 Accepts]: Start accepts. Automaton has 1671 states and 4627 transitions. Word has length 56 [2025-04-13 18:07:35,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:35,234 INFO L485 AbstractCegarLoop]: Abstraction has 1671 states and 4627 transitions. [2025-04-13 18:07:35,234 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 18:07:35,234 INFO L278 IsEmpty]: Start isEmpty. Operand 1671 states and 4627 transitions. [2025-04-13 18:07:35,236 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:35,236 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:35,236 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:35,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2025-04-13 18:07:35,236 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 18:07:35,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:35,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1217045055, now seen corresponding path program 208 times [2025-04-13 18:07:35,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:35,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567413377] [2025-04-13 18:07:35,237 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:35,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:35,241 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:35,243 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 18:07:35,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:35,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567413377] [2025-04-13 18:07:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567413377] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:35,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:35,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:35,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576630337] [2025-04-13 18:07:35,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:35,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:35,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:35,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:35,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:35,321 INFO L87 Difference]: Start difference. First operand 1671 states and 4627 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 18:07:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:35,684 INFO L93 Difference]: Finished difference Result 1896 states and 5224 transitions. [2025-04-13 18:07:35,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:07:35,684 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 18:07:35,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:35,693 INFO L225 Difference]: With dead ends: 1896 [2025-04-13 18:07:35,693 INFO L226 Difference]: Without dead ends: 1832 [2025-04-13 18:07:35,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:35,694 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 202 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:35,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 516 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-04-13 18:07:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1661. [2025-04-13 18:07:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1660 states have (on average 2.772289156626506) internal successors, (4602), 1660 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:35,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 4602 transitions. [2025-04-13 18:07:35,715 INFO L79 Accepts]: Start accepts. Automaton has 1661 states and 4602 transitions. Word has length 56 [2025-04-13 18:07:35,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:35,715 INFO L485 AbstractCegarLoop]: Abstraction has 1661 states and 4602 transitions. [2025-04-13 18:07:35,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 18:07:35,715 INFO L278 IsEmpty]: Start isEmpty. Operand 1661 states and 4602 transitions. [2025-04-13 18:07:35,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:35,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:35,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 18:07:35,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2025-04-13 18:07:35,717 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 18:07:35,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash -90234005, now seen corresponding path program 209 times [2025-04-13 18:07:35,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:35,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666027350] [2025-04-13 18:07:35,717 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:35,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:35,722 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:35,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:35,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:35,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:36,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666027350] [2025-04-13 18:07:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666027350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:36,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244542700] [2025-04-13 18:07:36,356 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:36,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:36,358 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 18:07:36,359 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 18:07:36,451 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:36,468 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:36,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:36,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:36,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:36,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:36,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:36,667 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 18:07:36,672 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 18:07:36,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:36,844 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:36,844 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 18:07:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244542700] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:36,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:07:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102170654] [2025-04-13 18:07:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:36,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:36,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:36,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=974, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:36,868 INFO L87 Difference]: Start difference. First operand 1661 states and 4602 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 18:07:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:37,584 INFO L93 Difference]: Finished difference Result 1914 states and 5242 transitions. [2025-04-13 18:07:37,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:07:37,584 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 18:07:37,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:37,593 INFO L225 Difference]: With dead ends: 1914 [2025-04-13 18:07:37,593 INFO L226 Difference]: Without dead ends: 1850 [2025-04-13 18:07:37,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=3065, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:07:37,594 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 292 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:37,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 462 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-04-13 18:07:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1676. [2025-04-13 18:07:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1675 states have (on average 2.7713432835820897) internal successors, (4642), 1675 states have internal predecessors, (4642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 4642 transitions. [2025-04-13 18:07:37,614 INFO L79 Accepts]: Start accepts. Automaton has 1676 states and 4642 transitions. Word has length 56 [2025-04-13 18:07:37,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:37,614 INFO L485 AbstractCegarLoop]: Abstraction has 1676 states and 4642 transitions. [2025-04-13 18:07:37,614 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 18:07:37,614 INFO L278 IsEmpty]: Start isEmpty. Operand 1676 states and 4642 transitions. [2025-04-13 18:07:37,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:37,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:37,616 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:37,622 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 18:07:37,816 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 18:07:37,816 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 18:07:37,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2058400063, now seen corresponding path program 210 times [2025-04-13 18:07:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:37,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171453910] [2025-04-13 18:07:37,817 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:37,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:37,822 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:37,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:37,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:37,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 18:07:37,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:37,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171453910] [2025-04-13 18:07:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171453910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:37,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:37,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:37,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631722686] [2025-04-13 18:07:37,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:37,933 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:37,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:37,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:37,934 INFO L87 Difference]: Start difference. First operand 1676 states and 4642 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 18:07:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:38,382 INFO L93 Difference]: Finished difference Result 1985 states and 5508 transitions. [2025-04-13 18:07:38,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:38,382 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 18:07:38,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:38,391 INFO L225 Difference]: With dead ends: 1985 [2025-04-13 18:07:38,391 INFO L226 Difference]: Without dead ends: 1899 [2025-04-13 18:07:38,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:07:38,392 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 375 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:38,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 651 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2025-04-13 18:07:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1681. [2025-04-13 18:07:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 2.769047619047619) internal successors, (4652), 1680 states have internal predecessors, (4652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 4652 transitions. [2025-04-13 18:07:38,413 INFO L79 Accepts]: Start accepts. Automaton has 1681 states and 4652 transitions. Word has length 56 [2025-04-13 18:07:38,413 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:38,413 INFO L485 AbstractCegarLoop]: Abstraction has 1681 states and 4652 transitions. [2025-04-13 18:07:38,413 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 18:07:38,413 INFO L278 IsEmpty]: Start isEmpty. Operand 1681 states and 4652 transitions. [2025-04-13 18:07:38,414 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:38,414 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:38,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 18:07:38,415 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2025-04-13 18:07:38,415 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 18:07:38,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash 471098189, now seen corresponding path program 211 times [2025-04-13 18:07:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:38,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902747480] [2025-04-13 18:07:38,415 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:38,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:38,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:38,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:38,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:39,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 18:07:39,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:39,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902747480] [2025-04-13 18:07:39,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902747480] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:39,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969506510] [2025-04-13 18:07:39,153 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:39,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:39,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:39,155 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 18:07:39,155 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 18:07:39,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:39,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:39,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:39,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:39,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:39,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:39,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:39,441 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 18:07:39,462 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 18:07:39,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:39,620 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:39,620 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 18:07:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:39,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969506510] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:39,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:39,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:07:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566178452] [2025-04-13 18:07:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:39,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:39,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:39,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:39,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:39,645 INFO L87 Difference]: Start difference. First operand 1681 states and 4652 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 18:07:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:40,358 INFO L93 Difference]: Finished difference Result 1923 states and 5293 transitions. [2025-04-13 18:07:40,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:40,358 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 18:07:40,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:40,367 INFO L225 Difference]: With dead ends: 1923 [2025-04-13 18:07:40,367 INFO L226 Difference]: Without dead ends: 1858 [2025-04-13 18:07:40,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=263, Invalid=3159, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:07:40,368 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 300 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:40,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 455 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2025-04-13 18:07:40,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1686. [2025-04-13 18:07:40,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 2.766765578635015) internal successors, (4662), 1685 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4662 transitions. [2025-04-13 18:07:40,388 INFO L79 Accepts]: Start accepts. Automaton has 1686 states and 4662 transitions. Word has length 56 [2025-04-13 18:07:40,388 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:40,388 INFO L485 AbstractCegarLoop]: Abstraction has 1686 states and 4662 transitions. [2025-04-13 18:07:40,388 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 18:07:40,388 INFO L278 IsEmpty]: Start isEmpty. Operand 1686 states and 4662 transitions. [2025-04-13 18:07:40,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:40,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:40,390 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:40,396 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 18:07:40,590 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 18:07:40,591 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 18:07:40,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash -306484273, now seen corresponding path program 212 times [2025-04-13 18:07:40,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:40,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873775768] [2025-04-13 18:07:40,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:40,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:40,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:40,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:40,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:40,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:40,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873775768] [2025-04-13 18:07:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873775768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411160568] [2025-04-13 18:07:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:40,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:40,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:40,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:40,693 INFO L87 Difference]: Start difference. First operand 1686 states and 4662 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 18:07:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:41,165 INFO L93 Difference]: Finished difference Result 1982 states and 5495 transitions. [2025-04-13 18:07:41,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:41,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 18:07:41,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:41,175 INFO L225 Difference]: With dead ends: 1982 [2025-04-13 18:07:41,175 INFO L226 Difference]: Without dead ends: 1917 [2025-04-13 18:07:41,175 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 18:07:41,175 INFO L437 NwaCegarLoop]: 85 mSDtfsCounter, 255 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:41,175 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 642 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-04-13 18:07:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1686. [2025-04-13 18:07:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1685 states have (on average 2.766765578635015) internal successors, (4662), 1685 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4662 transitions. [2025-04-13 18:07:41,197 INFO L79 Accepts]: Start accepts. Automaton has 1686 states and 4662 transitions. Word has length 56 [2025-04-13 18:07:41,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:41,197 INFO L485 AbstractCegarLoop]: Abstraction has 1686 states and 4662 transitions. [2025-04-13 18:07:41,198 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 18:07:41,198 INFO L278 IsEmpty]: Start isEmpty. Operand 1686 states and 4662 transitions. [2025-04-13 18:07:41,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:41,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:41,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 18:07:41,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2025-04-13 18:07:41,199 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 18:07:41,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1841872503, now seen corresponding path program 213 times [2025-04-13 18:07:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:41,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620212282] [2025-04-13 18:07:41,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:41,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:41,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:41,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:41,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:41,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:41,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620212282] [2025-04-13 18:07:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620212282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:41,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:41,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638275049] [2025-04-13 18:07:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:41,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:41,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:41,315 INFO L87 Difference]: Start difference. First operand 1686 states and 4662 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 18:07:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:41,719 INFO L93 Difference]: Finished difference Result 1891 states and 5194 transitions. [2025-04-13 18:07:41,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:07:41,720 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 18:07:41,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:41,728 INFO L225 Difference]: With dead ends: 1891 [2025-04-13 18:07:41,728 INFO L226 Difference]: Without dead ends: 1827 [2025-04-13 18:07:41,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:07:41,729 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 273 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:41,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 468 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2025-04-13 18:07:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1681. [2025-04-13 18:07:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1681 states, 1680 states have (on average 2.7660714285714287) internal successors, (4647), 1680 states have internal predecessors, (4647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1681 states to 1681 states and 4647 transitions. [2025-04-13 18:07:41,749 INFO L79 Accepts]: Start accepts. Automaton has 1681 states and 4647 transitions. Word has length 56 [2025-04-13 18:07:41,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:41,749 INFO L485 AbstractCegarLoop]: Abstraction has 1681 states and 4647 transitions. [2025-04-13 18:07:41,749 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 18:07:41,749 INFO L278 IsEmpty]: Start isEmpty. Operand 1681 states and 4647 transitions. [2025-04-13 18:07:41,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:41,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:41,751 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:41,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2025-04-13 18:07:41,751 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 18:07:41,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1550522849, now seen corresponding path program 214 times [2025-04-13 18:07:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:41,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767753360] [2025-04-13 18:07:41,751 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:41,755 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:41,758 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 18:07:41,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:41,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:41,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767753360] [2025-04-13 18:07:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767753360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:41,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:41,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:07:41,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701227926] [2025-04-13 18:07:41,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:41,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:07:41,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:41,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:07:41,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:07:41,833 INFO L87 Difference]: Start difference. First operand 1681 states and 4647 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 18:07:42,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:42,298 INFO L93 Difference]: Finished difference Result 2017 states and 5622 transitions. [2025-04-13 18:07:42,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:07:42,299 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 18:07:42,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:42,308 INFO L225 Difference]: With dead ends: 2017 [2025-04-13 18:07:42,308 INFO L226 Difference]: Without dead ends: 1898 [2025-04-13 18:07:42,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:07:42,309 INFO L437 NwaCegarLoop]: 93 mSDtfsCounter, 246 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:42,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 704 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-04-13 18:07:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1616. [2025-04-13 18:07:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 2.7622291021671828) internal successors, (4461), 1615 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 4461 transitions. [2025-04-13 18:07:42,331 INFO L79 Accepts]: Start accepts. Automaton has 1616 states and 4461 transitions. Word has length 56 [2025-04-13 18:07:42,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:42,331 INFO L485 AbstractCegarLoop]: Abstraction has 1616 states and 4461 transitions. [2025-04-13 18:07:42,331 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 18:07:42,331 INFO L278 IsEmpty]: Start isEmpty. Operand 1616 states and 4461 transitions. [2025-04-13 18:07:42,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:42,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:42,333 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:42,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2025-04-13 18:07:42,333 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 18:07:42,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:42,333 INFO L85 PathProgramCache]: Analyzing trace with hash 171921207, now seen corresponding path program 215 times [2025-04-13 18:07:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:42,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470723006] [2025-04-13 18:07:42,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:42,342 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:42,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:42,354 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:42,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:43,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470723006] [2025-04-13 18:07:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470723006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:43,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066195249] [2025-04-13 18:07:43,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:43,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:43,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:43,465 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 18:07:43,467 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 18:07:43,572 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:43,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:43,594 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:43,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:43,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:07:43,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:43,844 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:43,844 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 18:07:43,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 18:07:43,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:07:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066195249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:07:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 26 [2025-04-13 18:07:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433614303] [2025-04-13 18:07:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:43,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:43,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:43,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=641, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:07:43,850 INFO L87 Difference]: Start difference. First operand 1616 states and 4461 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 18:07:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:44,906 INFO L93 Difference]: Finished difference Result 1853 states and 5087 transitions. [2025-04-13 18:07:44,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:07:44,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 18:07:44,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:44,918 INFO L225 Difference]: With dead ends: 1853 [2025-04-13 18:07:44,918 INFO L226 Difference]: Without dead ends: 1767 [2025-04-13 18:07:44,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=2318, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:07:44,919 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 322 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:44,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 394 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:07:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2025-04-13 18:07:44,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1621. [2025-04-13 18:07:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 2.7598765432098764) internal successors, (4471), 1620 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 4471 transitions. [2025-04-13 18:07:44,942 INFO L79 Accepts]: Start accepts. Automaton has 1621 states and 4471 transitions. Word has length 56 [2025-04-13 18:07:44,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:44,942 INFO L485 AbstractCegarLoop]: Abstraction has 1621 states and 4471 transitions. [2025-04-13 18:07:44,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 18:07:44,942 INFO L278 IsEmpty]: Start isEmpty. Operand 1621 states and 4471 transitions. [2025-04-13 18:07:44,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:44,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:44,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 18:07:44,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:45,148 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 18:07:45,148 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 18:07:45,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -2132566713, now seen corresponding path program 216 times [2025-04-13 18:07:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:45,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303068843] [2025-04-13 18:07:45,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:45,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:45,158 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:45,158 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:45,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:45,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:45,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303068843] [2025-04-13 18:07:45,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303068843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:45,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:45,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:45,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303668717] [2025-04-13 18:07:45,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:45,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:45,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:45,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:45,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:45,285 INFO L87 Difference]: Start difference. First operand 1621 states and 4471 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 18:07:45,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:45,868 INFO L93 Difference]: Finished difference Result 2135 states and 5912 transitions. [2025-04-13 18:07:45,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:07:45,868 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 18:07:45,868 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:45,878 INFO L225 Difference]: With dead ends: 2135 [2025-04-13 18:07:45,878 INFO L226 Difference]: Without dead ends: 2071 [2025-04-13 18:07:45,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:07:45,879 INFO L437 NwaCegarLoop]: 79 mSDtfsCounter, 265 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:45,879 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 682 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-04-13 18:07:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1631. [2025-04-13 18:07:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 2.758282208588957) internal successors, (4496), 1630 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4496 transitions. [2025-04-13 18:07:45,903 INFO L79 Accepts]: Start accepts. Automaton has 1631 states and 4496 transitions. Word has length 56 [2025-04-13 18:07:45,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:45,903 INFO L485 AbstractCegarLoop]: Abstraction has 1631 states and 4496 transitions. [2025-04-13 18:07:45,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 18:07:45,904 INFO L278 IsEmpty]: Start isEmpty. Operand 1631 states and 4496 transitions. [2025-04-13 18:07:45,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:45,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:45,905 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:45,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2025-04-13 18:07:45,906 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 18:07:45,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash -126238469, now seen corresponding path program 217 times [2025-04-13 18:07:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:45,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983726905] [2025-04-13 18:07:45,906 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:45,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:45,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:45,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:45,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:46,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983726905] [2025-04-13 18:07:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983726905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:46,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767055385] [2025-04-13 18:07:46,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:46,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:46,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:46,579 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 18:07:46,581 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 18:07:46,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:46,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:46,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:46,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:46,916 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:46,916 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 18:07:46,923 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 18:07:46,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:47,078 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:47,079 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 18:07:47,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 18:07:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767055385] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:47,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:47,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:07:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760309004] [2025-04-13 18:07:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:47,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:47,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:47,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:47,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:47,101 INFO L87 Difference]: Start difference. First operand 1631 states and 4496 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 18:07:47,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:47,869 INFO L93 Difference]: Finished difference Result 1847 states and 5065 transitions. [2025-04-13 18:07:47,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:07:47,869 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 18:07:47,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:47,889 INFO L225 Difference]: With dead ends: 1847 [2025-04-13 18:07:47,889 INFO L226 Difference]: Without dead ends: 1782 [2025-04-13 18:07:47,890 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=2949, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:07:47,890 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 297 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:47,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 481 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-04-13 18:07:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1636. [2025-04-13 18:07:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 2.7559633027522934) internal successors, (4506), 1635 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4506 transitions. [2025-04-13 18:07:47,910 INFO L79 Accepts]: Start accepts. Automaton has 1636 states and 4506 transitions. Word has length 56 [2025-04-13 18:07:47,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:47,911 INFO L485 AbstractCegarLoop]: Abstraction has 1636 states and 4506 transitions. [2025-04-13 18:07:47,911 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 18:07:47,911 INFO L278 IsEmpty]: Start isEmpty. Operand 1636 states and 4506 transitions. [2025-04-13 18:07:47,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:47,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:47,912 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:47,918 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 18:07:48,113 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 18:07:48,113 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 18:07:48,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash 523318825, now seen corresponding path program 218 times [2025-04-13 18:07:48,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:48,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747563162] [2025-04-13 18:07:48,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:48,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:48,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:48,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:48,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:48,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747563162] [2025-04-13 18:07:48,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747563162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:48,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284920224] [2025-04-13 18:07:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:48,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:48,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:48,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:48,220 INFO L87 Difference]: Start difference. First operand 1636 states and 4506 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 18:07:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:48,612 INFO L93 Difference]: Finished difference Result 1878 states and 5147 transitions. [2025-04-13 18:07:48,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:07:48,613 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 18:07:48,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:48,622 INFO L225 Difference]: With dead ends: 1878 [2025-04-13 18:07:48,622 INFO L226 Difference]: Without dead ends: 1813 [2025-04-13 18:07:48,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:07:48,623 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 250 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:48,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 525 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-04-13 18:07:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1636. [2025-04-13 18:07:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 2.7559633027522934) internal successors, (4506), 1635 states have internal predecessors, (4506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4506 transitions. [2025-04-13 18:07:48,643 INFO L79 Accepts]: Start accepts. Automaton has 1636 states and 4506 transitions. Word has length 56 [2025-04-13 18:07:48,643 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:48,643 INFO L485 AbstractCegarLoop]: Abstraction has 1636 states and 4506 transitions. [2025-04-13 18:07:48,643 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 18:07:48,643 INFO L278 IsEmpty]: Start isEmpty. Operand 1636 states and 4506 transitions. [2025-04-13 18:07:48,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:48,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:48,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 18:07:48,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2025-04-13 18:07:48,645 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 18:07:48,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1855758135, now seen corresponding path program 219 times [2025-04-13 18:07:48,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:48,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941311322] [2025-04-13 18:07:48,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:48,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:48,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:48,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:48,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:48,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941311322] [2025-04-13 18:07:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941311322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860043288] [2025-04-13 18:07:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:48,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:48,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:48,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:48,751 INFO L87 Difference]: Start difference. First operand 1636 states and 4506 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 18:07:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:49,132 INFO L93 Difference]: Finished difference Result 1815 states and 4966 transitions. [2025-04-13 18:07:49,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:07:49,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 18:07:49,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:49,142 INFO L225 Difference]: With dead ends: 1815 [2025-04-13 18:07:49,142 INFO L226 Difference]: Without dead ends: 1746 [2025-04-13 18:07:49,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=1076, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:07:49,143 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 278 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:49,143 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 479 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:49,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-04-13 18:07:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1626. [2025-04-13 18:07:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 2.7575384615384615) internal successors, (4481), 1625 states have internal predecessors, (4481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:49,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 4481 transitions. [2025-04-13 18:07:49,163 INFO L79 Accepts]: Start accepts. Automaton has 1626 states and 4481 transitions. Word has length 56 [2025-04-13 18:07:49,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:49,163 INFO L485 AbstractCegarLoop]: Abstraction has 1626 states and 4481 transitions. [2025-04-13 18:07:49,163 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 18:07:49,163 INFO L278 IsEmpty]: Start isEmpty. Operand 1626 states and 4481 transitions. [2025-04-13 18:07:49,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:49,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:49,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 18:07:49,164 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2025-04-13 18:07:49,164 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 18:07:49,165 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1914641349, now seen corresponding path program 220 times [2025-04-13 18:07:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:49,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497637269] [2025-04-13 18:07:49,165 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:49,169 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:49,172 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 18:07:49,172 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:49,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:49,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:49,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497637269] [2025-04-13 18:07:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497637269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:49,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:49,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:49,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656103340] [2025-04-13 18:07:49,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:49,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:49,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:49,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:49,252 INFO L87 Difference]: Start difference. First operand 1626 states and 4481 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 18:07:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:49,616 INFO L93 Difference]: Finished difference Result 1826 states and 5003 transitions. [2025-04-13 18:07:49,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:49,616 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 18:07:49,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:49,628 INFO L225 Difference]: With dead ends: 1826 [2025-04-13 18:07:49,628 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 18:07:49,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:07:49,629 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 216 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:49,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 531 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:07:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 18:07:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1616. [2025-04-13 18:07:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 2.7591331269349846) internal successors, (4456), 1615 states have internal predecessors, (4456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 4456 transitions. [2025-04-13 18:07:49,653 INFO L79 Accepts]: Start accepts. Automaton has 1616 states and 4456 transitions. Word has length 56 [2025-04-13 18:07:49,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:49,653 INFO L485 AbstractCegarLoop]: Abstraction has 1616 states and 4456 transitions. [2025-04-13 18:07:49,653 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 18:07:49,653 INFO L278 IsEmpty]: Start isEmpty. Operand 1616 states and 4456 transitions. [2025-04-13 18:07:49,655 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:49,655 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:49,655 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:49,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2025-04-13 18:07:49,655 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 18:07:49,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:49,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1746123311, now seen corresponding path program 221 times [2025-04-13 18:07:49,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:49,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199722119] [2025-04-13 18:07:49,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:49,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:49,667 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:49,667 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:49,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:50,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:50,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199722119] [2025-04-13 18:07:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199722119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:50,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898500268] [2025-04-13 18:07:50,672 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:50,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:50,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:50,674 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 18:07:50,675 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 18:07:50,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:50,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:50,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:50,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:50,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:50,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:51,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:51,101 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 18:07:51,106 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 18:07:51,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:51,291 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:51,291 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 18:07:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898500268] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 34 [2025-04-13 18:07:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865546962] [2025-04-13 18:07:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:51,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:51,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:51,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:07:51,315 INFO L87 Difference]: Start difference. First operand 1616 states and 4456 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 18:07:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:51,957 INFO L93 Difference]: Finished difference Result 1770 states and 4851 transitions. [2025-04-13 18:07:51,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:51,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 18:07:51,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:51,966 INFO L225 Difference]: With dead ends: 1770 [2025-04-13 18:07:51,966 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 18:07:51,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=2743, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:07:51,967 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 273 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:51,967 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 389 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 18:07:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1621. [2025-04-13 18:07:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1620 states have (on average 2.75679012345679) internal successors, (4466), 1620 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 4466 transitions. [2025-04-13 18:07:51,986 INFO L79 Accepts]: Start accepts. Automaton has 1621 states and 4466 transitions. Word has length 56 [2025-04-13 18:07:51,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:51,986 INFO L485 AbstractCegarLoop]: Abstraction has 1621 states and 4466 transitions. [2025-04-13 18:07:51,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 18:07:51,986 INFO L278 IsEmpty]: Start isEmpty. Operand 1621 states and 4466 transitions. [2025-04-13 18:07:51,988 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:51,988 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:51,988 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:51,994 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 18:07:52,188 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 18:07:52,188 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 18:07:52,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:52,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1360803769, now seen corresponding path program 222 times [2025-04-13 18:07:52,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:52,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263261101] [2025-04-13 18:07:52,189 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:52,193 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:52,197 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:52,197 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:52,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:52,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:52,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263261101] [2025-04-13 18:07:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263261101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900259277] [2025-04-13 18:07:52,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:52,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:52,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:52,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:52,297 INFO L87 Difference]: Start difference. First operand 1621 states and 4466 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 18:07:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:52,895 INFO L93 Difference]: Finished difference Result 1936 states and 5344 transitions. [2025-04-13 18:07:52,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:07:52,895 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 18:07:52,895 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:52,906 INFO L225 Difference]: With dead ends: 1936 [2025-04-13 18:07:52,906 INFO L226 Difference]: Without dead ends: 1850 [2025-04-13 18:07:52,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:07:52,907 INFO L437 NwaCegarLoop]: 82 mSDtfsCounter, 366 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:52,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 699 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2025-04-13 18:07:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1626. [2025-04-13 18:07:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 2.7544615384615385) internal successors, (4476), 1625 states have internal predecessors, (4476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 4476 transitions. [2025-04-13 18:07:52,932 INFO L79 Accepts]: Start accepts. Automaton has 1626 states and 4476 transitions. Word has length 56 [2025-04-13 18:07:52,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:52,932 INFO L485 AbstractCegarLoop]: Abstraction has 1626 states and 4476 transitions. [2025-04-13 18:07:52,932 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 18:07:52,932 INFO L278 IsEmpty]: Start isEmpty. Operand 1626 states and 4476 transitions. [2025-04-13 18:07:52,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:52,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:52,934 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:52,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2025-04-13 18:07:52,934 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 18:07:52,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1588131733, now seen corresponding path program 223 times [2025-04-13 18:07:52,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:52,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797211253] [2025-04-13 18:07:52,935 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:52,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:52,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:52,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:52,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:52,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:53,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:53,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:53,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797211253] [2025-04-13 18:07:53,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797211253] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:53,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559272778] [2025-04-13 18:07:53,831 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:07:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:53,833 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 18:07:53,834 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 18:07:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:07:53,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:53,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:07:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:53,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:53,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:54,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:54,229 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 18:07:54,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 18:07:54,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:54,467 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:54,467 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 18:07:54,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 18:07:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559272778] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:07:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573160620] [2025-04-13 18:07:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:54,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=976, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:07:54,499 INFO L87 Difference]: Start difference. First operand 1626 states and 4476 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 18:07:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:55,341 INFO L93 Difference]: Finished difference Result 1785 states and 4886 transitions. [2025-04-13 18:07:55,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:07:55,342 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 18:07:55,342 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:55,352 INFO L225 Difference]: With dead ends: 1785 [2025-04-13 18:07:55,352 INFO L226 Difference]: Without dead ends: 1699 [2025-04-13 18:07:55,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=229, Invalid=2633, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 18:07:55,353 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 243 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:55,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 398 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-04-13 18:07:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1626. [2025-04-13 18:07:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 2.7544615384615385) internal successors, (4476), 1625 states have internal predecessors, (4476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 4476 transitions. [2025-04-13 18:07:55,376 INFO L79 Accepts]: Start accepts. Automaton has 1626 states and 4476 transitions. Word has length 56 [2025-04-13 18:07:55,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:55,376 INFO L485 AbstractCegarLoop]: Abstraction has 1626 states and 4476 transitions. [2025-04-13 18:07:55,376 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 18:07:55,376 INFO L278 IsEmpty]: Start isEmpty. Operand 1626 states and 4476 transitions. [2025-04-13 18:07:55,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:55,378 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:55,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2025-04-13 18:07:55,581 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 18:07:55,582 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 18:07:55,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1004080567, now seen corresponding path program 224 times [2025-04-13 18:07:55,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:55,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430924878] [2025-04-13 18:07:55,582 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:07:55,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:55,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:55,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:55,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:07:55,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:55,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430924878] [2025-04-13 18:07:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430924878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:55,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:55,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:55,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374096512] [2025-04-13 18:07:55,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:55,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:55,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:55,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:55,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:55,741 INFO L87 Difference]: Start difference. First operand 1626 states and 4476 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 18:07:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:56,324 INFO L93 Difference]: Finished difference Result 1933 states and 5331 transitions. [2025-04-13 18:07:56,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:07:56,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 18:07:56,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:56,336 INFO L225 Difference]: With dead ends: 1933 [2025-04-13 18:07:56,337 INFO L226 Difference]: Without dead ends: 1868 [2025-04-13 18:07:56,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:07:56,338 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 277 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:56,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 690 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2025-04-13 18:07:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1636. [2025-04-13 18:07:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1635 states have (on average 2.7498470948012232) internal successors, (4496), 1635 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 4496 transitions. [2025-04-13 18:07:56,362 INFO L79 Accepts]: Start accepts. Automaton has 1636 states and 4496 transitions. Word has length 56 [2025-04-13 18:07:56,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:56,362 INFO L485 AbstractCegarLoop]: Abstraction has 1636 states and 4496 transitions. [2025-04-13 18:07:56,362 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 18:07:56,362 INFO L278 IsEmpty]: Start isEmpty. Operand 1636 states and 4496 transitions. [2025-04-13 18:07:56,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:56,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:56,364 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:56,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2025-04-13 18:07:56,364 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 18:07:56,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1886291409, now seen corresponding path program 225 times [2025-04-13 18:07:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:56,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898859905] [2025-04-13 18:07:56,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:07:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:56,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:56,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:56,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:07:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:56,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898859905] [2025-04-13 18:07:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898859905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:56,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:56,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211978705] [2025-04-13 18:07:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:56,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:56,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:56,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:56,493 INFO L87 Difference]: Start difference. First operand 1636 states and 4496 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 18:07:56,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:56,960 INFO L93 Difference]: Finished difference Result 1774 states and 4849 transitions. [2025-04-13 18:07:56,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:07:56,961 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 18:07:56,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:56,972 INFO L225 Difference]: With dead ends: 1774 [2025-04-13 18:07:56,972 INFO L226 Difference]: Without dead ends: 1709 [2025-04-13 18:07:56,972 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:07:56,972 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 201 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:56,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 398 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-04-13 18:07:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1631. [2025-04-13 18:07:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 2.752147239263804) internal successors, (4486), 1630 states have internal predecessors, (4486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4486 transitions. [2025-04-13 18:07:56,997 INFO L79 Accepts]: Start accepts. Automaton has 1631 states and 4486 transitions. Word has length 56 [2025-04-13 18:07:56,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:56,997 INFO L485 AbstractCegarLoop]: Abstraction has 1631 states and 4486 transitions. [2025-04-13 18:07:56,997 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 18:07:56,998 INFO L278 IsEmpty]: Start isEmpty. Operand 1631 states and 4486 transitions. [2025-04-13 18:07:57,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:57,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:57,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 18:07:57,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2025-04-13 18:07:57,000 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 18:07:57,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash 852926555, now seen corresponding path program 226 times [2025-04-13 18:07:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:57,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020755246] [2025-04-13 18:07:57,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:07:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:57,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:57,008 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 18:07:57,008 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:07:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:57,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:07:57,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:57,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020755246] [2025-04-13 18:07:57,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020755246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:07:57,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:07:57,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:07:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156109658] [2025-04-13 18:07:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:57,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:57,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:57,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:57,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:07:57,117 INFO L87 Difference]: Start difference. First operand 1631 states and 4486 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 18:07:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:57,714 INFO L93 Difference]: Finished difference Result 1983 states and 5493 transitions. [2025-04-13 18:07:57,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:07:57,714 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 18:07:57,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:57,727 INFO L225 Difference]: With dead ends: 1983 [2025-04-13 18:07:57,728 INFO L226 Difference]: Without dead ends: 1914 [2025-04-13 18:07:57,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:07:57,728 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 266 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:57,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 760 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:07:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2025-04-13 18:07:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1626. [2025-04-13 18:07:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1625 states have (on average 2.7513846153846155) internal successors, (4471), 1625 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 4471 transitions. [2025-04-13 18:07:57,752 INFO L79 Accepts]: Start accepts. Automaton has 1626 states and 4471 transitions. Word has length 56 [2025-04-13 18:07:57,752 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:57,752 INFO L485 AbstractCegarLoop]: Abstraction has 1626 states and 4471 transitions. [2025-04-13 18:07:57,752 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 18:07:57,752 INFO L278 IsEmpty]: Start isEmpty. Operand 1626 states and 4471 transitions. [2025-04-13 18:07:57,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:57,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:57,754 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:57,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2025-04-13 18:07:57,754 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 18:07:57,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 95705195, now seen corresponding path program 227 times [2025-04-13 18:07:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:57,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248399974] [2025-04-13 18:07:57,755 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:57,760 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:57,767 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:57,768 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:07:58,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:07:58,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248399974] [2025-04-13 18:07:58,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248399974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:58,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610019218] [2025-04-13 18:07:58,433 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:07:58,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:07:58,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:07:58,435 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 18:07:58,436 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 18:07:58,543 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:58,564 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:07:58,565 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:07:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:07:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:07:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:07:58,790 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:07:58,790 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 18:07:58,799 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 18:07:58,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:07:58,988 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:07:58,988 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 18:07:59,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 18:07:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610019218] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:07:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:07:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:07:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972738176] [2025-04-13 18:07:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:07:59,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:07:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:07:59,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:07:59,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:07:59,016 INFO L87 Difference]: Start difference. First operand 1626 states and 4471 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 18:07:59,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:07:59,733 INFO L93 Difference]: Finished difference Result 1722 states and 4705 transitions. [2025-04-13 18:07:59,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:07:59,734 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 18:07:59,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:07:59,744 INFO L225 Difference]: With dead ends: 1722 [2025-04-13 18:07:59,744 INFO L226 Difference]: Without dead ends: 1588 [2025-04-13 18:07:59,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=207, Invalid=2243, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:07:59,746 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 182 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:07:59,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 384 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:07:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-04-13 18:07:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1546. [2025-04-13 18:07:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 2.7779935275080905) internal successors, (4292), 1545 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:07:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 4292 transitions. [2025-04-13 18:07:59,767 INFO L79 Accepts]: Start accepts. Automaton has 1546 states and 4292 transitions. Word has length 56 [2025-04-13 18:07:59,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:07:59,767 INFO L485 AbstractCegarLoop]: Abstraction has 1546 states and 4292 transitions. [2025-04-13 18:07:59,767 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 18:07:59,768 INFO L278 IsEmpty]: Start isEmpty. Operand 1546 states and 4292 transitions. [2025-04-13 18:07:59,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:07:59,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:07:59,769 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:07:59,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-13 18:07:59,972 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 18:07:59,973 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 18:07:59,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:07:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1231001099, now seen corresponding path program 228 times [2025-04-13 18:07:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:07:59,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280446523] [2025-04-13 18:07:59,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:07:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:07:59,978 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:07:59,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:07:59,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:07:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:00,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280446523] [2025-04-13 18:08:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280446523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:00,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388922741] [2025-04-13 18:08:00,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:00,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:00,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:00,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:00,107 INFO L87 Difference]: Start difference. First operand 1546 states and 4292 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 18:08:00,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:00,585 INFO L93 Difference]: Finished difference Result 1684 states and 4645 transitions. [2025-04-13 18:08:00,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:08:00,585 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 18:08:00,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:00,596 INFO L225 Difference]: With dead ends: 1684 [2025-04-13 18:08:00,597 INFO L226 Difference]: Without dead ends: 1577 [2025-04-13 18:08:00,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:00,597 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 250 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:00,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 434 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:00,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-04-13 18:08:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1541. [2025-04-13 18:08:00,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 2.770779220779221) internal successors, (4267), 1540 states have internal predecessors, (4267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:00,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 4267 transitions. [2025-04-13 18:08:00,620 INFO L79 Accepts]: Start accepts. Automaton has 1541 states and 4267 transitions. Word has length 56 [2025-04-13 18:08:00,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:00,620 INFO L485 AbstractCegarLoop]: Abstraction has 1541 states and 4267 transitions. [2025-04-13 18:08:00,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 18:08:00,621 INFO L278 IsEmpty]: Start isEmpty. Operand 1541 states and 4267 transitions. [2025-04-13 18:08:00,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:00,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:00,622 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:00,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2025-04-13 18:08:00,622 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 18:08:00,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1250544243, now seen corresponding path program 229 times [2025-04-13 18:08:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:00,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116835835] [2025-04-13 18:08:00,623 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:00,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:00,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:00,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:00,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:01,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 18:08:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:01,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116835835] [2025-04-13 18:08:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116835835] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:01,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954800176] [2025-04-13 18:08:01,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:01,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:01,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:01,348 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 18:08:01,349 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 18:08:01,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:01,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:01,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:01,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:01,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:01,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:01,709 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:01,709 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 18:08:01,716 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 18:08:01,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:01,932 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:01,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 18:08:01,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 18:08:01,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954800176] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:01,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:01,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:08:01,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188930468] [2025-04-13 18:08:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:01,964 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:01,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:01,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:01,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:08:01,964 INFO L87 Difference]: Start difference. First operand 1541 states and 4267 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 18:08:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:02,678 INFO L93 Difference]: Finished difference Result 1917 states and 5306 transitions. [2025-04-13 18:08:02,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:08:02,679 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 18:08:02,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:02,691 INFO L225 Difference]: With dead ends: 1917 [2025-04-13 18:08:02,691 INFO L226 Difference]: Without dead ends: 1753 [2025-04-13 18:08:02,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=2347, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:08:02,692 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 280 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:02,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 473 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-04-13 18:08:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1471. [2025-04-13 18:08:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 1470 states have (on average 2.751700680272109) internal successors, (4045), 1470 states have internal predecessors, (4045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 4045 transitions. [2025-04-13 18:08:02,716 INFO L79 Accepts]: Start accepts. Automaton has 1471 states and 4045 transitions. Word has length 56 [2025-04-13 18:08:02,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:02,716 INFO L485 AbstractCegarLoop]: Abstraction has 1471 states and 4045 transitions. [2025-04-13 18:08:02,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 18:08:02,717 INFO L278 IsEmpty]: Start isEmpty. Operand 1471 states and 4045 transitions. [2025-04-13 18:08:02,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:02,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:02,718 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:02,725 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 18:08:02,919 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 18:08:02,919 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 18:08:02,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash 394726889, now seen corresponding path program 230 times [2025-04-13 18:08:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:02,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598408964] [2025-04-13 18:08:02,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:02,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:02,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:02,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:02,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:03,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 18:08:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:03,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598408964] [2025-04-13 18:08:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598408964] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549231370] [2025-04-13 18:08:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:03,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:03,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:03,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:03,074 INFO L87 Difference]: Start difference. First operand 1471 states and 4045 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 18:08:03,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:03,498 INFO L93 Difference]: Finished difference Result 1668 states and 4593 transitions. [2025-04-13 18:08:03,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:08:03,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 18:08:03,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:03,510 INFO L225 Difference]: With dead ends: 1668 [2025-04-13 18:08:03,510 INFO L226 Difference]: Without dead ends: 1603 [2025-04-13 18:08:03,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:03,511 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 179 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:03,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 422 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:03,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-04-13 18:08:03,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1476. [2025-04-13 18:08:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 2.7491525423728813) internal successors, (4055), 1475 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4055 transitions. [2025-04-13 18:08:03,535 INFO L79 Accepts]: Start accepts. Automaton has 1476 states and 4055 transitions. Word has length 56 [2025-04-13 18:08:03,536 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:03,536 INFO L485 AbstractCegarLoop]: Abstraction has 1476 states and 4055 transitions. [2025-04-13 18:08:03,536 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 18:08:03,536 INFO L278 IsEmpty]: Start isEmpty. Operand 1476 states and 4055 transitions. [2025-04-13 18:08:03,537 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:03,537 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:03,537 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:03,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2025-04-13 18:08:03,538 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 18:08:03,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2138284051, now seen corresponding path program 231 times [2025-04-13 18:08:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:03,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41720837] [2025-04-13 18:08:03,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:03,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:03,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:03,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:03,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:03,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 18:08:03,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:03,676 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41720837] [2025-04-13 18:08:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41720837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:03,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003942064] [2025-04-13 18:08:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:03,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:03,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:03,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:03,677 INFO L87 Difference]: Start difference. First operand 1476 states and 4055 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 18:08:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:04,134 INFO L93 Difference]: Finished difference Result 1897 states and 5191 transitions. [2025-04-13 18:08:04,134 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:08:04,134 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 18:08:04,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:04,147 INFO L225 Difference]: With dead ends: 1897 [2025-04-13 18:08:04,147 INFO L226 Difference]: Without dead ends: 1833 [2025-04-13 18:08:04,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:04,148 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 238 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:04,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 436 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2025-04-13 18:08:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1601. [2025-04-13 18:08:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1600 states have (on average 2.745625) internal successors, (4393), 1600 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4393 transitions. [2025-04-13 18:08:04,176 INFO L79 Accepts]: Start accepts. Automaton has 1601 states and 4393 transitions. Word has length 56 [2025-04-13 18:08:04,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:04,176 INFO L485 AbstractCegarLoop]: Abstraction has 1601 states and 4393 transitions. [2025-04-13 18:08:04,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 18:08:04,176 INFO L278 IsEmpty]: Start isEmpty. Operand 1601 states and 4393 transitions. [2025-04-13 18:08:04,178 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:04,178 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:04,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 18:08:04,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2025-04-13 18:08:04,178 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 18:08:04,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2043233285, now seen corresponding path program 232 times [2025-04-13 18:08:04,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:04,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956430731] [2025-04-13 18:08:04,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:04,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:04,184 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:04,186 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 18:08:04,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:04,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956430731] [2025-04-13 18:08:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956430731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335175818] [2025-04-13 18:08:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:04,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:04,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:04,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:04,284 INFO L87 Difference]: Start difference. First operand 1601 states and 4393 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 18:08:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:04,684 INFO L93 Difference]: Finished difference Result 1686 states and 4600 transitions. [2025-04-13 18:08:04,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:08:04,684 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 18:08:04,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:04,695 INFO L225 Difference]: With dead ends: 1686 [2025-04-13 18:08:04,695 INFO L226 Difference]: Without dead ends: 1562 [2025-04-13 18:08:04,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:08:04,696 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 161 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:04,696 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 411 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-04-13 18:08:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1531. [2025-04-13 18:08:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 2.769281045751634) internal successors, (4237), 1530 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 4237 transitions. [2025-04-13 18:08:04,718 INFO L79 Accepts]: Start accepts. Automaton has 1531 states and 4237 transitions. Word has length 56 [2025-04-13 18:08:04,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:04,718 INFO L485 AbstractCegarLoop]: Abstraction has 1531 states and 4237 transitions. [2025-04-13 18:08:04,718 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 18:08:04,718 INFO L278 IsEmpty]: Start isEmpty. Operand 1531 states and 4237 transitions. [2025-04-13 18:08:04,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:04,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:04,720 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:04,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2025-04-13 18:08:04,720 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 18:08:04,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1576951857, now seen corresponding path program 233 times [2025-04-13 18:08:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:04,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833831568] [2025-04-13 18:08:04,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:04,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:04,735 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:04,735 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:05,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:05,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833831568] [2025-04-13 18:08:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833831568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:05,463 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805504912] [2025-04-13 18:08:05,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:05,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:05,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:05,466 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 18:08:05,467 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 18:08:05,582 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:05,604 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:05,605 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:05,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:05,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:05,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:05,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:05,788 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 18:08:05,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 18:08:05,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805504912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:05,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:05,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:08:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756516264] [2025-04-13 18:08:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:05,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:05,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:05,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:08:05,797 INFO L87 Difference]: Start difference. First operand 1531 states and 4237 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 18:08:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:06,605 INFO L93 Difference]: Finished difference Result 1779 states and 4932 transitions. [2025-04-13 18:08:06,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:08:06,605 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 18:08:06,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:06,615 INFO L225 Difference]: With dead ends: 1779 [2025-04-13 18:08:06,615 INFO L226 Difference]: Without dead ends: 1714 [2025-04-13 18:08:06,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=1693, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:08:06,616 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 306 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:06,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 428 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-04-13 18:08:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1536. [2025-04-13 18:08:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 2.7667752442996743) internal successors, (4247), 1535 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 4247 transitions. [2025-04-13 18:08:06,639 INFO L79 Accepts]: Start accepts. Automaton has 1536 states and 4247 transitions. Word has length 56 [2025-04-13 18:08:06,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:06,639 INFO L485 AbstractCegarLoop]: Abstraction has 1536 states and 4247 transitions. [2025-04-13 18:08:06,639 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 18:08:06,639 INFO L278 IsEmpty]: Start isEmpty. Operand 1536 states and 4247 transitions. [2025-04-13 18:08:06,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:06,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:06,641 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:06,648 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 18:08:06,841 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 18:08:06,842 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 18:08:06,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:06,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1976272713, now seen corresponding path program 234 times [2025-04-13 18:08:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:06,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739051968] [2025-04-13 18:08:06,842 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:06,848 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:06,852 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:06,852 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:06,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:06,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:06,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739051968] [2025-04-13 18:08:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739051968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:06,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:06,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794919876] [2025-04-13 18:08:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:06,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:06,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:06,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:06,963 INFO L87 Difference]: Start difference. First operand 1536 states and 4247 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 18:08:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:07,396 INFO L93 Difference]: Finished difference Result 1926 states and 5290 transitions. [2025-04-13 18:08:07,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:07,396 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 18:08:07,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:07,407 INFO L225 Difference]: With dead ends: 1926 [2025-04-13 18:08:07,407 INFO L226 Difference]: Without dead ends: 1862 [2025-04-13 18:08:07,408 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:07,408 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 230 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:07,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 458 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-04-13 18:08:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1651. [2025-04-13 18:08:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1650 states have (on average 2.758787878787879) internal successors, (4552), 1650 states have internal predecessors, (4552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 4552 transitions. [2025-04-13 18:08:07,430 INFO L79 Accepts]: Start accepts. Automaton has 1651 states and 4552 transitions. Word has length 56 [2025-04-13 18:08:07,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:07,430 INFO L485 AbstractCegarLoop]: Abstraction has 1651 states and 4552 transitions. [2025-04-13 18:08:07,431 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 18:08:07,431 INFO L278 IsEmpty]: Start isEmpty. Operand 1651 states and 4552 transitions. [2025-04-13 18:08:07,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:07,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:07,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 18:08:07,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2025-04-13 18:08:07,433 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 18:08:07,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:07,433 INFO L85 PathProgramCache]: Analyzing trace with hash 405044747, now seen corresponding path program 235 times [2025-04-13 18:08:07,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:07,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104814523] [2025-04-13 18:08:07,433 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:07,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:07,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:07,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:07,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:07,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:08,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104814523] [2025-04-13 18:08:08,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104814523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:08,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655323082] [2025-04-13 18:08:08,299 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:08,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:08,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:08,301 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 18:08:08,302 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 18:08:08,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:08,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:08,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:08,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:08,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:08,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:08,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:08,593 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 18:08:08,628 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 18:08:08,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:08,785 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:08,786 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 18:08:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655323082] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:08,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:08,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:08:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153711863] [2025-04-13 18:08:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:08,812 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:08,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:08,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:08,812 INFO L87 Difference]: Start difference. First operand 1651 states and 4552 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 18:08:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:09,401 INFO L93 Difference]: Finished difference Result 1857 states and 5128 transitions. [2025-04-13 18:08:09,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:08:09,401 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 18:08:09,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:09,414 INFO L225 Difference]: With dead ends: 1857 [2025-04-13 18:08:09,414 INFO L226 Difference]: Without dead ends: 1743 [2025-04-13 18:08:09,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:08:09,415 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 225 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:09,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 432 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-04-13 18:08:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1591. [2025-04-13 18:08:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1590 states have (on average 2.752201257861635) internal successors, (4376), 1590 states have internal predecessors, (4376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 4376 transitions. [2025-04-13 18:08:09,435 INFO L79 Accepts]: Start accepts. Automaton has 1591 states and 4376 transitions. Word has length 56 [2025-04-13 18:08:09,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:09,435 INFO L485 AbstractCegarLoop]: Abstraction has 1591 states and 4376 transitions. [2025-04-13 18:08:09,435 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 18:08:09,436 INFO L278 IsEmpty]: Start isEmpty. Operand 1591 states and 4376 transitions. [2025-04-13 18:08:09,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:09,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:09,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 18:08:09,444 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 18:08:09,637 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 18:08:09,638 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 18:08:09,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 337190955, now seen corresponding path program 236 times [2025-04-13 18:08:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:09,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213913160] [2025-04-13 18:08:09,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:09,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:09,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:09,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:09,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:09,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213913160] [2025-04-13 18:08:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213913160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441166309] [2025-04-13 18:08:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:09,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:09,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:09,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:09,742 INFO L87 Difference]: Start difference. First operand 1591 states and 4376 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 18:08:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:10,066 INFO L93 Difference]: Finished difference Result 1818 states and 5011 transitions. [2025-04-13 18:08:10,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:10,066 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 18:08:10,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:10,076 INFO L225 Difference]: With dead ends: 1818 [2025-04-13 18:08:10,076 INFO L226 Difference]: Without dead ends: 1753 [2025-04-13 18:08:10,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 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 18:08:10,077 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 212 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:10,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 452 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:10,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2025-04-13 18:08:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1596. [2025-04-13 18:08:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1595 states have (on average 2.749843260188088) internal successors, (4386), 1595 states have internal predecessors, (4386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 4386 transitions. [2025-04-13 18:08:10,098 INFO L79 Accepts]: Start accepts. Automaton has 1596 states and 4386 transitions. Word has length 56 [2025-04-13 18:08:10,098 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:10,098 INFO L485 AbstractCegarLoop]: Abstraction has 1596 states and 4386 transitions. [2025-04-13 18:08:10,098 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 18:08:10,098 INFO L278 IsEmpty]: Start isEmpty. Operand 1596 states and 4386 transitions. [2025-04-13 18:08:10,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:10,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:10,099 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:10,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2025-04-13 18:08:10,100 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 18:08:10,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 584156919, now seen corresponding path program 237 times [2025-04-13 18:08:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:10,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917653719] [2025-04-13 18:08:10,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:10,105 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:10,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:10,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:10,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:10,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917653719] [2025-04-13 18:08:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917653719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061347932] [2025-04-13 18:08:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:10,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:10,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:10,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:10,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:10,200 INFO L87 Difference]: Start difference. First operand 1596 states and 4386 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 18:08:10,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:10,564 INFO L93 Difference]: Finished difference Result 1877 states and 5134 transitions. [2025-04-13 18:08:10,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:08:10,564 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 18:08:10,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:10,573 INFO L225 Difference]: With dead ends: 1877 [2025-04-13 18:08:10,573 INFO L226 Difference]: Without dead ends: 1813 [2025-04-13 18:08:10,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=1076, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:08:10,574 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 219 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:10,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 435 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:10,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-04-13 18:08:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1606. [2025-04-13 18:08:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 2.7482866043613705) internal successors, (4411), 1605 states have internal predecessors, (4411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 4411 transitions. [2025-04-13 18:08:10,594 INFO L79 Accepts]: Start accepts. Automaton has 1606 states and 4411 transitions. Word has length 56 [2025-04-13 18:08:10,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:10,594 INFO L485 AbstractCegarLoop]: Abstraction has 1606 states and 4411 transitions. [2025-04-13 18:08:10,594 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 18:08:10,594 INFO L278 IsEmpty]: Start isEmpty. Operand 1606 states and 4411 transitions. [2025-04-13 18:08:10,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:10,596 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:10,596 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:10,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2025-04-13 18:08:10,596 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 18:08:10,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2100769219, now seen corresponding path program 238 times [2025-04-13 18:08:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:10,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351907185] [2025-04-13 18:08:10,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:10,601 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:10,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 18:08:10,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:10,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:10,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 18:08:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:10,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351907185] [2025-04-13 18:08:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351907185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879213608] [2025-04-13 18:08:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:10,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:10,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:10,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:10,681 INFO L87 Difference]: Start difference. First operand 1606 states and 4411 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 18:08:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:10,984 INFO L93 Difference]: Finished difference Result 1786 states and 4912 transitions. [2025-04-13 18:08:10,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:10,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 18:08:10,985 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:10,993 INFO L225 Difference]: With dead ends: 1786 [2025-04-13 18:08:10,994 INFO L226 Difference]: Without dead ends: 1672 [2025-04-13 18:08:10,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:10,994 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 204 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:10,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 447 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-04-13 18:08:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1546. [2025-04-13 18:08:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1545 states have (on average 2.7411003236245954) internal successors, (4235), 1545 states have internal predecessors, (4235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 4235 transitions. [2025-04-13 18:08:11,013 INFO L79 Accepts]: Start accepts. Automaton has 1546 states and 4235 transitions. Word has length 56 [2025-04-13 18:08:11,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:11,013 INFO L485 AbstractCegarLoop]: Abstraction has 1546 states and 4235 transitions. [2025-04-13 18:08:11,013 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 18:08:11,014 INFO L278 IsEmpty]: Start isEmpty. Operand 1546 states and 4235 transitions. [2025-04-13 18:08:11,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:11,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:11,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 18:08:11,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2025-04-13 18:08:11,015 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 18:08:11,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:11,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1145489113, now seen corresponding path program 239 times [2025-04-13 18:08:11,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:11,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54309409] [2025-04-13 18:08:11,015 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:11,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:11,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:11,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:11,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:11,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 18:08:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:11,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54309409] [2025-04-13 18:08:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54309409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:11,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851607988] [2025-04-13 18:08:11,969 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:11,971 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 18:08:11,971 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 18:08:12,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:12,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:12,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:12,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:12,246 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:12,246 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 18:08:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:12,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851607988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2025-04-13 18:08:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637772761] [2025-04-13 18:08:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:12,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:12,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:12,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:08:12,284 INFO L87 Difference]: Start difference. First operand 1546 states and 4235 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 18:08:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:12,928 INFO L93 Difference]: Finished difference Result 1821 states and 4999 transitions. [2025-04-13 18:08:12,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:12,928 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 18:08:12,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:12,937 INFO L225 Difference]: With dead ends: 1821 [2025-04-13 18:08:12,937 INFO L226 Difference]: Without dead ends: 1756 [2025-04-13 18:08:12,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=2102, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:08:12,938 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 286 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:12,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 398 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:12,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2025-04-13 18:08:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1551. [2025-04-13 18:08:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 2.738709677419355) internal successors, (4245), 1550 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4245 transitions. [2025-04-13 18:08:12,957 INFO L79 Accepts]: Start accepts. Automaton has 1551 states and 4245 transitions. Word has length 56 [2025-04-13 18:08:12,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:12,957 INFO L485 AbstractCegarLoop]: Abstraction has 1551 states and 4245 transitions. [2025-04-13 18:08:12,957 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 18:08:12,957 INFO L278 IsEmpty]: Start isEmpty. Operand 1551 states and 4245 transitions. [2025-04-13 18:08:12,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:12,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:12,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 18:08:12,966 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 18:08:13,159 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 18:08:13,159 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 18:08:13,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1006637293, now seen corresponding path program 240 times [2025-04-13 18:08:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:13,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868675372] [2025-04-13 18:08:13,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:13,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:13,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:13,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:13,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:13,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:13,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 18:08:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:13,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868675372] [2025-04-13 18:08:13,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868675372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915754886] [2025-04-13 18:08:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:13,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:13,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:13,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:13,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:13,261 INFO L87 Difference]: Start difference. First operand 1551 states and 4245 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 18:08:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:13,675 INFO L93 Difference]: Finished difference Result 2114 states and 5848 transitions. [2025-04-13 18:08:13,675 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:08:13,675 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 18:08:13,675 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:13,685 INFO L225 Difference]: With dead ends: 2114 [2025-04-13 18:08:13,685 INFO L226 Difference]: Without dead ends: 2050 [2025-04-13 18:08:13,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:08:13,686 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 270 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:13,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 633 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2025-04-13 18:08:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1561. [2025-04-13 18:08:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1560 states have (on average 2.7371794871794872) internal successors, (4270), 1560 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4270 transitions. [2025-04-13 18:08:13,706 INFO L79 Accepts]: Start accepts. Automaton has 1561 states and 4270 transitions. Word has length 56 [2025-04-13 18:08:13,706 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:13,706 INFO L485 AbstractCegarLoop]: Abstraction has 1561 states and 4270 transitions. [2025-04-13 18:08:13,706 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 18:08:13,706 INFO L278 IsEmpty]: Start isEmpty. Operand 1561 states and 4270 transitions. [2025-04-13 18:08:13,708 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:13,708 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:13,708 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:13,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2025-04-13 18:08:13,708 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 18:08:13,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1167481579, now seen corresponding path program 241 times [2025-04-13 18:08:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:13,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54179062] [2025-04-13 18:08:13,708 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:13,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:13,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:13,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:14,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:14,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54179062] [2025-04-13 18:08:14,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54179062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:14,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252822202] [2025-04-13 18:08:14,548 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:14,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:14,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:14,550 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 18:08:14,552 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 18:08:14,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:14,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:14,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:14,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:14,875 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 18:08:14,916 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 18:08:14,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:15,111 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:15,111 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 18:08:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252822202] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:15,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:15,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:08:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748592727] [2025-04-13 18:08:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:15,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:15,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:15,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:15,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:15,142 INFO L87 Difference]: Start difference. First operand 1561 states and 4270 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 18:08:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:15,926 INFO L93 Difference]: Finished difference Result 1794 states and 4915 transitions. [2025-04-13 18:08:15,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:15,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 18:08:15,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:15,935 INFO L225 Difference]: With dead ends: 1794 [2025-04-13 18:08:15,935 INFO L226 Difference]: Without dead ends: 1730 [2025-04-13 18:08:15,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=2931, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:08:15,936 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 237 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:15,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 438 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:15,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-04-13 18:08:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1551. [2025-04-13 18:08:15,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 2.738709677419355) internal successors, (4245), 1550 states have internal predecessors, (4245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4245 transitions. [2025-04-13 18:08:15,956 INFO L79 Accepts]: Start accepts. Automaton has 1551 states and 4245 transitions. Word has length 56 [2025-04-13 18:08:15,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:15,956 INFO L485 AbstractCegarLoop]: Abstraction has 1551 states and 4245 transitions. [2025-04-13 18:08:15,956 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 18:08:15,956 INFO L278 IsEmpty]: Start isEmpty. Operand 1551 states and 4245 transitions. [2025-04-13 18:08:15,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:15,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:15,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 18:08:15,965 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 18:08:16,158 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 18:08:16,158 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 18:08:16,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -632444465, now seen corresponding path program 242 times [2025-04-13 18:08:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:16,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362779174] [2025-04-13 18:08:16,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:16,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:16,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:16,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:16,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:16,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 18:08:16,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:16,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362779174] [2025-04-13 18:08:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362779174] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302847553] [2025-04-13 18:08:16,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:16,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:16,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:16,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:16,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:16,281 INFO L87 Difference]: Start difference. First operand 1551 states and 4245 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 18:08:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:16,733 INFO L93 Difference]: Finished difference Result 1842 states and 5048 transitions. [2025-04-13 18:08:16,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:08:16,733 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 18:08:16,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:16,743 INFO L225 Difference]: With dead ends: 1842 [2025-04-13 18:08:16,743 INFO L226 Difference]: Without dead ends: 1777 [2025-04-13 18:08:16,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:08:16,744 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 257 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:16,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 502 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-04-13 18:08:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1556. [2025-04-13 18:08:16,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 2.7363344051446945) internal successors, (4255), 1555 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 4255 transitions. [2025-04-13 18:08:16,766 INFO L79 Accepts]: Start accepts. Automaton has 1556 states and 4255 transitions. Word has length 56 [2025-04-13 18:08:16,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:16,766 INFO L485 AbstractCegarLoop]: Abstraction has 1556 states and 4255 transitions. [2025-04-13 18:08:16,766 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 18:08:16,766 INFO L278 IsEmpty]: Start isEmpty. Operand 1556 states and 4255 transitions. [2025-04-13 18:08:16,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:16,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:16,768 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:16,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2025-04-13 18:08:16,768 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 18:08:16,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:16,768 INFO L85 PathProgramCache]: Analyzing trace with hash 846312131, now seen corresponding path program 243 times [2025-04-13 18:08:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:16,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595796914] [2025-04-13 18:08:16,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:16,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:16,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:16,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:16,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:16,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595796914] [2025-04-13 18:08:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595796914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:16,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776614671] [2025-04-13 18:08:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:16,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:16,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:16,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:16,909 INFO L87 Difference]: Start difference. First operand 1556 states and 4255 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 18:08:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:17,414 INFO L93 Difference]: Finished difference Result 1748 states and 4788 transitions. [2025-04-13 18:08:17,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:08:17,415 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 18:08:17,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:17,424 INFO L225 Difference]: With dead ends: 1748 [2025-04-13 18:08:17,425 INFO L226 Difference]: Without dead ends: 1662 [2025-04-13 18:08:17,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:08:17,425 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 258 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:17,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 470 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2025-04-13 18:08:17,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1561. [2025-04-13 18:08:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1560 states have (on average 2.733974358974359) internal successors, (4265), 1560 states have internal predecessors, (4265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4265 transitions. [2025-04-13 18:08:17,446 INFO L79 Accepts]: Start accepts. Automaton has 1561 states and 4265 transitions. Word has length 56 [2025-04-13 18:08:17,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:17,446 INFO L485 AbstractCegarLoop]: Abstraction has 1561 states and 4265 transitions. [2025-04-13 18:08:17,446 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 18:08:17,446 INFO L278 IsEmpty]: Start isEmpty. Operand 1561 states and 4265 transitions. [2025-04-13 18:08:17,448 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:17,448 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:17,448 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:17,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2025-04-13 18:08:17,448 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 18:08:17,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1224562657, now seen corresponding path program 244 times [2025-04-13 18:08:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:17,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991887617] [2025-04-13 18:08:17,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:17,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:17,456 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 18:08:17,456 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:17,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:17,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:17,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991887617] [2025-04-13 18:08:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991887617] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463568968] [2025-04-13 18:08:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:17,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:17,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:17,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:17,544 INFO L87 Difference]: Start difference. First operand 1561 states and 4265 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 18:08:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:17,971 INFO L93 Difference]: Finished difference Result 1795 states and 4904 transitions. [2025-04-13 18:08:17,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:17,972 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 18:08:17,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:17,983 INFO L225 Difference]: With dead ends: 1795 [2025-04-13 18:08:17,983 INFO L226 Difference]: Without dead ends: 1731 [2025-04-13 18:08:17,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:17,984 INFO L437 NwaCegarLoop]: 66 mSDtfsCounter, 221 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:17,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 508 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2025-04-13 18:08:17,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1551. [2025-04-13 18:08:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 2.735483870967742) internal successors, (4240), 1550 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:17,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4240 transitions. [2025-04-13 18:08:18,006 INFO L79 Accepts]: Start accepts. Automaton has 1551 states and 4240 transitions. Word has length 56 [2025-04-13 18:08:18,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:18,007 INFO L485 AbstractCegarLoop]: Abstraction has 1551 states and 4240 transitions. [2025-04-13 18:08:18,007 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 18:08:18,007 INFO L278 IsEmpty]: Start isEmpty. Operand 1551 states and 4240 transitions. [2025-04-13 18:08:18,008 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:18,008 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:18,008 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:18,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2025-04-13 18:08:18,009 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 18:08:18,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:18,009 INFO L85 PathProgramCache]: Analyzing trace with hash 548152455, now seen corresponding path program 245 times [2025-04-13 18:08:18,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:18,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745841219] [2025-04-13 18:08:18,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:18,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:18,014 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:18,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:18,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:18,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:18,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745841219] [2025-04-13 18:08:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745841219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:18,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812753812] [2025-04-13 18:08:18,669 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:18,672 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 18:08:18,672 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 18:08:18,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:18,806 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:18,807 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:18,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:18,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:19,049 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:19,050 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 18:08:19,058 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 18:08:19,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:19,249 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:19,249 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 18:08:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812753812] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:08:19,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430031187] [2025-04-13 18:08:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:19,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:19,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:19,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:08:19,281 INFO L87 Difference]: Start difference. First operand 1551 states and 4240 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 18:08:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:20,147 INFO L93 Difference]: Finished difference Result 1748 states and 4788 transitions. [2025-04-13 18:08:20,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:08:20,148 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 18:08:20,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:20,158 INFO L225 Difference]: With dead ends: 1748 [2025-04-13 18:08:20,158 INFO L226 Difference]: Without dead ends: 1683 [2025-04-13 18:08:20,159 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=269, Invalid=2923, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:08:20,159 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 240 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:20,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 466 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-04-13 18:08:20,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1556. [2025-04-13 18:08:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1555 states have (on average 2.733118971061093) internal successors, (4250), 1555 states have internal predecessors, (4250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 4250 transitions. [2025-04-13 18:08:20,182 INFO L79 Accepts]: Start accepts. Automaton has 1556 states and 4250 transitions. Word has length 56 [2025-04-13 18:08:20,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:20,182 INFO L485 AbstractCegarLoop]: Abstraction has 1556 states and 4250 transitions. [2025-04-13 18:08:20,182 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 18:08:20,183 INFO L278 IsEmpty]: Start isEmpty. Operand 1556 states and 4250 transitions. [2025-04-13 18:08:20,184 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:20,184 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:20,184 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:20,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:20,385 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 18:08:20,385 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 18:08:20,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash 205040479, now seen corresponding path program 246 times [2025-04-13 18:08:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:20,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87335323] [2025-04-13 18:08:20,385 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:20,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:20,395 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:20,395 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:20,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:20,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 18:08:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:20,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87335323] [2025-04-13 18:08:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87335323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:20,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54962210] [2025-04-13 18:08:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:20,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:20,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:20,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:20,506 INFO L87 Difference]: Start difference. First operand 1556 states and 4250 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 18:08:21,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:21,003 INFO L93 Difference]: Finished difference Result 1749 states and 4777 transitions. [2025-04-13 18:08:21,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:21,004 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 18:08:21,004 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:21,015 INFO L225 Difference]: With dead ends: 1749 [2025-04-13 18:08:21,015 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 18:08:21,015 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:21,015 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 275 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:21,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 561 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 18:08:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1561. [2025-04-13 18:08:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1560 states have (on average 2.730769230769231) internal successors, (4260), 1560 states have internal predecessors, (4260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4260 transitions. [2025-04-13 18:08:21,038 INFO L79 Accepts]: Start accepts. Automaton has 1561 states and 4260 transitions. Word has length 56 [2025-04-13 18:08:21,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:21,038 INFO L485 AbstractCegarLoop]: Abstraction has 1561 states and 4260 transitions. [2025-04-13 18:08:21,038 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 18:08:21,038 INFO L278 IsEmpty]: Start isEmpty. Operand 1561 states and 4260 transitions. [2025-04-13 18:08:21,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:21,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:21,040 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:21,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2025-04-13 18:08:21,040 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 18:08:21,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1764818237, now seen corresponding path program 247 times [2025-04-13 18:08:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:21,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402261636] [2025-04-13 18:08:21,040 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:21,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:21,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:21,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:21,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:21,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:21,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402261636] [2025-04-13 18:08:21,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402261636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:21,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470068181] [2025-04-13 18:08:21,938 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:21,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:21,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:21,940 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 18:08:21,942 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 18:08:22,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:22,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:22,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:22,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:22,291 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:22,292 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 18:08:22,334 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 18:08:22,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:22,528 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:22,528 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 18:08:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470068181] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:22,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:22,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:08:22,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850860501] [2025-04-13 18:08:22,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:22,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:22,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:22,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:22,557 INFO L87 Difference]: Start difference. First operand 1561 states and 4260 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 18:08:23,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:23,469 INFO L93 Difference]: Finished difference Result 1716 states and 4689 transitions. [2025-04-13 18:08:23,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:23,469 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 18:08:23,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:23,480 INFO L225 Difference]: With dead ends: 1716 [2025-04-13 18:08:23,481 INFO L226 Difference]: Without dead ends: 1597 [2025-04-13 18:08:23,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=275, Invalid=3031, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:08:23,481 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 212 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:23,482 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 447 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:08:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-04-13 18:08:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1496. [2025-04-13 18:08:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1495 states have (on average 2.751839464882943) internal successors, (4114), 1495 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 4114 transitions. [2025-04-13 18:08:23,502 INFO L79 Accepts]: Start accepts. Automaton has 1496 states and 4114 transitions. Word has length 56 [2025-04-13 18:08:23,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:23,502 INFO L485 AbstractCegarLoop]: Abstraction has 1496 states and 4114 transitions. [2025-04-13 18:08:23,502 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 18:08:23,502 INFO L278 IsEmpty]: Start isEmpty. Operand 1496 states and 4114 transitions. [2025-04-13 18:08:23,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:23,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:23,504 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:23,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 18:08:23,704 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 18:08:23,704 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 18:08:23,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2135123439, now seen corresponding path program 248 times [2025-04-13 18:08:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:23,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652494651] [2025-04-13 18:08:23,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:23,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:23,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:23,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:23,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652494651] [2025-04-13 18:08:23,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652494651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:23,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:23,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:23,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171252955] [2025-04-13 18:08:23,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:23,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:23,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:23,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:23,844 INFO L87 Difference]: Start difference. First operand 1496 states and 4114 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 18:08:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:24,301 INFO L93 Difference]: Finished difference Result 1694 states and 4656 transitions. [2025-04-13 18:08:24,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:08:24,302 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 18:08:24,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:24,312 INFO L225 Difference]: With dead ends: 1694 [2025-04-13 18:08:24,312 INFO L226 Difference]: Without dead ends: 1629 [2025-04-13 18:08:24,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:24,313 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 243 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:24,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 541 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-04-13 18:08:24,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1501. [2025-04-13 18:08:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1500 states have (on average 2.7493333333333334) internal successors, (4124), 1500 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 4124 transitions. [2025-04-13 18:08:24,334 INFO L79 Accepts]: Start accepts. Automaton has 1501 states and 4124 transitions. Word has length 56 [2025-04-13 18:08:24,334 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:24,334 INFO L485 AbstractCegarLoop]: Abstraction has 1501 states and 4124 transitions. [2025-04-13 18:08:24,334 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 18:08:24,334 INFO L278 IsEmpty]: Start isEmpty. Operand 1501 states and 4124 transitions. [2025-04-13 18:08:24,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:24,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:24,336 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:24,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2025-04-13 18:08:24,336 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 18:08:24,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -917073745, now seen corresponding path program 249 times [2025-04-13 18:08:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:24,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318224716] [2025-04-13 18:08:24,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:24,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:24,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:24,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:24,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:24,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318224716] [2025-04-13 18:08:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318224716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697389731] [2025-04-13 18:08:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:24,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:24,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:24,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:24,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:24,466 INFO L87 Difference]: Start difference. First operand 1501 states and 4124 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 18:08:24,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:24,935 INFO L93 Difference]: Finished difference Result 1926 states and 5328 transitions. [2025-04-13 18:08:24,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:08:24,936 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 18:08:24,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:24,948 INFO L225 Difference]: With dead ends: 1926 [2025-04-13 18:08:24,948 INFO L226 Difference]: Without dead ends: 1762 [2025-04-13 18:08:24,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:24,949 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 260 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:24,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 494 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2025-04-13 18:08:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1511. [2025-04-13 18:08:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 2.752980132450331) internal successors, (4157), 1510 states have internal predecessors, (4157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 4157 transitions. [2025-04-13 18:08:24,971 INFO L79 Accepts]: Start accepts. Automaton has 1511 states and 4157 transitions. Word has length 56 [2025-04-13 18:08:24,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:24,971 INFO L485 AbstractCegarLoop]: Abstraction has 1511 states and 4157 transitions. [2025-04-13 18:08:24,972 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 18:08:24,972 INFO L278 IsEmpty]: Start isEmpty. Operand 1511 states and 4157 transitions. [2025-04-13 18:08:24,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:24,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:24,973 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:24,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2025-04-13 18:08:24,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 18:08:24,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:24,974 INFO L85 PathProgramCache]: Analyzing trace with hash -302836735, now seen corresponding path program 250 times [2025-04-13 18:08:24,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:24,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045960729] [2025-04-13 18:08:24,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:24,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:24,979 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:24,982 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 18:08:24,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:24,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:25,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:25,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045960729] [2025-04-13 18:08:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045960729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:25,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851308879] [2025-04-13 18:08:25,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:25,068 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:25,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:25,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:25,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:25,068 INFO L87 Difference]: Start difference. First operand 1511 states and 4157 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 18:08:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:25,525 INFO L93 Difference]: Finished difference Result 1791 states and 4970 transitions. [2025-04-13 18:08:25,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:25,526 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 18:08:25,526 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:25,539 INFO L225 Difference]: With dead ends: 1791 [2025-04-13 18:08:25,540 INFO L226 Difference]: Without dead ends: 1672 [2025-04-13 18:08:25,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:08:25,540 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 234 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:25,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 613 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-04-13 18:08:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1446. [2025-04-13 18:08:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 2.775778546712803) internal successors, (4011), 1445 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 4011 transitions. [2025-04-13 18:08:25,564 INFO L79 Accepts]: Start accepts. Automaton has 1446 states and 4011 transitions. Word has length 56 [2025-04-13 18:08:25,564 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:25,564 INFO L485 AbstractCegarLoop]: Abstraction has 1446 states and 4011 transitions. [2025-04-13 18:08:25,564 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 18:08:25,564 INFO L278 IsEmpty]: Start isEmpty. Operand 1446 states and 4011 transitions. [2025-04-13 18:08:25,565 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:25,565 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:25,565 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:25,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2025-04-13 18:08:25,566 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 18:08:25,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1804813553, now seen corresponding path program 251 times [2025-04-13 18:08:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:25,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185712914] [2025-04-13 18:08:25,567 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:25,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:25,572 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:25,579 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:25,579 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:25,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:26,306 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185712914] [2025-04-13 18:08:26,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185712914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:26,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987301484] [2025-04-13 18:08:26,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:26,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:26,309 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 18:08:26,311 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 18:08:26,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:26,448 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:26,448 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:26,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:26,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:26,672 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:26,672 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 18:08:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:26,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987301484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:26,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:08:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23827672] [2025-04-13 18:08:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:26,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:26,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:26,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:08:26,680 INFO L87 Difference]: Start difference. First operand 1446 states and 4011 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 18:08:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:27,680 INFO L93 Difference]: Finished difference Result 1837 states and 5054 transitions. [2025-04-13 18:08:27,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:08:27,680 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 18:08:27,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:27,690 INFO L225 Difference]: With dead ends: 1837 [2025-04-13 18:08:27,690 INFO L226 Difference]: Without dead ends: 1773 [2025-04-13 18:08:27,691 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=1972, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:08:27,691 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 223 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:27,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 479 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:08:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-04-13 18:08:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1501. [2025-04-13 18:08:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1500 states have (on average 2.751333333333333) internal successors, (4127), 1500 states have internal predecessors, (4127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 4127 transitions. [2025-04-13 18:08:27,712 INFO L79 Accepts]: Start accepts. Automaton has 1501 states and 4127 transitions. Word has length 56 [2025-04-13 18:08:27,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:27,713 INFO L485 AbstractCegarLoop]: Abstraction has 1501 states and 4127 transitions. [2025-04-13 18:08:27,713 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 18:08:27,713 INFO L278 IsEmpty]: Start isEmpty. Operand 1501 states and 4127 transitions. [2025-04-13 18:08:27,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:27,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:27,714 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:27,721 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 18:08:27,918 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 18:08:27,919 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 18:08:27,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1396274167, now seen corresponding path program 252 times [2025-04-13 18:08:27,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:27,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897867229] [2025-04-13 18:08:27,919 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:27,924 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:27,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:27,928 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:27,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:28,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897867229] [2025-04-13 18:08:28,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897867229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:28,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:28,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484997066] [2025-04-13 18:08:28,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:28,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:28,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:28,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:28,048 INFO L87 Difference]: Start difference. First operand 1501 states and 4127 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 18:08:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:28,520 INFO L93 Difference]: Finished difference Result 1836 states and 5049 transitions. [2025-04-13 18:08:28,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:08:28,520 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 18:08:28,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:28,530 INFO L225 Difference]: With dead ends: 1836 [2025-04-13 18:08:28,531 INFO L226 Difference]: Without dead ends: 1672 [2025-04-13 18:08:28,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:28,531 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 265 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:28,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 636 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-04-13 18:08:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1511. [2025-04-13 18:08:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 2.7549668874172184) internal successors, (4160), 1510 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 4160 transitions. [2025-04-13 18:08:28,557 INFO L79 Accepts]: Start accepts. Automaton has 1511 states and 4160 transitions. Word has length 56 [2025-04-13 18:08:28,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:28,557 INFO L485 AbstractCegarLoop]: Abstraction has 1511 states and 4160 transitions. [2025-04-13 18:08:28,557 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 18:08:28,558 INFO L278 IsEmpty]: Start isEmpty. Operand 1511 states and 4160 transitions. [2025-04-13 18:08:28,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:28,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:28,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 18:08:28,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2025-04-13 18:08:28,560 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 18:08:28,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:28,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1243481359, now seen corresponding path program 253 times [2025-04-13 18:08:28,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:28,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610350187] [2025-04-13 18:08:28,561 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:28,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:28,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:28,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:28,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:28,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:29,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610350187] [2025-04-13 18:08:29,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610350187] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:29,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284100623] [2025-04-13 18:08:29,721 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:29,725 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 18:08:29,726 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 18:08:29,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:29,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:29,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:29,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:30,129 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:30,129 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 18:08:30,154 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 18:08:30,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:30,364 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:30,364 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 18:08:30,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 18:08:30,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284100623] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:30,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:30,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:08:30,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891044104] [2025-04-13 18:08:30,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:30,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:30,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:30,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:30,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:08:30,393 INFO L87 Difference]: Start difference. First operand 1511 states and 4160 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 18:08:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:31,119 INFO L93 Difference]: Finished difference Result 1773 states and 4912 transitions. [2025-04-13 18:08:31,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:31,119 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 18:08:31,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:31,130 INFO L225 Difference]: With dead ends: 1773 [2025-04-13 18:08:31,130 INFO L226 Difference]: Without dead ends: 1708 [2025-04-13 18:08:31,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=2446, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:08:31,131 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 213 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:31,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 464 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-04-13 18:08:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1516. [2025-04-13 18:08:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1516 states, 1515 states have (on average 2.7524752475247523) internal successors, (4170), 1515 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 4170 transitions. [2025-04-13 18:08:31,154 INFO L79 Accepts]: Start accepts. Automaton has 1516 states and 4170 transitions. Word has length 56 [2025-04-13 18:08:31,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:31,154 INFO L485 AbstractCegarLoop]: Abstraction has 1516 states and 4170 transitions. [2025-04-13 18:08:31,155 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 18:08:31,155 INFO L278 IsEmpty]: Start isEmpty. Operand 1516 states and 4170 transitions. [2025-04-13 18:08:31,156 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:31,156 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:31,156 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:31,163 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 18:08:31,357 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 18:08:31,358 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 18:08:31,359 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash 674483527, now seen corresponding path program 254 times [2025-04-13 18:08:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:31,359 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591119229] [2025-04-13 18:08:31,359 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:31,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:31,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:31,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:31,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:31,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:31,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591119229] [2025-04-13 18:08:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591119229] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:31,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:31,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:31,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778780223] [2025-04-13 18:08:31,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:31,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:31,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:31,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:31,489 INFO L87 Difference]: Start difference. First operand 1516 states and 4170 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 18:08:31,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:31,965 INFO L93 Difference]: Finished difference Result 1827 states and 4964 transitions. [2025-04-13 18:08:31,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:31,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 18:08:31,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:31,986 INFO L225 Difference]: With dead ends: 1827 [2025-04-13 18:08:31,986 INFO L226 Difference]: Without dead ends: 1763 [2025-04-13 18:08:31,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:08:31,987 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 220 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:31,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 524 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2025-04-13 18:08:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1581. [2025-04-13 18:08:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 2.7335443037974683) internal successors, (4319), 1580 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:32,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 4319 transitions. [2025-04-13 18:08:32,015 INFO L79 Accepts]: Start accepts. Automaton has 1581 states and 4319 transitions. Word has length 56 [2025-04-13 18:08:32,016 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:32,016 INFO L485 AbstractCegarLoop]: Abstraction has 1581 states and 4319 transitions. [2025-04-13 18:08:32,016 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 18:08:32,024 INFO L278 IsEmpty]: Start isEmpty. Operand 1581 states and 4319 transitions. [2025-04-13 18:08:32,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:32,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:32,028 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:32,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2025-04-13 18:08:32,031 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 18:08:32,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 738515245, now seen corresponding path program 255 times [2025-04-13 18:08:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:32,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540951943] [2025-04-13 18:08:32,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:32,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:32,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:32,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:32,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:32,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540951943] [2025-04-13 18:08:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540951943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143533018] [2025-04-13 18:08:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:32,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:32,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:32,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:32,169 INFO L87 Difference]: Start difference. First operand 1581 states and 4319 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 18:08:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:32,617 INFO L93 Difference]: Finished difference Result 1827 states and 5024 transitions. [2025-04-13 18:08:32,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:08:32,617 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 18:08:32,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:32,636 INFO L225 Difference]: With dead ends: 1827 [2025-04-13 18:08:32,637 INFO L226 Difference]: Without dead ends: 1713 [2025-04-13 18:08:32,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:32,637 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 188 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:32,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 481 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2025-04-13 18:08:32,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1521. [2025-04-13 18:08:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 2.7519736842105265) internal successors, (4183), 1520 states have internal predecessors, (4183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 4183 transitions. [2025-04-13 18:08:32,714 INFO L79 Accepts]: Start accepts. Automaton has 1521 states and 4183 transitions. Word has length 56 [2025-04-13 18:08:32,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:32,714 INFO L485 AbstractCegarLoop]: Abstraction has 1521 states and 4183 transitions. [2025-04-13 18:08:32,714 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 18:08:32,715 INFO L278 IsEmpty]: Start isEmpty. Operand 1521 states and 4183 transitions. [2025-04-13 18:08:32,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:32,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:32,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 18:08:32,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2025-04-13 18:08:32,719 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 18:08:32,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -964598231, now seen corresponding path program 256 times [2025-04-13 18:08:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:32,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102910712] [2025-04-13 18:08:32,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:32,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:32,730 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 18:08:32,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:32,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:32,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 18:08:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:32,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102910712] [2025-04-13 18:08:32,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102910712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:32,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:32,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583091243] [2025-04-13 18:08:32,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:32,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:32,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:32,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:32,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:32,825 INFO L87 Difference]: Start difference. First operand 1521 states and 4183 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 18:08:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:33,282 INFO L93 Difference]: Finished difference Result 1693 states and 4653 transitions. [2025-04-13 18:08:33,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:33,282 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 18:08:33,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:33,294 INFO L225 Difference]: With dead ends: 1693 [2025-04-13 18:08:33,294 INFO L226 Difference]: Without dead ends: 1628 [2025-04-13 18:08:33,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:08:33,295 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 199 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:33,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 517 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2025-04-13 18:08:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1526. [2025-04-13 18:08:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 2.7495081967213113) internal successors, (4193), 1525 states have internal predecessors, (4193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 4193 transitions. [2025-04-13 18:08:33,320 INFO L79 Accepts]: Start accepts. Automaton has 1526 states and 4193 transitions. Word has length 56 [2025-04-13 18:08:33,320 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:33,320 INFO L485 AbstractCegarLoop]: Abstraction has 1526 states and 4193 transitions. [2025-04-13 18:08:33,320 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 18:08:33,320 INFO L278 IsEmpty]: Start isEmpty. Operand 1526 states and 4193 transitions. [2025-04-13 18:08:33,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:33,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:33,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:33,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2025-04-13 18:08:33,322 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 18:08:33,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 928857485, now seen corresponding path program 257 times [2025-04-13 18:08:33,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:33,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451324515] [2025-04-13 18:08:33,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:33,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:33,335 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:33,335 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:34,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:34,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:34,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451324515] [2025-04-13 18:08:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451324515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:34,091 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359432879] [2025-04-13 18:08:34,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:34,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:34,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:34,093 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 18:08:34,094 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 18:08:34,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:34,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:34,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:34,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:34,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:34,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:34,454 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:34,454 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 18:08:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:34,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359432879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:08:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150720657] [2025-04-13 18:08:34,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:34,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:34,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:34,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:08:34,461 INFO L87 Difference]: Start difference. First operand 1526 states and 4193 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 18:08:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:35,226 INFO L93 Difference]: Finished difference Result 1811 states and 4965 transitions. [2025-04-13 18:08:35,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:08:35,226 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 18:08:35,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:35,238 INFO L225 Difference]: With dead ends: 1811 [2025-04-13 18:08:35,238 INFO L226 Difference]: Without dead ends: 1607 [2025-04-13 18:08:35,238 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:08:35,239 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 146 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:35,239 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 544 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:08:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-04-13 18:08:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1506. [2025-04-13 18:08:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 2.7488372093023257) internal successors, (4137), 1505 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 4137 transitions. [2025-04-13 18:08:35,263 INFO L79 Accepts]: Start accepts. Automaton has 1506 states and 4137 transitions. Word has length 56 [2025-04-13 18:08:35,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:35,264 INFO L485 AbstractCegarLoop]: Abstraction has 1506 states and 4137 transitions. [2025-04-13 18:08:35,264 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 18:08:35,264 INFO L278 IsEmpty]: Start isEmpty. Operand 1506 states and 4137 transitions. [2025-04-13 18:08:35,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:35,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:35,265 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:35,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-04-13 18:08:35,466 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 18:08:35,466 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 18:08:35,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 892408891, now seen corresponding path program 258 times [2025-04-13 18:08:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:35,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112762306] [2025-04-13 18:08:35,466 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:35,472 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:35,476 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:35,476 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:35,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:35,619 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112762306] [2025-04-13 18:08:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112762306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:35,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860518787] [2025-04-13 18:08:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:35,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:35,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:35,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:35,620 INFO L87 Difference]: Start difference. First operand 1506 states and 4137 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 18:08:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:36,071 INFO L93 Difference]: Finished difference Result 1662 states and 4560 transitions. [2025-04-13 18:08:36,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:08:36,071 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 18:08:36,071 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:36,084 INFO L225 Difference]: With dead ends: 1662 [2025-04-13 18:08:36,084 INFO L226 Difference]: Without dead ends: 1548 [2025-04-13 18:08:36,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:36,085 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 208 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:36,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 509 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2025-04-13 18:08:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1446. [2025-04-13 18:08:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 2.7688581314878893) internal successors, (4001), 1445 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 4001 transitions. [2025-04-13 18:08:36,108 INFO L79 Accepts]: Start accepts. Automaton has 1446 states and 4001 transitions. Word has length 56 [2025-04-13 18:08:36,108 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:36,108 INFO L485 AbstractCegarLoop]: Abstraction has 1446 states and 4001 transitions. [2025-04-13 18:08:36,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 18:08:36,108 INFO L278 IsEmpty]: Start isEmpty. Operand 1446 states and 4001 transitions. [2025-04-13 18:08:36,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:36,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:36,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 18:08:36,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2025-04-13 18:08:36,110 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 18:08:36,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:36,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1543269579, now seen corresponding path program 259 times [2025-04-13 18:08:36,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:36,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338712696] [2025-04-13 18:08:36,110 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:36,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:36,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:36,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:36,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338712696] [2025-04-13 18:08:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338712696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:36,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512914515] [2025-04-13 18:08:36,983 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:36,986 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 18:08:36,987 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 18:08:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:37,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:37,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:37,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:37,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:37,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:37,381 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:37,381 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 18:08:37,388 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 18:08:37,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:37,596 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:37,596 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 18:08:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512914515] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:37,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:37,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 18:08:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477238685] [2025-04-13 18:08:37,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:37,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:37,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:37,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:37,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=919, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:37,626 INFO L87 Difference]: Start difference. First operand 1446 states and 4001 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 18:08:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:38,385 INFO L93 Difference]: Finished difference Result 1832 states and 5076 transitions. [2025-04-13 18:08:38,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:38,385 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 18:08:38,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:38,397 INFO L225 Difference]: With dead ends: 1832 [2025-04-13 18:08:38,398 INFO L226 Difference]: Without dead ends: 1668 [2025-04-13 18:08:38,398 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=2448, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:08:38,399 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 255 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:38,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 498 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2025-04-13 18:08:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1456. [2025-04-13 18:08:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1455 states have (on average 2.772508591065292) internal successors, (4034), 1455 states have internal predecessors, (4034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 4034 transitions. [2025-04-13 18:08:38,422 INFO L79 Accepts]: Start accepts. Automaton has 1456 states and 4034 transitions. Word has length 56 [2025-04-13 18:08:38,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:38,423 INFO L485 AbstractCegarLoop]: Abstraction has 1456 states and 4034 transitions. [2025-04-13 18:08:38,423 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 18:08:38,423 INFO L278 IsEmpty]: Start isEmpty. Operand 1456 states and 4034 transitions. [2025-04-13 18:08:38,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:38,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:38,424 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:38,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2025-04-13 18:08:38,625 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 18:08:38,626 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 18:08:38,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash -9550325, now seen corresponding path program 260 times [2025-04-13 18:08:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:38,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900739817] [2025-04-13 18:08:38,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:38,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:38,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:38,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:38,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:38,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:38,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:38,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900739817] [2025-04-13 18:08:38,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900739817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:38,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:38,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:38,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915175653] [2025-04-13 18:08:38,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:38,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:38,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:38,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:38,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:38,760 INFO L87 Difference]: Start difference. First operand 1456 states and 4034 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 18:08:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:39,199 INFO L93 Difference]: Finished difference Result 1721 states and 4693 transitions. [2025-04-13 18:08:39,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:08:39,199 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 18:08:39,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:39,210 INFO L225 Difference]: With dead ends: 1721 [2025-04-13 18:08:39,210 INFO L226 Difference]: Without dead ends: 1507 [2025-04-13 18:08:39,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:39,211 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 209 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:39,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 661 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2025-04-13 18:08:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1436. [2025-04-13 18:08:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 2.7721254355400697) internal successors, (3978), 1435 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3978 transitions. [2025-04-13 18:08:39,232 INFO L79 Accepts]: Start accepts. Automaton has 1436 states and 3978 transitions. Word has length 56 [2025-04-13 18:08:39,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:39,233 INFO L485 AbstractCegarLoop]: Abstraction has 1436 states and 3978 transitions. [2025-04-13 18:08:39,233 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 18:08:39,233 INFO L278 IsEmpty]: Start isEmpty. Operand 1436 states and 3978 transitions. [2025-04-13 18:08:39,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:39,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:39,234 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:39,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2025-04-13 18:08:39,234 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 18:08:39,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash 655529771, now seen corresponding path program 261 times [2025-04-13 18:08:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:39,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993936675] [2025-04-13 18:08:39,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:39,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:39,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:39,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:39,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:39,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:39,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993936675] [2025-04-13 18:08:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993936675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:39,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:39,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453979265] [2025-04-13 18:08:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:39,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:39,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:39,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:39,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:39,392 INFO L87 Difference]: Start difference. First operand 1436 states and 3978 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 18:08:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:39,892 INFO L93 Difference]: Finished difference Result 1736 states and 4745 transitions. [2025-04-13 18:08:39,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:08:39,892 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 18:08:39,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:39,904 INFO L225 Difference]: With dead ends: 1736 [2025-04-13 18:08:39,904 INFO L226 Difference]: Without dead ends: 1672 [2025-04-13 18:08:39,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:08:39,905 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 238 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:39,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 457 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:39,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-04-13 18:08:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1491. [2025-04-13 18:08:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1490 states have (on average 2.7476510067114095) internal successors, (4094), 1490 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 4094 transitions. [2025-04-13 18:08:39,927 INFO L79 Accepts]: Start accepts. Automaton has 1491 states and 4094 transitions. Word has length 56 [2025-04-13 18:08:39,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:39,927 INFO L485 AbstractCegarLoop]: Abstraction has 1491 states and 4094 transitions. [2025-04-13 18:08:39,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 18:08:39,927 INFO L278 IsEmpty]: Start isEmpty. Operand 1491 states and 4094 transitions. [2025-04-13 18:08:39,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:39,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:39,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 18:08:39,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2025-04-13 18:08:39,929 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 18:08:39,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash 792348103, now seen corresponding path program 262 times [2025-04-13 18:08:39,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:39,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28478295] [2025-04-13 18:08:39,929 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:39,934 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:39,937 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 18:08:39,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:39,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:40,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28478295] [2025-04-13 18:08:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28478295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:40,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986357695] [2025-04-13 18:08:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:40,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:40,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:40,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:40,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:40,025 INFO L87 Difference]: Start difference. First operand 1491 states and 4094 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 18:08:40,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:40,464 INFO L93 Difference]: Finished difference Result 1747 states and 4711 transitions. [2025-04-13 18:08:40,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:08:40,465 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 18:08:40,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:40,476 INFO L225 Difference]: With dead ends: 1747 [2025-04-13 18:08:40,476 INFO L226 Difference]: Without dead ends: 1683 [2025-04-13 18:08:40,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:08:40,477 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 266 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:40,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 450 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-04-13 18:08:40,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1491. [2025-04-13 18:08:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 1490 states have (on average 2.7476510067114095) internal successors, (4094), 1490 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 4094 transitions. [2025-04-13 18:08:40,507 INFO L79 Accepts]: Start accepts. Automaton has 1491 states and 4094 transitions. Word has length 56 [2025-04-13 18:08:40,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:40,508 INFO L485 AbstractCegarLoop]: Abstraction has 1491 states and 4094 transitions. [2025-04-13 18:08:40,508 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 18:08:40,508 INFO L278 IsEmpty]: Start isEmpty. Operand 1491 states and 4094 transitions. [2025-04-13 18:08:40,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:40,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:40,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 18:08:40,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2025-04-13 18:08:40,510 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 18:08:40,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1216861965, now seen corresponding path program 263 times [2025-04-13 18:08:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:40,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524690246] [2025-04-13 18:08:40,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:40,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:40,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:40,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:40,526 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:40,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:41,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524690246] [2025-04-13 18:08:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524690246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:41,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444430292] [2025-04-13 18:08:41,200 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:41,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:41,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:41,202 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 18:08:41,204 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 18:08:41,323 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:41,345 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:41,345 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:41,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:41,551 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:41,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 18:08:41,560 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 18:08:41,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:41,723 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:41,723 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 18:08:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444430292] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:08:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592225812] [2025-04-13 18:08:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:41,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:41,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:41,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:08:41,752 INFO L87 Difference]: Start difference. First operand 1491 states and 4094 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 18:08:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:42,459 INFO L93 Difference]: Finished difference Result 1717 states and 4686 transitions. [2025-04-13 18:08:42,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:08:42,460 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 18:08:42,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:42,475 INFO L225 Difference]: With dead ends: 1717 [2025-04-13 18:08:42,475 INFO L226 Difference]: Without dead ends: 1652 [2025-04-13 18:08:42,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=2232, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:08:42,476 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 237 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:42,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 453 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-04-13 18:08:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1551. [2025-04-13 18:08:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1550 states have (on average 2.7225806451612904) internal successors, (4220), 1550 states have internal predecessors, (4220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 4220 transitions. [2025-04-13 18:08:42,505 INFO L79 Accepts]: Start accepts. Automaton has 1551 states and 4220 transitions. Word has length 56 [2025-04-13 18:08:42,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:42,505 INFO L485 AbstractCegarLoop]: Abstraction has 1551 states and 4220 transitions. [2025-04-13 18:08:42,505 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 18:08:42,505 INFO L278 IsEmpty]: Start isEmpty. Operand 1551 states and 4220 transitions. [2025-04-13 18:08:42,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:42,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:42,507 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:42,514 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 18:08:42,707 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 18:08:42,707 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 18:08:42,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash -846733655, now seen corresponding path program 264 times [2025-04-13 18:08:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:42,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934279150] [2025-04-13 18:08:42,708 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:42,713 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:42,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:42,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:42,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:42,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934279150] [2025-04-13 18:08:42,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934279150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:42,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:42,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:42,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172434891] [2025-04-13 18:08:42,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:42,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:42,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:42,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:42,832 INFO L87 Difference]: Start difference. First operand 1551 states and 4220 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 18:08:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:43,269 INFO L93 Difference]: Finished difference Result 1689 states and 4573 transitions. [2025-04-13 18:08:43,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:08:43,270 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 18:08:43,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:43,287 INFO L225 Difference]: With dead ends: 1689 [2025-04-13 18:08:43,287 INFO L226 Difference]: Without dead ends: 1624 [2025-04-13 18:08:43,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=831, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:08:43,288 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 266 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:43,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 445 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2025-04-13 18:08:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1496. [2025-04-13 18:08:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1495 states have (on average 2.745150501672241) internal successors, (4104), 1495 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 4104 transitions. [2025-04-13 18:08:43,319 INFO L79 Accepts]: Start accepts. Automaton has 1496 states and 4104 transitions. Word has length 56 [2025-04-13 18:08:43,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:43,319 INFO L485 AbstractCegarLoop]: Abstraction has 1496 states and 4104 transitions. [2025-04-13 18:08:43,319 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 18:08:43,320 INFO L278 IsEmpty]: Start isEmpty. Operand 1496 states and 4104 transitions. [2025-04-13 18:08:43,321 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:43,321 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:43,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 18:08:43,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2025-04-13 18:08:43,321 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 18:08:43,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1096108727, now seen corresponding path program 265 times [2025-04-13 18:08:43,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:43,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321975144] [2025-04-13 18:08:43,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:43,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:43,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:43,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:43,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:43,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321975144] [2025-04-13 18:08:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321975144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:43,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655047781] [2025-04-13 18:08:43,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:43,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:43,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:43,873 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 18:08:43,874 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 18:08:43,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:44,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:44,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:44,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:44,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:44,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:44,221 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:44,221 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 18:08:44,229 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 18:08:44,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:44,393 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:44,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 18:08:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655047781] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:44,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:44,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:08:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168940254] [2025-04-13 18:08:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:44,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:44,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:44,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:08:44,425 INFO L87 Difference]: Start difference. First operand 1496 states and 4104 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 18:08:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:45,115 INFO L93 Difference]: Finished difference Result 1711 states and 4659 transitions. [2025-04-13 18:08:45,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:45,115 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 18:08:45,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:45,125 INFO L225 Difference]: With dead ends: 1711 [2025-04-13 18:08:45,126 INFO L226 Difference]: Without dead ends: 1597 [2025-04-13 18:08:45,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=2234, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:08:45,127 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 192 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:45,127 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 447 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-04-13 18:08:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1496. [2025-04-13 18:08:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1496 states, 1495 states have (on average 2.7384615384615385) internal successors, (4094), 1495 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 4094 transitions. [2025-04-13 18:08:45,148 INFO L79 Accepts]: Start accepts. Automaton has 1496 states and 4094 transitions. Word has length 56 [2025-04-13 18:08:45,149 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:45,149 INFO L485 AbstractCegarLoop]: Abstraction has 1496 states and 4094 transitions. [2025-04-13 18:08:45,149 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 18:08:45,149 INFO L278 IsEmpty]: Start isEmpty. Operand 1496 states and 4094 transitions. [2025-04-13 18:08:45,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:45,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:45,150 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:45,158 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 18:08:45,351 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 18:08:45,352 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 18:08:45,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1010273467, now seen corresponding path program 266 times [2025-04-13 18:08:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:45,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38634714] [2025-04-13 18:08:45,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:45,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:45,363 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:45,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:45,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:45,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38634714] [2025-04-13 18:08:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38634714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427999792] [2025-04-13 18:08:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:45,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:45,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:45,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:45,475 INFO L87 Difference]: Start difference. First operand 1496 states and 4094 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 18:08:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:45,872 INFO L93 Difference]: Finished difference Result 1592 states and 4328 transitions. [2025-04-13 18:08:45,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:08:45,872 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 18:08:45,872 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:45,883 INFO L225 Difference]: With dead ends: 1592 [2025-04-13 18:08:45,883 INFO L226 Difference]: Without dead ends: 1478 [2025-04-13 18:08:45,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:45,884 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 219 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:45,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 441 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2025-04-13 18:08:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1436. [2025-04-13 18:08:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 2.730313588850174) internal successors, (3918), 1435 states have internal predecessors, (3918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3918 transitions. [2025-04-13 18:08:45,906 INFO L79 Accepts]: Start accepts. Automaton has 1436 states and 3918 transitions. Word has length 56 [2025-04-13 18:08:45,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:45,907 INFO L485 AbstractCegarLoop]: Abstraction has 1436 states and 3918 transitions. [2025-04-13 18:08:45,907 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 18:08:45,907 INFO L278 IsEmpty]: Start isEmpty. Operand 1436 states and 3918 transitions. [2025-04-13 18:08:45,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:45,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:45,909 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:45,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2025-04-13 18:08:45,909 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 18:08:45,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash -905766487, now seen corresponding path program 267 times [2025-04-13 18:08:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:45,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674481428] [2025-04-13 18:08:45,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:45,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:45,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:45,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:45,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:46,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 18:08:46,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:46,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674481428] [2025-04-13 18:08:46,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674481428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:46,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:46,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:46,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943181919] [2025-04-13 18:08:46,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:46,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:46,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:46,042 INFO L87 Difference]: Start difference. First operand 1436 states and 3918 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 18:08:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:46,445 INFO L93 Difference]: Finished difference Result 1721 states and 4690 transitions. [2025-04-13 18:08:46,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:08:46,445 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 18:08:46,445 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:46,456 INFO L225 Difference]: With dead ends: 1721 [2025-04-13 18:08:46,456 INFO L226 Difference]: Without dead ends: 1527 [2025-04-13 18:08:46,456 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:08:46,457 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 189 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:46,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 474 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-04-13 18:08:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1426. [2025-04-13 18:08:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1425 states have (on average 2.7263157894736842) internal successors, (3885), 1425 states have internal predecessors, (3885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 3885 transitions. [2025-04-13 18:08:46,477 INFO L79 Accepts]: Start accepts. Automaton has 1426 states and 3885 transitions. Word has length 56 [2025-04-13 18:08:46,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:46,477 INFO L485 AbstractCegarLoop]: Abstraction has 1426 states and 3885 transitions. [2025-04-13 18:08:46,477 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 18:08:46,477 INFO L278 IsEmpty]: Start isEmpty. Operand 1426 states and 3885 transitions. [2025-04-13 18:08:46,478 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:46,478 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:46,478 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:46,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2025-04-13 18:08:46,479 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 18:08:46,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash -177287317, now seen corresponding path program 268 times [2025-04-13 18:08:46,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:46,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960167715] [2025-04-13 18:08:46,479 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:46,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:46,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:46,506 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 18:08:46,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:46,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:46,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 18:08:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:46,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960167715] [2025-04-13 18:08:46,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960167715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:46,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:46,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91285356] [2025-04-13 18:08:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:46,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:46,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:46,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:46,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:46,593 INFO L87 Difference]: Start difference. First operand 1426 states and 3885 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 18:08:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:47,121 INFO L93 Difference]: Finished difference Result 1863 states and 5107 transitions. [2025-04-13 18:08:47,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:08:47,121 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 18:08:47,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:47,133 INFO L225 Difference]: With dead ends: 1863 [2025-04-13 18:08:47,133 INFO L226 Difference]: Without dead ends: 1799 [2025-04-13 18:08:47,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:08:47,133 INFO L437 NwaCegarLoop]: 83 mSDtfsCounter, 275 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:47,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 623 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2025-04-13 18:08:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1431. [2025-04-13 18:08:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1430 states have (on average 2.7237762237762237) internal successors, (3895), 1430 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3895 transitions. [2025-04-13 18:08:47,156 INFO L79 Accepts]: Start accepts. Automaton has 1431 states and 3895 transitions. Word has length 56 [2025-04-13 18:08:47,156 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:47,156 INFO L485 AbstractCegarLoop]: Abstraction has 1431 states and 3895 transitions. [2025-04-13 18:08:47,156 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 18:08:47,157 INFO L278 IsEmpty]: Start isEmpty. Operand 1431 states and 3895 transitions. [2025-04-13 18:08:47,158 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:47,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:47,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 18:08:47,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2025-04-13 18:08:47,158 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 18:08:47,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2007340753, now seen corresponding path program 269 times [2025-04-13 18:08:47,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:47,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422507900] [2025-04-13 18:08:47,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:47,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:47,163 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:47,172 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:47,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:48,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:48,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422507900] [2025-04-13 18:08:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422507900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:48,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003687655] [2025-04-13 18:08:48,078 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:48,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:48,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:48,080 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 18:08:48,081 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 18:08:48,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:48,220 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:48,220 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:48,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:48,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:48,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:48,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:48,422 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 18:08:48,428 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 18:08:48,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:48,566 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:48,566 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 18:08:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003687655] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:48,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:08:48,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464695230] [2025-04-13 18:08:48,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:48,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:08:48,590 INFO L87 Difference]: Start difference. First operand 1431 states and 3895 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 18:08:49,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:49,110 INFO L93 Difference]: Finished difference Result 1635 states and 4414 transitions. [2025-04-13 18:08:49,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:08:49,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 18:08:49,111 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:49,120 INFO L225 Difference]: With dead ends: 1635 [2025-04-13 18:08:49,120 INFO L226 Difference]: Without dead ends: 1379 [2025-04-13 18:08:49,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:08:49,121 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 202 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:49,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 475 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2025-04-13 18:08:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1379. [2025-04-13 18:08:49,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1378 states have (on average 2.7293178519593613) internal successors, (3761), 1378 states have internal predecessors, (3761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 3761 transitions. [2025-04-13 18:08:49,139 INFO L79 Accepts]: Start accepts. Automaton has 1379 states and 3761 transitions. Word has length 56 [2025-04-13 18:08:49,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:49,139 INFO L485 AbstractCegarLoop]: Abstraction has 1379 states and 3761 transitions. [2025-04-13 18:08:49,139 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 18:08:49,139 INFO L278 IsEmpty]: Start isEmpty. Operand 1379 states and 3761 transitions. [2025-04-13 18:08:49,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:49,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:49,140 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:49,148 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 18:08:49,340 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 18:08:49,341 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 18:08:49,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1816369075, now seen corresponding path program 270 times [2025-04-13 18:08:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:49,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695738511] [2025-04-13 18:08:49,341 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:49,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:49,346 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:49,350 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:49,350 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:49,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:49,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:49,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695738511] [2025-04-13 18:08:49,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695738511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:49,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:49,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530529116] [2025-04-13 18:08:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:49,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:49,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:49,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:49,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:49,444 INFO L87 Difference]: Start difference. First operand 1379 states and 3761 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 18:08:49,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:49,807 INFO L93 Difference]: Finished difference Result 1549 states and 4198 transitions. [2025-04-13 18:08:49,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:08:49,807 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 18:08:49,807 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:49,816 INFO L225 Difference]: With dead ends: 1549 [2025-04-13 18:08:49,816 INFO L226 Difference]: Without dead ends: 1484 [2025-04-13 18:08:49,817 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:08:49,817 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 266 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:49,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 494 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-04-13 18:08:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1384. [2025-04-13 18:08:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 2.7266811279826464) internal successors, (3771), 1383 states have internal predecessors, (3771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3771 transitions. [2025-04-13 18:08:49,835 INFO L79 Accepts]: Start accepts. Automaton has 1384 states and 3771 transitions. Word has length 56 [2025-04-13 18:08:49,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:49,835 INFO L485 AbstractCegarLoop]: Abstraction has 1384 states and 3771 transitions. [2025-04-13 18:08:49,835 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 18:08:49,835 INFO L278 IsEmpty]: Start isEmpty. Operand 1384 states and 3771 transitions. [2025-04-13 18:08:49,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:49,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:49,836 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:49,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2025-04-13 18:08:49,836 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 18:08:49,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1193908355, now seen corresponding path program 271 times [2025-04-13 18:08:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:49,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901047781] [2025-04-13 18:08:49,836 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:49,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:49,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:49,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:49,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:50,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901047781] [2025-04-13 18:08:50,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901047781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:50,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015868851] [2025-04-13 18:08:50,634 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:50,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:50,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:50,636 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 18:08:50,637 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 18:08:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:50,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:50,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:50,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:50,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:50,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:50,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:50,931 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 18:08:50,965 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 18:08:50,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:51,142 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:51,142 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 18:08:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:51,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015868851] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:51,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:51,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:08:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923383351] [2025-04-13 18:08:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:51,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:51,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:51,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:08:51,168 INFO L87 Difference]: Start difference. First operand 1384 states and 3771 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 18:08:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:51,833 INFO L93 Difference]: Finished difference Result 1512 states and 4089 transitions. [2025-04-13 18:08:51,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:08:51,834 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 18:08:51,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:51,842 INFO L225 Difference]: With dead ends: 1512 [2025-04-13 18:08:51,843 INFO L226 Difference]: Without dead ends: 1448 [2025-04-13 18:08:51,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=2935, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 18:08:51,843 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 256 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:51,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 523 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-04-13 18:08:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1374. [2025-04-13 18:08:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 2.728332119446468) internal successors, (3746), 1373 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 3746 transitions. [2025-04-13 18:08:51,861 INFO L79 Accepts]: Start accepts. Automaton has 1374 states and 3746 transitions. Word has length 56 [2025-04-13 18:08:51,861 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:51,861 INFO L485 AbstractCegarLoop]: Abstraction has 1374 states and 3746 transitions. [2025-04-13 18:08:51,861 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 18:08:51,861 INFO L278 IsEmpty]: Start isEmpty. Operand 1374 states and 3746 transitions. [2025-04-13 18:08:51,862 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:51,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:51,862 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:51,869 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 18:08:52,062 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 18:08:52,063 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 18:08:52,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash -978884131, now seen corresponding path program 272 times [2025-04-13 18:08:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:52,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046271131] [2025-04-13 18:08:52,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:52,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:52,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:52,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:52,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:52,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046271131] [2025-04-13 18:08:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046271131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702672780] [2025-04-13 18:08:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:52,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:52,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:52,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:52,168 INFO L87 Difference]: Start difference. First operand 1374 states and 3746 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 18:08:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:52,575 INFO L93 Difference]: Finished difference Result 1461 states and 3952 transitions. [2025-04-13 18:08:52,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:08:52,575 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 18:08:52,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:52,585 INFO L225 Difference]: With dead ends: 1461 [2025-04-13 18:08:52,585 INFO L226 Difference]: Without dead ends: 1375 [2025-04-13 18:08:52,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:08:52,585 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 284 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:52,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 553 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-04-13 18:08:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1364. [2025-04-13 18:08:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 2.722670579603815) internal successors, (3711), 1363 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 3711 transitions. [2025-04-13 18:08:52,603 INFO L79 Accepts]: Start accepts. Automaton has 1364 states and 3711 transitions. Word has length 56 [2025-04-13 18:08:52,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:52,603 INFO L485 AbstractCegarLoop]: Abstraction has 1364 states and 3711 transitions. [2025-04-13 18:08:52,603 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 18:08:52,603 INFO L278 IsEmpty]: Start isEmpty. Operand 1364 states and 3711 transitions. [2025-04-13 18:08:52,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:52,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:52,604 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:52,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2025-04-13 18:08:52,604 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 18:08:52,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 521725679, now seen corresponding path program 273 times [2025-04-13 18:08:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:52,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926262876] [2025-04-13 18:08:52,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:08:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:52,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:52,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:52,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:08:52,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:52,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 18:08:52,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:52,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926262876] [2025-04-13 18:08:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926262876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:52,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714258556] [2025-04-13 18:08:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:52,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:52,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:52,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:52,707 INFO L87 Difference]: Start difference. First operand 1364 states and 3711 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 18:08:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:53,100 INFO L93 Difference]: Finished difference Result 1471 states and 3977 transitions. [2025-04-13 18:08:53,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:08:53,100 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 18:08:53,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:53,110 INFO L225 Difference]: With dead ends: 1471 [2025-04-13 18:08:53,110 INFO L226 Difference]: Without dead ends: 1406 [2025-04-13 18:08:53,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:08:53,111 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 241 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:53,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 527 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-04-13 18:08:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1369. [2025-04-13 18:08:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 2.720029239766082) internal successors, (3721), 1368 states have internal predecessors, (3721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 3721 transitions. [2025-04-13 18:08:53,128 INFO L79 Accepts]: Start accepts. Automaton has 1369 states and 3721 transitions. Word has length 56 [2025-04-13 18:08:53,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:53,128 INFO L485 AbstractCegarLoop]: Abstraction has 1369 states and 3721 transitions. [2025-04-13 18:08:53,128 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 18:08:53,128 INFO L278 IsEmpty]: Start isEmpty. Operand 1369 states and 3721 transitions. [2025-04-13 18:08:53,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:53,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:53,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 18:08:53,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2025-04-13 18:08:53,130 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 18:08:53,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1486761345, now seen corresponding path program 274 times [2025-04-13 18:08:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:53,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010447851] [2025-04-13 18:08:53,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:08:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:53,134 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:53,137 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 18:08:53,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:08:53,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:53,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:53,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010447851] [2025-04-13 18:08:53,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010447851] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:53,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:53,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:08:53,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267741275] [2025-04-13 18:08:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:53,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:08:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:53,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:08:53,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:08:53,212 INFO L87 Difference]: Start difference. First operand 1369 states and 3721 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 18:08:53,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:53,597 INFO L93 Difference]: Finished difference Result 1558 states and 4258 transitions. [2025-04-13 18:08:53,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:08:53,598 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 18:08:53,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:53,613 INFO L225 Difference]: With dead ends: 1558 [2025-04-13 18:08:53,613 INFO L226 Difference]: Without dead ends: 1439 [2025-04-13 18:08:53,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:08:53,614 INFO L437 NwaCegarLoop]: 81 mSDtfsCounter, 219 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:53,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 610 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-04-13 18:08:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1304. [2025-04-13 18:08:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 2.743668457405986) internal successors, (3575), 1303 states have internal predecessors, (3575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3575 transitions. [2025-04-13 18:08:53,634 INFO L79 Accepts]: Start accepts. Automaton has 1304 states and 3575 transitions. Word has length 56 [2025-04-13 18:08:53,634 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:53,634 INFO L485 AbstractCegarLoop]: Abstraction has 1304 states and 3575 transitions. [2025-04-13 18:08:53,634 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 18:08:53,634 INFO L278 IsEmpty]: Start isEmpty. Operand 1304 states and 3575 transitions. [2025-04-13 18:08:53,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:53,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:53,636 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:53,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2025-04-13 18:08:53,636 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 18:08:53,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1831240329, now seen corresponding path program 275 times [2025-04-13 18:08:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:53,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335741811] [2025-04-13 18:08:53,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:53,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:53,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:53,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:53,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:55,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335741811] [2025-04-13 18:08:55,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335741811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:55,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323293371] [2025-04-13 18:08:55,094 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:08:55,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:55,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:55,096 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 18:08:55,098 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 18:08:55,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:55,240 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:55,240 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:08:55,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:55,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:08:55,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:55,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:55,522 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 18:08:55,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 18:08:55,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:08:55,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323293371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:08:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 28 [2025-04-13 18:08:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357438621] [2025-04-13 18:08:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:55,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:55,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:55,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=750, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:55,572 INFO L87 Difference]: Start difference. First operand 1304 states and 3575 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 18:08:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:56,639 INFO L93 Difference]: Finished difference Result 1464 states and 3954 transitions. [2025-04-13 18:08:56,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:08:56,639 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 18:08:56,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:56,651 INFO L225 Difference]: With dead ends: 1464 [2025-04-13 18:08:56,651 INFO L226 Difference]: Without dead ends: 1400 [2025-04-13 18:08:56,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=204, Invalid=2148, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:08:56,652 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 211 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:56,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 488 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:08:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-04-13 18:08:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1309. [2025-04-13 18:08:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1309 states, 1308 states have (on average 2.7408256880733943) internal successors, (3585), 1308 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 3585 transitions. [2025-04-13 18:08:56,672 INFO L79 Accepts]: Start accepts. Automaton has 1309 states and 3585 transitions. Word has length 56 [2025-04-13 18:08:56,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:56,672 INFO L485 AbstractCegarLoop]: Abstraction has 1309 states and 3585 transitions. [2025-04-13 18:08:56,672 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 18:08:56,672 INFO L278 IsEmpty]: Start isEmpty. Operand 1309 states and 3585 transitions. [2025-04-13 18:08:56,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:56,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:56,674 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:56,681 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 18:08:56,877 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 18:08:56,878 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 18:08:56,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:56,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2146444455, now seen corresponding path program 276 times [2025-04-13 18:08:56,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:56,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640874286] [2025-04-13 18:08:56,878 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:08:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:56,884 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:08:56,888 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:08:56,888 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:08:56,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:57,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 18:08:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:57,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640874286] [2025-04-13 18:08:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640874286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:57,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:08:57,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520307368] [2025-04-13 18:08:57,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:57,008 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:57,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:57,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:08:57,008 INFO L87 Difference]: Start difference. First operand 1309 states and 3585 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 18:08:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:57,447 INFO L93 Difference]: Finished difference Result 1416 states and 3851 transitions. [2025-04-13 18:08:57,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:08:57,447 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 18:08:57,447 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:57,459 INFO L225 Difference]: With dead ends: 1416 [2025-04-13 18:08:57,459 INFO L226 Difference]: Without dead ends: 1351 [2025-04-13 18:08:57,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:08:57,460 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 216 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:57,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 485 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2025-04-13 18:08:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1314. [2025-04-13 18:08:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 2.738004569687738) internal successors, (3595), 1313 states have internal predecessors, (3595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 3595 transitions. [2025-04-13 18:08:57,482 INFO L79 Accepts]: Start accepts. Automaton has 1314 states and 3595 transitions. Word has length 56 [2025-04-13 18:08:57,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:57,483 INFO L485 AbstractCegarLoop]: Abstraction has 1314 states and 3595 transitions. [2025-04-13 18:08:57,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 18:08:57,483 INFO L278 IsEmpty]: Start isEmpty. Operand 1314 states and 3595 transitions. [2025-04-13 18:08:57,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:57,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:57,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 18:08:57,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2025-04-13 18:08:57,484 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 18:08:57,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash 712088469, now seen corresponding path program 277 times [2025-04-13 18:08:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:57,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872404116] [2025-04-13 18:08:57,485 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:57,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:57,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:57,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:57,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:58,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872404116] [2025-04-13 18:08:58,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872404116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:58,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874559709] [2025-04-13 18:08:58,500 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:08:58,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:58,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:58,502 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 18:08:58,503 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 18:08:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:08:58,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:08:58,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:58,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:58,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:08:58,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:58,938 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:58,938 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 18:08:59,024 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 18:08:59,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:59,290 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:08:59,290 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 18:08:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:08:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874559709] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:59,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:59,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:08:59,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511330390] [2025-04-13 18:08:59,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:59,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:08:59,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:59,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:08:59,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:08:59,318 INFO L87 Difference]: Start difference. First operand 1314 states and 3595 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 18:08:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:59,915 INFO L93 Difference]: Finished difference Result 1379 states and 3742 transitions. [2025-04-13 18:08:59,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:08:59,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 18:08:59,915 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:59,926 INFO L225 Difference]: With dead ends: 1379 [2025-04-13 18:08:59,926 INFO L226 Difference]: Without dead ends: 1245 [2025-04-13 18:08:59,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=2178, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:08:59,927 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 161 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:59,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 480 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:08:59,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2025-04-13 18:08:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1234. [2025-04-13 18:08:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 2.768045417680454) internal successors, (3413), 1233 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3413 transitions. [2025-04-13 18:08:59,955 INFO L79 Accepts]: Start accepts. Automaton has 1234 states and 3413 transitions. Word has length 56 [2025-04-13 18:08:59,955 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:59,955 INFO L485 AbstractCegarLoop]: Abstraction has 1234 states and 3413 transitions. [2025-04-13 18:08:59,955 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 18:08:59,955 INFO L278 IsEmpty]: Start isEmpty. Operand 1234 states and 3413 transitions. [2025-04-13 18:08:59,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:08:59,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:59,957 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:59,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2025-04-13 18:09:00,160 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 18:09:00,161 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 18:09:00,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash 166609899, now seen corresponding path program 278 times [2025-04-13 18:09:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:00,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592665468] [2025-04-13 18:09:00,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:00,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:00,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:00,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:00,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:00,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:00,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:00,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592665468] [2025-04-13 18:09:00,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592665468] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:00,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:00,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715941127] [2025-04-13 18:09:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:00,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:00,304 INFO L87 Difference]: Start difference. First operand 1234 states and 3413 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 18:09:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:00,795 INFO L93 Difference]: Finished difference Result 1440 states and 3924 transitions. [2025-04-13 18:09:00,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:00,795 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 18:09:00,795 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:00,809 INFO L225 Difference]: With dead ends: 1440 [2025-04-13 18:09:00,809 INFO L226 Difference]: Without dead ends: 1276 [2025-04-13 18:09:00,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:00,810 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 302 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:00,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 546 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-04-13 18:09:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1234. [2025-04-13 18:09:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 2.727493917274939) internal successors, (3363), 1233 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3363 transitions. [2025-04-13 18:09:00,834 INFO L79 Accepts]: Start accepts. Automaton has 1234 states and 3363 transitions. Word has length 56 [2025-04-13 18:09:00,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:00,834 INFO L485 AbstractCegarLoop]: Abstraction has 1234 states and 3363 transitions. [2025-04-13 18:09:00,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 18:09:00,834 INFO L278 IsEmpty]: Start isEmpty. Operand 1234 states and 3363 transitions. [2025-04-13 18:09:00,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:00,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:00,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 18:09:00,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2025-04-13 18:09:00,836 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 18:09:00,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash 629102995, now seen corresponding path program 279 times [2025-04-13 18:09:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:00,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982826329] [2025-04-13 18:09:00,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:00,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:00,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:00,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:00,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982826329] [2025-04-13 18:09:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982826329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:00,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:00,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:00,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077552825] [2025-04-13 18:09:00,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:00,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:00,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:00,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:00,968 INFO L87 Difference]: Start difference. First operand 1234 states and 3363 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 18:09:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:01,454 INFO L93 Difference]: Finished difference Result 1374 states and 3682 transitions. [2025-04-13 18:09:01,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:01,455 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 18:09:01,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:01,469 INFO L225 Difference]: With dead ends: 1374 [2025-04-13 18:09:01,469 INFO L226 Difference]: Without dead ends: 1310 [2025-04-13 18:09:01,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:01,470 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 251 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:01,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 479 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:01,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-04-13 18:09:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1234. [2025-04-13 18:09:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 2.723438767234388) internal successors, (3358), 1233 states have internal predecessors, (3358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3358 transitions. [2025-04-13 18:09:01,493 INFO L79 Accepts]: Start accepts. Automaton has 1234 states and 3358 transitions. Word has length 56 [2025-04-13 18:09:01,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:01,493 INFO L485 AbstractCegarLoop]: Abstraction has 1234 states and 3358 transitions. [2025-04-13 18:09:01,494 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 18:09:01,494 INFO L278 IsEmpty]: Start isEmpty. Operand 1234 states and 3358 transitions. [2025-04-13 18:09:01,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:01,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:01,495 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:01,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2025-04-13 18:09:01,495 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 18:09:01,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 598285835, now seen corresponding path program 280 times [2025-04-13 18:09:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:01,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891102121] [2025-04-13 18:09:01,495 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:01,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:01,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:01,509 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 18:09:01,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:01,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891102121] [2025-04-13 18:09:01,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891102121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:01,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530657276] [2025-04-13 18:09:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:01,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:01,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:01,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:01,604 INFO L87 Difference]: Start difference. First operand 1234 states and 3358 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 18:09:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:02,087 INFO L93 Difference]: Finished difference Result 1300 states and 3507 transitions. [2025-04-13 18:09:02,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:02,088 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 18:09:02,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:02,105 INFO L225 Difference]: With dead ends: 1300 [2025-04-13 18:09:02,105 INFO L226 Difference]: Without dead ends: 1235 [2025-04-13 18:09:02,106 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 18:09:02,106 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 248 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:02,106 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 475 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-04-13 18:09:02,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1224. [2025-04-13 18:09:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 2.717089125102208) internal successors, (3323), 1223 states have internal predecessors, (3323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3323 transitions. [2025-04-13 18:09:02,133 INFO L79 Accepts]: Start accepts. Automaton has 1224 states and 3323 transitions. Word has length 56 [2025-04-13 18:09:02,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:02,133 INFO L485 AbstractCegarLoop]: Abstraction has 1224 states and 3323 transitions. [2025-04-13 18:09:02,133 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 18:09:02,134 INFO L278 IsEmpty]: Start isEmpty. Operand 1224 states and 3323 transitions. [2025-04-13 18:09:02,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:02,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:02,138 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:02,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2025-04-13 18:09:02,138 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 18:09:02,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1122535503, now seen corresponding path program 281 times [2025-04-13 18:09:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:02,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964632372] [2025-04-13 18:09:02,139 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:02,144 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:02,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:02,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:03,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:03,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964632372] [2025-04-13 18:09:03,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964632372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:03,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429841467] [2025-04-13 18:09:03,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:03,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:03,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:03,082 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 18:09:03,083 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 18:09:03,208 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:03,229 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:03,229 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:03,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:03,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:03,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:03,442 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:03,443 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 18:09:03,450 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 18:09:03,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:03,646 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:03,647 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 18:09:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429841467] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:09:03,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283608454] [2025-04-13 18:09:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:03,673 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:03,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:03,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:03,674 INFO L87 Difference]: Start difference. First operand 1224 states and 3323 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 18:09:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:04,382 INFO L93 Difference]: Finished difference Result 1289 states and 3470 transitions. [2025-04-13 18:09:04,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:04,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 18:09:04,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:04,393 INFO L225 Difference]: With dead ends: 1289 [2025-04-13 18:09:04,393 INFO L226 Difference]: Without dead ends: 1175 [2025-04-13 18:09:04,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=2329, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:04,394 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 205 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:04,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 468 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2025-04-13 18:09:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1164. [2025-04-13 18:09:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 2.7403267411865864) internal successors, (3187), 1163 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 3187 transitions. [2025-04-13 18:09:04,417 INFO L79 Accepts]: Start accepts. Automaton has 1164 states and 3187 transitions. Word has length 56 [2025-04-13 18:09:04,417 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:04,417 INFO L485 AbstractCegarLoop]: Abstraction has 1164 states and 3187 transitions. [2025-04-13 18:09:04,417 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 18:09:04,417 INFO L278 IsEmpty]: Start isEmpty. Operand 1164 states and 3187 transitions. [2025-04-13 18:09:04,419 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:04,419 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:04,419 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:04,426 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 18:09:04,619 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 18:09:04,619 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 18:09:04,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:04,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1553333741, now seen corresponding path program 282 times [2025-04-13 18:09:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:04,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703420378] [2025-04-13 18:09:04,620 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:04,625 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:04,629 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:04,630 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:04,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:04,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 18:09:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:04,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703420378] [2025-04-13 18:09:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703420378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:04,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495823677] [2025-04-13 18:09:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:04,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:04,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:04,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:04,755 INFO L87 Difference]: Start difference. First operand 1164 states and 3187 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 18:09:05,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:05,184 INFO L93 Difference]: Finished difference Result 1359 states and 3677 transitions. [2025-04-13 18:09:05,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:05,185 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 18:09:05,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:05,200 INFO L225 Difference]: With dead ends: 1359 [2025-04-13 18:09:05,200 INFO L226 Difference]: Without dead ends: 1165 [2025-04-13 18:09:05,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:05,201 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 217 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:05,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 538 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-04-13 18:09:05,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1154. [2025-04-13 18:09:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 2.7354726799653077) internal successors, (3154), 1153 states have internal predecessors, (3154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:05,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 3154 transitions. [2025-04-13 18:09:05,229 INFO L79 Accepts]: Start accepts. Automaton has 1154 states and 3154 transitions. Word has length 56 [2025-04-13 18:09:05,229 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:05,229 INFO L485 AbstractCegarLoop]: Abstraction has 1154 states and 3154 transitions. [2025-04-13 18:09:05,229 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 18:09:05,229 INFO L278 IsEmpty]: Start isEmpty. Operand 1154 states and 3154 transitions. [2025-04-13 18:09:05,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:05,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:05,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 18:09:05,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2025-04-13 18:09:05,231 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 18:09:05,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:05,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2033767529, now seen corresponding path program 283 times [2025-04-13 18:09:05,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:05,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324452639] [2025-04-13 18:09:05,231 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:05,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:05,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:05,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:05,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:06,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324452639] [2025-04-13 18:09:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324452639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:06,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137142054] [2025-04-13 18:09:06,173 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:06,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:06,175 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 18:09:06,177 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 18:09:06,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:06,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:06,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:06,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:06,597 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:06,608 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 18:09:06,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 18:09:06,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:06,907 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:06,907 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 18:09:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137142054] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:06,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 18:09:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830408500] [2025-04-13 18:09:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:06,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:06,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:06,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:06,944 INFO L87 Difference]: Start difference. First operand 1154 states and 3154 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 18:09:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:07,666 INFO L93 Difference]: Finished difference Result 1178 states and 3199 transitions. [2025-04-13 18:09:07,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:09:07,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 18:09:07,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:07,678 INFO L225 Difference]: With dead ends: 1178 [2025-04-13 18:09:07,678 INFO L226 Difference]: Without dead ends: 816 [2025-04-13 18:09:07,679 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:07,679 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 215 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:07,679 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 498 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-04-13 18:09:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-04-13 18:09:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 2.7938650306748465) internal successors, (2277), 815 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2277 transitions. [2025-04-13 18:09:07,697 INFO L79 Accepts]: Start accepts. Automaton has 816 states and 2277 transitions. Word has length 56 [2025-04-13 18:09:07,697 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:07,697 INFO L485 AbstractCegarLoop]: Abstraction has 816 states and 2277 transitions. [2025-04-13 18:09:07,697 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 18:09:07,697 INFO L278 IsEmpty]: Start isEmpty. Operand 816 states and 2277 transitions. [2025-04-13 18:09:07,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:07,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:07,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:07,706 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 18:09:07,898 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 18:09:07,898 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 18:09:07,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:07,899 INFO L85 PathProgramCache]: Analyzing trace with hash -987537865, now seen corresponding path program 284 times [2025-04-13 18:09:07,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:07,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697319354] [2025-04-13 18:09:07,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:07,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:07,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:07,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:07,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:08,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 18:09:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:08,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697319354] [2025-04-13 18:09:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697319354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377527508] [2025-04-13 18:09:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:08,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:08,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:08,049 INFO L87 Difference]: Start difference. First operand 816 states and 2277 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 18:09:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:08,578 INFO L93 Difference]: Finished difference Result 980 states and 2690 transitions. [2025-04-13 18:09:08,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:08,578 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 18:09:08,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:08,590 INFO L225 Difference]: With dead ends: 980 [2025-04-13 18:09:08,590 INFO L226 Difference]: Without dead ends: 796 [2025-04-13 18:09:08,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:08,591 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 357 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:08,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 590 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:08,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-04-13 18:09:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-04-13 18:09:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.781132075471698) internal successors, (2211), 795 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2211 transitions. [2025-04-13 18:09:08,606 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2211 transitions. Word has length 56 [2025-04-13 18:09:08,606 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:08,606 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2211 transitions. [2025-04-13 18:09:08,606 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 18:09:08,606 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2211 transitions. [2025-04-13 18:09:08,607 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:08,607 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:08,607 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:08,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2025-04-13 18:09:08,607 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 18:09:08,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1950653161, now seen corresponding path program 285 times [2025-04-13 18:09:08,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:08,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999132180] [2025-04-13 18:09:08,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:08,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:08,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:08,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:08,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:08,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 18:09:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:08,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999132180] [2025-04-13 18:09:08,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999132180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:08,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:08,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:08,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25593543] [2025-04-13 18:09:08,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:08,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:08,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:08,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:08,740 INFO L87 Difference]: Start difference. First operand 796 states and 2211 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 18:09:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:09,286 INFO L93 Difference]: Finished difference Result 1080 states and 2998 transitions. [2025-04-13 18:09:09,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:09,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 18:09:09,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:09,296 INFO L225 Difference]: With dead ends: 1080 [2025-04-13 18:09:09,296 INFO L226 Difference]: Without dead ends: 936 [2025-04-13 18:09:09,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:09,297 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 363 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:09,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 556 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-04-13 18:09:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 850. [2025-04-13 18:09:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 2.7538280329799765) internal successors, (2338), 849 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2338 transitions. [2025-04-13 18:09:09,312 INFO L79 Accepts]: Start accepts. Automaton has 850 states and 2338 transitions. Word has length 56 [2025-04-13 18:09:09,312 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:09,312 INFO L485 AbstractCegarLoop]: Abstraction has 850 states and 2338 transitions. [2025-04-13 18:09:09,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 18:09:09,312 INFO L278 IsEmpty]: Start isEmpty. Operand 850 states and 2338 transitions. [2025-04-13 18:09:09,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:09,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:09,313 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:09,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2025-04-13 18:09:09,313 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 18:09:09,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1747086569, now seen corresponding path program 286 times [2025-04-13 18:09:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:09,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885642840] [2025-04-13 18:09:09,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:09,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:09,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:09,323 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 18:09:09,323 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:09,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:09,414 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885642840] [2025-04-13 18:09:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885642840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:09,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102154126] [2025-04-13 18:09:09,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:09,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:09,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:09,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:09,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:09,414 INFO L87 Difference]: Start difference. First operand 850 states and 2338 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 18:09:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:09,935 INFO L93 Difference]: Finished difference Result 998 states and 2744 transitions. [2025-04-13 18:09:09,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:09,935 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 18:09:09,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:09,944 INFO L225 Difference]: With dead ends: 998 [2025-04-13 18:09:09,944 INFO L226 Difference]: Without dead ends: 939 [2025-04-13 18:09:09,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:09,945 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 321 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:09,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 520 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-04-13 18:09:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 858. [2025-04-13 18:09:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.751458576429405) internal successors, (2358), 857 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2358 transitions. [2025-04-13 18:09:09,959 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2358 transitions. Word has length 56 [2025-04-13 18:09:09,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:09,959 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2358 transitions. [2025-04-13 18:09:09,959 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 18:09:09,959 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2358 transitions. [2025-04-13 18:09:09,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:09,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:09,963 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:09,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2025-04-13 18:09:09,963 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 18:09:09,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 532625541, now seen corresponding path program 287 times [2025-04-13 18:09:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:09,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504313997] [2025-04-13 18:09:09,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:09,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:09,978 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:09,978 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:09,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:10,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504313997] [2025-04-13 18:09:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504313997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:10,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28525451] [2025-04-13 18:09:10,872 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:10,876 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 18:09:10,877 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 18:09:11,007 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:11,029 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:11,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:11,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:11,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:11,248 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:11,249 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 18:09:11,258 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 18:09:11,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:11,438 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:11,439 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 18:09:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28525451] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 29 [2025-04-13 18:09:11,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020252249] [2025-04-13 18:09:11,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:11,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:11,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:11,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:11,472 INFO L87 Difference]: Start difference. First operand 858 states and 2358 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 18:09:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:12,202 INFO L93 Difference]: Finished difference Result 987 states and 2709 transitions. [2025-04-13 18:09:12,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:12,203 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 18:09:12,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:12,211 INFO L225 Difference]: With dead ends: 987 [2025-04-13 18:09:12,211 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 18:09:12,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=2329, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:12,211 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 279 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:12,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 530 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 18:09:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 854. [2025-04-13 18:09:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 2.750293083235639) internal successors, (2346), 853 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2346 transitions. [2025-04-13 18:09:12,224 INFO L79 Accepts]: Start accepts. Automaton has 854 states and 2346 transitions. Word has length 56 [2025-04-13 18:09:12,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:12,224 INFO L485 AbstractCegarLoop]: Abstraction has 854 states and 2346 transitions. [2025-04-13 18:09:12,224 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 18:09:12,224 INFO L278 IsEmpty]: Start isEmpty. Operand 854 states and 2346 transitions. [2025-04-13 18:09:12,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:12,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:12,225 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:12,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-04-13 18:09:12,425 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 18:09:12,425 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 18:09:12,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1711543899, now seen corresponding path program 288 times [2025-04-13 18:09:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:12,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286501168] [2025-04-13 18:09:12,426 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:12,432 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:12,436 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:12,436 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:12,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:12,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 18:09:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:12,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286501168] [2025-04-13 18:09:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286501168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181884670] [2025-04-13 18:09:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:12,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:12,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:12,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:12,545 INFO L87 Difference]: Start difference. First operand 854 states and 2346 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 18:09:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:12,946 INFO L93 Difference]: Finished difference Result 991 states and 2717 transitions. [2025-04-13 18:09:12,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:12,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 18:09:12,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:12,954 INFO L225 Difference]: With dead ends: 991 [2025-04-13 18:09:12,955 INFO L226 Difference]: Without dead ends: 887 [2025-04-13 18:09:12,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:12,955 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 288 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:12,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 530 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-04-13 18:09:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 806. [2025-04-13 18:09:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 2.775155279503106) internal successors, (2234), 805 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2234 transitions. [2025-04-13 18:09:12,968 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2234 transitions. Word has length 56 [2025-04-13 18:09:12,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:12,968 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2234 transitions. [2025-04-13 18:09:12,968 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 18:09:12,968 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2234 transitions. [2025-04-13 18:09:12,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:12,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:12,969 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:12,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2025-04-13 18:09:12,969 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 18:09:12,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1619254821, now seen corresponding path program 289 times [2025-04-13 18:09:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:12,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524619036] [2025-04-13 18:09:12,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:12,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:12,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:13,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524619036] [2025-04-13 18:09:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524619036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:13,741 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131435338] [2025-04-13 18:09:13,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:13,742 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 18:09:13,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 18:09:13,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:13,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:13,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:13,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:13,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:13,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:14,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:14,096 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 18:09:14,102 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 18:09:14,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:14,268 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:14,269 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 18:09:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:14,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131435338] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:14,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:14,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 31 [2025-04-13 18:09:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660489364] [2025-04-13 18:09:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:14,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:14,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:14,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:14,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=920, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:14,294 INFO L87 Difference]: Start difference. First operand 806 states and 2234 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 18:09:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:14,852 INFO L93 Difference]: Finished difference Result 970 states and 2647 transitions. [2025-04-13 18:09:14,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:14,852 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 18:09:14,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:14,861 INFO L225 Difference]: With dead ends: 970 [2025-04-13 18:09:14,861 INFO L226 Difference]: Without dead ends: 786 [2025-04-13 18:09:14,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=2275, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:09:14,862 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 264 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:14,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 590 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-04-13 18:09:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2025-04-13 18:09:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 2.7745222929936304) internal successors, (2178), 785 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2178 transitions. [2025-04-13 18:09:14,873 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2178 transitions. Word has length 56 [2025-04-13 18:09:14,873 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:14,873 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2178 transitions. [2025-04-13 18:09:14,874 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 18:09:14,874 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2178 transitions. [2025-04-13 18:09:14,874 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:14,874 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:14,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 18:09:14,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2025-04-13 18:09:15,075 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 18:09:15,075 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 18:09:15,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -75643943, now seen corresponding path program 290 times [2025-04-13 18:09:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:15,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218956844] [2025-04-13 18:09:15,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:15,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:15,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:15,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:15,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:15,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:15,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218956844] [2025-04-13 18:09:15,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218956844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:15,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:15,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:15,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591988299] [2025-04-13 18:09:15,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:15,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:15,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:15,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:15,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:15,175 INFO L87 Difference]: Start difference. First operand 786 states and 2178 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 18:09:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:15,535 INFO L93 Difference]: Finished difference Result 1007 states and 2806 transitions. [2025-04-13 18:09:15,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:15,536 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 18:09:15,536 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:15,544 INFO L225 Difference]: With dead ends: 1007 [2025-04-13 18:09:15,544 INFO L226 Difference]: Without dead ends: 929 [2025-04-13 18:09:15,545 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=943, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:15,545 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 263 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:15,545 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 415 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-04-13 18:09:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 796. [2025-04-13 18:09:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.781132075471698) internal successors, (2211), 795 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2211 transitions. [2025-04-13 18:09:15,558 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2211 transitions. Word has length 56 [2025-04-13 18:09:15,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:15,558 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2211 transitions. [2025-04-13 18:09:15,558 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 18:09:15,558 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2211 transitions. [2025-04-13 18:09:15,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:15,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:15,559 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:15,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2025-04-13 18:09:15,559 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 18:09:15,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1058089555, now seen corresponding path program 291 times [2025-04-13 18:09:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:15,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419547984] [2025-04-13 18:09:15,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:15,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:15,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:15,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:15,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:15,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 18:09:15,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:15,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419547984] [2025-04-13 18:09:15,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419547984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:15,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:15,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:15,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81488014] [2025-04-13 18:09:15,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:15,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:15,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:15,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:15,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:15,675 INFO L87 Difference]: Start difference. First operand 796 states and 2211 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 18:09:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:16,038 INFO L93 Difference]: Finished difference Result 1122 states and 3123 transitions. [2025-04-13 18:09:16,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:16,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 18:09:16,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:16,047 INFO L225 Difference]: With dead ends: 1122 [2025-04-13 18:09:16,047 INFO L226 Difference]: Without dead ends: 978 [2025-04-13 18:09:16,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:16,047 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 318 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:16,047 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 477 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-04-13 18:09:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 884. [2025-04-13 18:09:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.766704416761042) internal successors, (2443), 883 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2443 transitions. [2025-04-13 18:09:16,060 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 2443 transitions. Word has length 56 [2025-04-13 18:09:16,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:16,060 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 2443 transitions. [2025-04-13 18:09:16,060 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 18:09:16,061 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 2443 transitions. [2025-04-13 18:09:16,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:16,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:16,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 18:09:16,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2025-04-13 18:09:16,062 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 18:09:16,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:16,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1513283685, now seen corresponding path program 292 times [2025-04-13 18:09:16,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:16,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212587026] [2025-04-13 18:09:16,062 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:16,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:16,067 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:16,069 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 18:09:16,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:16,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:16,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:16,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212587026] [2025-04-13 18:09:16,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212587026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:16,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124872744] [2025-04-13 18:09:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:16,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:16,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:16,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:16,150 INFO L87 Difference]: Start difference. First operand 884 states and 2443 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 18:09:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:16,498 INFO L93 Difference]: Finished difference Result 1059 states and 2920 transitions. [2025-04-13 18:09:16,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:09:16,498 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 18:09:16,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:16,508 INFO L225 Difference]: With dead ends: 1059 [2025-04-13 18:09:16,508 INFO L226 Difference]: Without dead ends: 1000 [2025-04-13 18:09:16,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:16,508 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 232 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:16,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 430 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:16,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-04-13 18:09:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 896. [2025-04-13 18:09:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 2.7608938547486033) internal successors, (2471), 895 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2471 transitions. [2025-04-13 18:09:16,522 INFO L79 Accepts]: Start accepts. Automaton has 896 states and 2471 transitions. Word has length 56 [2025-04-13 18:09:16,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:16,522 INFO L485 AbstractCegarLoop]: Abstraction has 896 states and 2471 transitions. [2025-04-13 18:09:16,522 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 18:09:16,522 INFO L278 IsEmpty]: Start isEmpty. Operand 896 states and 2471 transitions. [2025-04-13 18:09:16,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:16,523 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:16,523 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2025-04-13 18:09:16,523 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 18:09:16,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 932855185, now seen corresponding path program 293 times [2025-04-13 18:09:16,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:16,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556732514] [2025-04-13 18:09:16,523 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:16,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:16,528 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:16,535 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:16,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:17,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556732514] [2025-04-13 18:09:17,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556732514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:17,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691675099] [2025-04-13 18:09:17,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:17,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:17,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:17,066 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 18:09:17,067 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 18:09:17,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:17,203 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:17,203 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:17,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:17,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:17,373 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:17,373 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 18:09:17,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 18:09:17,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:17,526 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:17,526 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 18:09:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691675099] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:09:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012618371] [2025-04-13 18:09:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:17,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:17,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:17,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:17,553 INFO L87 Difference]: Start difference. First operand 896 states and 2471 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 18:09:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:18,234 INFO L93 Difference]: Finished difference Result 1068 states and 2949 transitions. [2025-04-13 18:09:18,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:18,235 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 18:09:18,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:18,243 INFO L225 Difference]: With dead ends: 1068 [2025-04-13 18:09:18,243 INFO L226 Difference]: Without dead ends: 1009 [2025-04-13 18:09:18,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=2523, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:09:18,244 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 308 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:18,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 487 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:18,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-04-13 18:09:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 900. [2025-04-13 18:09:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.7619577308120133) internal successors, (2483), 899 states have internal predecessors, (2483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2483 transitions. [2025-04-13 18:09:18,257 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 2483 transitions. Word has length 56 [2025-04-13 18:09:18,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:18,257 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 2483 transitions. [2025-04-13 18:09:18,257 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 18:09:18,257 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 2483 transitions. [2025-04-13 18:09:18,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:18,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:18,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 18:09:18,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2025-04-13 18:09:18,459 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 18:09:18,459 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 18:09:18,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2006072359, now seen corresponding path program 294 times [2025-04-13 18:09:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:18,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159449599] [2025-04-13 18:09:18,459 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:18,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:18,464 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:18,468 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:18,468 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:18,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:18,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159449599] [2025-04-13 18:09:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159449599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:18,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:18,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227160865] [2025-04-13 18:09:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:18,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:18,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:18,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:18,558 INFO L87 Difference]: Start difference. First operand 900 states and 2483 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 18:09:18,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:18,885 INFO L93 Difference]: Finished difference Result 1033 states and 2842 transitions. [2025-04-13 18:09:18,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:18,885 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 18:09:18,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:18,894 INFO L225 Difference]: With dead ends: 1033 [2025-04-13 18:09:18,894 INFO L226 Difference]: Without dead ends: 977 [2025-04-13 18:09:18,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:18,894 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 204 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:18,894 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 426 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-04-13 18:09:18,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 896. [2025-04-13 18:09:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 2.7608938547486033) internal successors, (2471), 895 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 2471 transitions. [2025-04-13 18:09:18,907 INFO L79 Accepts]: Start accepts. Automaton has 896 states and 2471 transitions. Word has length 56 [2025-04-13 18:09:18,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:18,907 INFO L485 AbstractCegarLoop]: Abstraction has 896 states and 2471 transitions. [2025-04-13 18:09:18,907 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 18:09:18,907 INFO L278 IsEmpty]: Start isEmpty. Operand 896 states and 2471 transitions. [2025-04-13 18:09:18,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:18,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:18,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 18:09:18,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2025-04-13 18:09:18,908 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 18:09:18,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:18,908 INFO L85 PathProgramCache]: Analyzing trace with hash -359938065, now seen corresponding path program 295 times [2025-04-13 18:09:18,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:18,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578901242] [2025-04-13 18:09:18,909 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:18,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:18,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:18,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:18,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:18,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:19,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:19,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578901242] [2025-04-13 18:09:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578901242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:19,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150047385] [2025-04-13 18:09:19,655 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:19,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:19,657 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 18:09:19,658 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 18:09:19,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:19,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:19,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:19,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:19,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:19,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:19,960 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:19,960 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 18:09:20,004 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 18:09:20,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:20,156 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:20,157 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 18:09:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:20,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150047385] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:20,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:20,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:09:20,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782435110] [2025-04-13 18:09:20,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:20,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:20,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:20,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:20,182 INFO L87 Difference]: Start difference. First operand 896 states and 2471 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 18:09:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:20,829 INFO L93 Difference]: Finished difference Result 1049 states and 2894 transitions. [2025-04-13 18:09:20,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:20,829 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 18:09:20,829 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:20,842 INFO L225 Difference]: With dead ends: 1049 [2025-04-13 18:09:20,842 INFO L226 Difference]: Without dead ends: 997 [2025-04-13 18:09:20,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=2723, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:09:20,843 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 274 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:20,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 484 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-04-13 18:09:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 892. [2025-04-13 18:09:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.759820426487093) internal successors, (2459), 891 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2459 transitions. [2025-04-13 18:09:20,858 INFO L79 Accepts]: Start accepts. Automaton has 892 states and 2459 transitions. Word has length 56 [2025-04-13 18:09:20,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:20,858 INFO L485 AbstractCegarLoop]: Abstraction has 892 states and 2459 transitions. [2025-04-13 18:09:20,859 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 18:09:20,859 INFO L278 IsEmpty]: Start isEmpty. Operand 892 states and 2459 transitions. [2025-04-13 18:09:20,859 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:20,859 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:20,859 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:20,866 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 18:09:21,060 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 18:09:21,060 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 18:09:21,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1204408649, now seen corresponding path program 296 times [2025-04-13 18:09:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:21,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133784331] [2025-04-13 18:09:21,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:21,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:21,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:21,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:21,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:21,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:21,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133784331] [2025-04-13 18:09:21,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133784331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:21,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:21,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:21,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124580791] [2025-04-13 18:09:21,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:21,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:21,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:21,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:21,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:21,159 INFO L87 Difference]: Start difference. First operand 892 states and 2459 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 18:09:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:21,515 INFO L93 Difference]: Finished difference Result 1067 states and 2940 transitions. [2025-04-13 18:09:21,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:09:21,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 18:09:21,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:21,528 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 18:09:21,528 INFO L226 Difference]: Without dead ends: 1008 [2025-04-13 18:09:21,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:21,529 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 257 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:21,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 423 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-04-13 18:09:21,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 900. [2025-04-13 18:09:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.757508342602892) internal successors, (2479), 899 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2479 transitions. [2025-04-13 18:09:21,548 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 2479 transitions. Word has length 56 [2025-04-13 18:09:21,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:21,548 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 2479 transitions. [2025-04-13 18:09:21,548 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 18:09:21,548 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 2479 transitions. [2025-04-13 18:09:21,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:21,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:21,549 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:21,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2025-04-13 18:09:21,549 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 18:09:21,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash -703486219, now seen corresponding path program 297 times [2025-04-13 18:09:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:21,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189975698] [2025-04-13 18:09:21,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:21,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:21,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:21,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:21,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:21,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189975698] [2025-04-13 18:09:21,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189975698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:21,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:21,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:21,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677644266] [2025-04-13 18:09:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:21,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:21,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:21,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:21,653 INFO L87 Difference]: Start difference. First operand 900 states and 2479 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 18:09:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:21,979 INFO L93 Difference]: Finished difference Result 1026 states and 2823 transitions. [2025-04-13 18:09:21,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:21,980 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 18:09:21,980 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:21,988 INFO L225 Difference]: With dead ends: 1026 [2025-04-13 18:09:21,988 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:09:21,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:21,989 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 237 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:21,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 454 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:09:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 852. [2025-04-13 18:09:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 2.7414806110458283) internal successors, (2333), 851 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2333 transitions. [2025-04-13 18:09:22,001 INFO L79 Accepts]: Start accepts. Automaton has 852 states and 2333 transitions. Word has length 56 [2025-04-13 18:09:22,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:22,001 INFO L485 AbstractCegarLoop]: Abstraction has 852 states and 2333 transitions. [2025-04-13 18:09:22,001 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 18:09:22,002 INFO L278 IsEmpty]: Start isEmpty. Operand 852 states and 2333 transitions. [2025-04-13 18:09:22,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:22,002 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:22,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2025-04-13 18:09:22,003 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 18:09:22,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1697197323, now seen corresponding path program 298 times [2025-04-13 18:09:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:22,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623625340] [2025-04-13 18:09:22,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:22,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:22,010 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 18:09:22,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:22,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:22,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623625340] [2025-04-13 18:09:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623625340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:22,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:22,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:22,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634221383] [2025-04-13 18:09:22,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:22,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:22,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:22,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:22,090 INFO L87 Difference]: Start difference. First operand 852 states and 2333 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 18:09:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:22,416 INFO L93 Difference]: Finished difference Result 1008 states and 2759 transitions. [2025-04-13 18:09:22,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:22,416 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 18:09:22,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:22,425 INFO L225 Difference]: With dead ends: 1008 [2025-04-13 18:09:22,425 INFO L226 Difference]: Without dead ends: 956 [2025-04-13 18:09:22,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:22,425 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 216 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:22,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 429 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:22,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-04-13 18:09:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 848. [2025-04-13 18:09:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 2.74025974025974) internal successors, (2321), 847 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 2321 transitions. [2025-04-13 18:09:22,439 INFO L79 Accepts]: Start accepts. Automaton has 848 states and 2321 transitions. Word has length 56 [2025-04-13 18:09:22,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:22,439 INFO L485 AbstractCegarLoop]: Abstraction has 848 states and 2321 transitions. [2025-04-13 18:09:22,439 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 18:09:22,439 INFO L278 IsEmpty]: Start isEmpty. Operand 848 states and 2321 transitions. [2025-04-13 18:09:22,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:22,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:22,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 18:09:22,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2025-04-13 18:09:22,440 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 18:09:22,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:22,440 INFO L85 PathProgramCache]: Analyzing trace with hash 885789483, now seen corresponding path program 299 times [2025-04-13 18:09:22,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:22,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706840015] [2025-04-13 18:09:22,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:22,445 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:22,452 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:22,452 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:22,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:23,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706840015] [2025-04-13 18:09:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706840015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:23,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065871001] [2025-04-13 18:09:23,115 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:23,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:23,117 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 18:09:23,118 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 18:09:23,238 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:23,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:23,257 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:23,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:23,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:09:23,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:23,432 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:23,432 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 18:09:23,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 18:09:23,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:09:23,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065871001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:23,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:09:23,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:09:23,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854049527] [2025-04-13 18:09:23,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:23,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:23,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:23,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:23,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:09:23,438 INFO L87 Difference]: Start difference. First operand 848 states and 2321 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 18:09:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:24,136 INFO L93 Difference]: Finished difference Result 985 states and 2692 transitions. [2025-04-13 18:09:24,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:24,137 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 18:09:24,137 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:24,145 INFO L225 Difference]: With dead ends: 985 [2025-04-13 18:09:24,145 INFO L226 Difference]: Without dead ends: 877 [2025-04-13 18:09:24,146 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:09:24,146 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 249 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:24,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 465 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-04-13 18:09:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 796. [2025-04-13 18:09:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.768553459119497) internal successors, (2201), 795 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2201 transitions. [2025-04-13 18:09:24,158 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2201 transitions. Word has length 56 [2025-04-13 18:09:24,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:24,158 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2201 transitions. [2025-04-13 18:09:24,158 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 18:09:24,158 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2201 transitions. [2025-04-13 18:09:24,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:24,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:24,159 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:24,166 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 18:09:24,359 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 18:09:24,359 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 18:09:24,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:24,360 INFO L85 PathProgramCache]: Analyzing trace with hash 358818325, now seen corresponding path program 300 times [2025-04-13 18:09:24,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:24,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429098967] [2025-04-13 18:09:24,360 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:24,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:24,365 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:24,369 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:24,369 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:24,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:24,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429098967] [2025-04-13 18:09:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429098967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984474655] [2025-04-13 18:09:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:24,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:24,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:24,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:24,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:24,469 INFO L87 Difference]: Start difference. First operand 796 states and 2201 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 18:09:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:24,832 INFO L93 Difference]: Finished difference Result 998 states and 2778 transitions. [2025-04-13 18:09:24,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:24,832 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 18:09:24,832 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:24,841 INFO L225 Difference]: With dead ends: 998 [2025-04-13 18:09:24,841 INFO L226 Difference]: Without dead ends: 939 [2025-04-13 18:09:24,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:24,841 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 256 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:24,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 525 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-04-13 18:09:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 858. [2025-04-13 18:09:24,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.791131855309218) internal successors, (2392), 857 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2392 transitions. [2025-04-13 18:09:24,854 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2392 transitions. Word has length 56 [2025-04-13 18:09:24,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:24,854 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2392 transitions. [2025-04-13 18:09:24,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 18:09:24,854 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2392 transitions. [2025-04-13 18:09:24,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:24,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:24,855 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:24,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2025-04-13 18:09:24,855 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 18:09:24,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 516634391, now seen corresponding path program 301 times [2025-04-13 18:09:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:24,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127706227] [2025-04-13 18:09:24,855 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:24,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:24,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:24,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:24,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:25,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127706227] [2025-04-13 18:09:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127706227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:25,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309215480] [2025-04-13 18:09:25,531 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:25,533 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 18:09:25,534 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 18:09:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:25,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:25,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:25,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:25,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:25,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:25,872 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:25,872 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 18:09:25,877 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 18:09:25,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:26,054 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:26,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 18:09:26,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 18:09:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309215480] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:26,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:26,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:09:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973046197] [2025-04-13 18:09:26,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:26,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:26,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:26,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:26,080 INFO L87 Difference]: Start difference. First operand 858 states and 2392 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 18:09:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:26,621 INFO L93 Difference]: Finished difference Result 1080 states and 2984 transitions. [2025-04-13 18:09:26,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:26,622 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 18:09:26,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:26,630 INFO L225 Difference]: With dead ends: 1080 [2025-04-13 18:09:26,631 INFO L226 Difference]: Without dead ends: 936 [2025-04-13 18:09:26,631 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=2272, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:09:26,631 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 251 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:26,631 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 560 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-04-13 18:09:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 858. [2025-04-13 18:09:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.7397899649941655) internal successors, (2348), 857 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 18:09:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2348 transitions. [2025-04-13 18:09:26,644 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2348 transitions. Word has length 56 [2025-04-13 18:09:26,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:26,644 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2348 transitions. [2025-04-13 18:09:26,644 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 18:09:26,644 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2348 transitions. [2025-04-13 18:09:26,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:26,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:26,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 18:09:26,651 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 18:09:26,845 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 18:09:26,846 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 18:09:26,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -133970349, now seen corresponding path program 302 times [2025-04-13 18:09:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:26,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342180086] [2025-04-13 18:09:26,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:26,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:26,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:26,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:26,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:26,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342180086] [2025-04-13 18:09:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342180086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:26,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:26,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:26,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870141169] [2025-04-13 18:09:26,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:26,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:26,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:26,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:26,953 INFO L87 Difference]: Start difference. First operand 858 states and 2348 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 18:09:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:27,294 INFO L93 Difference]: Finished difference Result 987 states and 2699 transitions. [2025-04-13 18:09:27,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:27,295 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 18:09:27,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:27,304 INFO L225 Difference]: With dead ends: 987 [2025-04-13 18:09:27,304 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 18:09:27,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:27,304 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 235 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:27,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 524 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 18:09:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 854. [2025-04-13 18:09:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 2.738569753810082) internal successors, (2336), 853 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2336 transitions. [2025-04-13 18:09:27,317 INFO L79 Accepts]: Start accepts. Automaton has 854 states and 2336 transitions. Word has length 56 [2025-04-13 18:09:27,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:27,317 INFO L485 AbstractCegarLoop]: Abstraction has 854 states and 2336 transitions. [2025-04-13 18:09:27,317 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 18:09:27,317 INFO L278 IsEmpty]: Start isEmpty. Operand 854 states and 2336 transitions. [2025-04-13 18:09:27,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:27,318 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:27,318 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:27,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2025-04-13 18:09:27,318 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 18:09:27,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1244941383, now seen corresponding path program 303 times [2025-04-13 18:09:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:27,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236048736] [2025-04-13 18:09:27,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:27,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:27,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:27,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:27,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:27,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 18:09:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:27,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236048736] [2025-04-13 18:09:27,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236048736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:27,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:27,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:27,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245241668] [2025-04-13 18:09:27,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:27,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:27,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:27,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:27,429 INFO L87 Difference]: Start difference. First operand 854 states and 2336 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 18:09:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:27,779 INFO L93 Difference]: Finished difference Result 991 states and 2707 transitions. [2025-04-13 18:09:27,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:27,779 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 18:09:27,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:27,788 INFO L225 Difference]: With dead ends: 991 [2025-04-13 18:09:27,788 INFO L226 Difference]: Without dead ends: 887 [2025-04-13 18:09:27,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:27,788 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 237 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:27,788 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 523 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-04-13 18:09:27,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 806. [2025-04-13 18:09:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 2.7627329192546584) internal successors, (2224), 805 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2224 transitions. [2025-04-13 18:09:27,800 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2224 transitions. Word has length 56 [2025-04-13 18:09:27,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:27,800 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2224 transitions. [2025-04-13 18:09:27,800 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 18:09:27,800 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2224 transitions. [2025-04-13 18:09:27,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:27,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:27,801 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:27,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2025-04-13 18:09:27,801 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 18:09:27,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:27,802 INFO L85 PathProgramCache]: Analyzing trace with hash -47777413, now seen corresponding path program 304 times [2025-04-13 18:09:27,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:27,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236805432] [2025-04-13 18:09:27,802 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:27,806 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:27,809 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 18:09:27,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:27,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:27,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236805432] [2025-04-13 18:09:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236805432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139775852] [2025-04-13 18:09:27,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:27,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:27,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:27,883 INFO L87 Difference]: Start difference. First operand 806 states and 2224 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 18:09:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:28,186 INFO L93 Difference]: Finished difference Result 970 states and 2637 transitions. [2025-04-13 18:09:28,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:09:28,186 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 18:09:28,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:28,195 INFO L225 Difference]: With dead ends: 970 [2025-04-13 18:09:28,195 INFO L226 Difference]: Without dead ends: 776 [2025-04-13 18:09:28,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:09:28,196 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 222 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:28,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 538 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:28,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-04-13 18:09:28,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2025-04-13 18:09:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 2.767741935483871) internal successors, (2145), 775 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2145 transitions. [2025-04-13 18:09:28,209 INFO L79 Accepts]: Start accepts. Automaton has 776 states and 2145 transitions. Word has length 56 [2025-04-13 18:09:28,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:28,209 INFO L485 AbstractCegarLoop]: Abstraction has 776 states and 2145 transitions. [2025-04-13 18:09:28,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 18:09:28,209 INFO L278 IsEmpty]: Start isEmpty. Operand 776 states and 2145 transitions. [2025-04-13 18:09:28,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:28,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:28,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 18:09:28,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2025-04-13 18:09:28,210 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 18:09:28,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:28,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1400258379, now seen corresponding path program 305 times [2025-04-13 18:09:28,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:28,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233047922] [2025-04-13 18:09:28,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:28,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:28,215 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:28,223 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:28,223 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:28,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:28,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:28,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233047922] [2025-04-13 18:09:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233047922] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:28,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509254977] [2025-04-13 18:09:28,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:28,776 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 18:09:28,777 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 18:09:28,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:28,914 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:28,915 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:28,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:28,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:28,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:29,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:29,116 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 18:09:29,121 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 18:09:29,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:29,306 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:29,306 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 18:09:29,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 18:09:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509254977] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:09:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84792961] [2025-04-13 18:09:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:29,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:29,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:29,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:29,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:29,329 INFO L87 Difference]: Start difference. First operand 776 states and 2145 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 18:09:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:29,887 INFO L93 Difference]: Finished difference Result 1164 states and 3256 transitions. [2025-04-13 18:09:29,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:29,888 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 18:09:29,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:29,896 INFO L225 Difference]: With dead ends: 1164 [2025-04-13 18:09:29,896 INFO L226 Difference]: Without dead ends: 1020 [2025-04-13 18:09:29,897 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=213, Invalid=2439, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:09:29,897 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 278 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:29,897 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 493 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2025-04-13 18:09:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 918. [2025-04-13 18:09:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 2.7786259541984735) internal successors, (2548), 917 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2548 transitions. [2025-04-13 18:09:29,911 INFO L79 Accepts]: Start accepts. Automaton has 918 states and 2548 transitions. Word has length 56 [2025-04-13 18:09:29,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:29,911 INFO L485 AbstractCegarLoop]: Abstraction has 918 states and 2548 transitions. [2025-04-13 18:09:29,911 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 18:09:29,911 INFO L278 IsEmpty]: Start isEmpty. Operand 918 states and 2548 transitions. [2025-04-13 18:09:29,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:29,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:29,912 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:29,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2025-04-13 18:09:30,112 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 18:09:30,112 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 18:09:30,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1053781545, now seen corresponding path program 306 times [2025-04-13 18:09:30,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:30,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489478762] [2025-04-13 18:09:30,113 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:30,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:30,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:30,122 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:30,122 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:30,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:30,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 18:09:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:30,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489478762] [2025-04-13 18:09:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489478762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134098292] [2025-04-13 18:09:30,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:30,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:30,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:30,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:30,219 INFO L87 Difference]: Start difference. First operand 918 states and 2548 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 18:09:30,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:30,621 INFO L93 Difference]: Finished difference Result 1120 states and 3104 transitions. [2025-04-13 18:09:30,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:09:30,621 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 18:09:30,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:30,630 INFO L225 Difference]: With dead ends: 1120 [2025-04-13 18:09:30,630 INFO L226 Difference]: Without dead ends: 1023 [2025-04-13 18:09:30,630 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:09:30,630 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 325 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:30,630 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 436 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-04-13 18:09:30,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 926. [2025-04-13 18:09:30,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 2.7762162162162163) internal successors, (2568), 925 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2568 transitions. [2025-04-13 18:09:30,644 INFO L79 Accepts]: Start accepts. Automaton has 926 states and 2568 transitions. Word has length 56 [2025-04-13 18:09:30,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:30,644 INFO L485 AbstractCegarLoop]: Abstraction has 926 states and 2568 transitions. [2025-04-13 18:09:30,644 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 18:09:30,644 INFO L278 IsEmpty]: Start isEmpty. Operand 926 states and 2568 transitions. [2025-04-13 18:09:30,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:30,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:30,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 18:09:30,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2025-04-13 18:09:30,645 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 18:09:30,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1275024009, now seen corresponding path program 307 times [2025-04-13 18:09:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:30,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726993455] [2025-04-13 18:09:30,646 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:30,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:30,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:30,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:31,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:31,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:31,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726993455] [2025-04-13 18:09:31,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726993455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:31,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844225555] [2025-04-13 18:09:31,343 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:31,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:31,344 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 18:09:31,345 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 18:09:31,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:31,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:31,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:31,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:31,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:31,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:31,672 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:31,672 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 18:09:31,679 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 18:09:31,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:31,829 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:31,829 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 18:09:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844225555] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:09:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721258897] [2025-04-13 18:09:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:31,856 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:31,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:31,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:31,856 INFO L87 Difference]: Start difference. First operand 926 states and 2568 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 18:09:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:32,414 INFO L93 Difference]: Finished difference Result 1106 states and 3066 transitions. [2025-04-13 18:09:32,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:32,414 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 18:09:32,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:32,424 INFO L225 Difference]: With dead ends: 1106 [2025-04-13 18:09:32,424 INFO L226 Difference]: Without dead ends: 1047 [2025-04-13 18:09:32,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:32,425 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 271 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:32,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 435 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:32,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-04-13 18:09:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 934. [2025-04-13 18:09:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 2.7738478027867095) internal successors, (2588), 933 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2588 transitions. [2025-04-13 18:09:32,439 INFO L79 Accepts]: Start accepts. Automaton has 934 states and 2588 transitions. Word has length 56 [2025-04-13 18:09:32,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:32,439 INFO L485 AbstractCegarLoop]: Abstraction has 934 states and 2588 transitions. [2025-04-13 18:09:32,439 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 18:09:32,439 INFO L278 IsEmpty]: Start isEmpty. Operand 934 states and 2588 transitions. [2025-04-13 18:09:32,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:32,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 18:09:32,447 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 18:09:32,640 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 18:09:32,641 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 18:09:32,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1739647111, now seen corresponding path program 308 times [2025-04-13 18:09:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:32,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633927496] [2025-04-13 18:09:32,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:32,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:32,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:32,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:32,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633927496] [2025-04-13 18:09:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633927496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553207416] [2025-04-13 18:09:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:32,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:32,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:32,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:32,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:32,747 INFO L87 Difference]: Start difference. First operand 934 states and 2588 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 18:09:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:33,125 INFO L93 Difference]: Finished difference Result 1117 states and 3089 transitions. [2025-04-13 18:09:33,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:09:33,125 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 18:09:33,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:33,135 INFO L225 Difference]: With dead ends: 1117 [2025-04-13 18:09:33,135 INFO L226 Difference]: Without dead ends: 1058 [2025-04-13 18:09:33,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:09:33,136 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 237 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:33,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 447 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2025-04-13 18:09:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 942. [2025-04-13 18:09:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 2.771519659936238) internal successors, (2608), 941 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2608 transitions. [2025-04-13 18:09:33,151 INFO L79 Accepts]: Start accepts. Automaton has 942 states and 2608 transitions. Word has length 56 [2025-04-13 18:09:33,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:33,151 INFO L485 AbstractCegarLoop]: Abstraction has 942 states and 2608 transitions. [2025-04-13 18:09:33,151 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 18:09:33,151 INFO L278 IsEmpty]: Start isEmpty. Operand 942 states and 2608 transitions. [2025-04-13 18:09:33,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:33,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:33,152 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:33,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2025-04-13 18:09:33,152 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 18:09:33,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:33,152 INFO L85 PathProgramCache]: Analyzing trace with hash -17769241, now seen corresponding path program 309 times [2025-04-13 18:09:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:33,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590412697] [2025-04-13 18:09:33,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:33,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:33,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:33,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:33,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:33,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:33,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:33,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:33,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590412697] [2025-04-13 18:09:33,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590412697] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:33,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:33,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:33,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957286331] [2025-04-13 18:09:33,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:33,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:33,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:33,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:33,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:33,254 INFO L87 Difference]: Start difference. First operand 942 states and 2608 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 18:09:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:33,582 INFO L93 Difference]: Finished difference Result 1099 states and 3039 transitions. [2025-04-13 18:09:33,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:33,582 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 18:09:33,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:33,592 INFO L225 Difference]: With dead ends: 1099 [2025-04-13 18:09:33,592 INFO L226 Difference]: Without dead ends: 1047 [2025-04-13 18:09:33,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:33,592 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 254 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:33,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 422 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2025-04-13 18:09:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 942. [2025-04-13 18:09:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 2.767268862911796) internal successors, (2604), 941 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2604 transitions. [2025-04-13 18:09:33,607 INFO L79 Accepts]: Start accepts. Automaton has 942 states and 2604 transitions. Word has length 56 [2025-04-13 18:09:33,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:33,607 INFO L485 AbstractCegarLoop]: Abstraction has 942 states and 2604 transitions. [2025-04-13 18:09:33,607 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 18:09:33,607 INFO L278 IsEmpty]: Start isEmpty. Operand 942 states and 2604 transitions. [2025-04-13 18:09:33,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:33,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:33,608 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:33,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2025-04-13 18:09:33,608 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 18:09:33,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2062531511, now seen corresponding path program 310 times [2025-04-13 18:09:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:33,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405483664] [2025-04-13 18:09:33,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:33,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:33,616 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 18:09:33,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:33,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:33,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 18:09:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:33,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405483664] [2025-04-13 18:09:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405483664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807994892] [2025-04-13 18:09:33,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:33,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:33,694 INFO L87 Difference]: Start difference. First operand 942 states and 2604 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 18:09:34,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:34,055 INFO L93 Difference]: Finished difference Result 1079 states and 2979 transitions. [2025-04-13 18:09:34,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:34,055 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 18:09:34,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:34,064 INFO L225 Difference]: With dead ends: 1079 [2025-04-13 18:09:34,064 INFO L226 Difference]: Without dead ends: 1019 [2025-04-13 18:09:34,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:34,064 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 224 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:34,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 443 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-04-13 18:09:34,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 930. [2025-04-13 18:09:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 2.7685683530678147) internal successors, (2572), 929 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 2572 transitions. [2025-04-13 18:09:34,078 INFO L79 Accepts]: Start accepts. Automaton has 930 states and 2572 transitions. Word has length 56 [2025-04-13 18:09:34,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:34,078 INFO L485 AbstractCegarLoop]: Abstraction has 930 states and 2572 transitions. [2025-04-13 18:09:34,078 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 18:09:34,078 INFO L278 IsEmpty]: Start isEmpty. Operand 930 states and 2572 transitions. [2025-04-13 18:09:34,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:34,079 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:34,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2025-04-13 18:09:34,079 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 18:09:34,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -361317395, now seen corresponding path program 311 times [2025-04-13 18:09:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:34,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541523275] [2025-04-13 18:09:34,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:34,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:34,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:34,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:34,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:35,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:35,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541523275] [2025-04-13 18:09:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541523275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:35,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117030463] [2025-04-13 18:09:35,045 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:35,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:35,047 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 18:09:35,047 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 18:09:35,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:35,186 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:35,186 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:35,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:35,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 18:09:35,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:35,402 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:35,403 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 18:09:35,425 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 18:09:35,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:35,610 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:35,610 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 18:09:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117030463] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:09:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264176796] [2025-04-13 18:09:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:35,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:35,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:35,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:35,636 INFO L87 Difference]: Start difference. First operand 930 states and 2572 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 18:09:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:36,219 INFO L93 Difference]: Finished difference Result 1064 states and 2940 transitions. [2025-04-13 18:09:36,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:36,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 18:09:36,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:36,229 INFO L225 Difference]: With dead ends: 1064 [2025-04-13 18:09:36,229 INFO L226 Difference]: Without dead ends: 960 [2025-04-13 18:09:36,229 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=2728, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:09:36,229 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 262 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:36,229 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 444 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-04-13 18:09:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 882. [2025-04-13 18:09:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 2.753688989784336) internal successors, (2426), 881 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2426 transitions. [2025-04-13 18:09:36,243 INFO L79 Accepts]: Start accepts. Automaton has 882 states and 2426 transitions. Word has length 56 [2025-04-13 18:09:36,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:36,243 INFO L485 AbstractCegarLoop]: Abstraction has 882 states and 2426 transitions. [2025-04-13 18:09:36,243 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 18:09:36,243 INFO L278 IsEmpty]: Start isEmpty. Operand 882 states and 2426 transitions. [2025-04-13 18:09:36,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:36,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:36,244 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:36,251 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 18:09:36,444 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 18:09:36,444 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 18:09:36,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash -23094825, now seen corresponding path program 312 times [2025-04-13 18:09:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:36,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690618788] [2025-04-13 18:09:36,445 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:36,449 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:36,454 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:36,454 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:36,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690618788] [2025-04-13 18:09:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690618788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:36,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:36,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:36,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298996789] [2025-04-13 18:09:36,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:36,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:36,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:36,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:36,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:36,548 INFO L87 Difference]: Start difference. First operand 882 states and 2426 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 18:09:36,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:36,921 INFO L93 Difference]: Finished difference Result 1057 states and 2907 transitions. [2025-04-13 18:09:36,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:09:36,921 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 18:09:36,921 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:36,931 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 18:09:36,931 INFO L226 Difference]: Without dead ends: 998 [2025-04-13 18:09:36,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=1207, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:09:36,931 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 266 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:36,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 439 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-04-13 18:09:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 890. [2025-04-13 18:09:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 2.75140607424072) internal successors, (2446), 889 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 2446 transitions. [2025-04-13 18:09:36,945 INFO L79 Accepts]: Start accepts. Automaton has 890 states and 2446 transitions. Word has length 56 [2025-04-13 18:09:36,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:36,945 INFO L485 AbstractCegarLoop]: Abstraction has 890 states and 2446 transitions. [2025-04-13 18:09:36,945 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 18:09:36,945 INFO L278 IsEmpty]: Start isEmpty. Operand 890 states and 2446 transitions. [2025-04-13 18:09:36,946 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:36,946 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:36,946 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:36,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2025-04-13 18:09:36,946 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 18:09:36,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1571506461, now seen corresponding path program 313 times [2025-04-13 18:09:36,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:36,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097963801] [2025-04-13 18:09:36,946 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:36,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:36,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:36,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:36,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:36,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:37,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097963801] [2025-04-13 18:09:37,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097963801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:37,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454068738] [2025-04-13 18:09:37,691 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:37,693 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 18:09:37,694 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 18:09:37,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:37,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:37,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:37,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:37,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:37,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:38,019 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:38,020 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 18:09:38,054 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 18:09:38,054 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:38,204 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:38,204 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 18:09:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:38,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454068738] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:38,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:38,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:09:38,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191888030] [2025-04-13 18:09:38,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:38,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:38,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:38,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:38,234 INFO L87 Difference]: Start difference. First operand 890 states and 2446 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 18:09:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:38,802 INFO L93 Difference]: Finished difference Result 1039 states and 2849 transitions. [2025-04-13 18:09:38,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:38,802 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 18:09:38,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:38,811 INFO L225 Difference]: With dead ends: 1039 [2025-04-13 18:09:38,811 INFO L226 Difference]: Without dead ends: 987 [2025-04-13 18:09:38,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=2724, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:09:38,812 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 230 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:38,812 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 402 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:38,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2025-04-13 18:09:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 898. [2025-04-13 18:09:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 2.7447045707915274) internal successors, (2462), 897 states have internal predecessors, (2462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2462 transitions. [2025-04-13 18:09:38,825 INFO L79 Accepts]: Start accepts. Automaton has 898 states and 2462 transitions. Word has length 56 [2025-04-13 18:09:38,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:38,825 INFO L485 AbstractCegarLoop]: Abstraction has 898 states and 2462 transitions. [2025-04-13 18:09:38,825 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 18:09:38,825 INFO L278 IsEmpty]: Start isEmpty. Operand 898 states and 2462 transitions. [2025-04-13 18:09:38,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:38,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:38,826 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:38,833 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 18:09:39,027 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 18:09:39,027 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 18:09:39,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -515883499, now seen corresponding path program 314 times [2025-04-13 18:09:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:39,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066301808] [2025-04-13 18:09:39,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:39,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:39,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:39,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:39,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:39,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:39,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066301808] [2025-04-13 18:09:39,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066301808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:39,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:39,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:39,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682348183] [2025-04-13 18:09:39,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:39,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:39,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:39,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:39,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:39,131 INFO L87 Difference]: Start difference. First operand 898 states and 2462 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 18:09:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:39,488 INFO L93 Difference]: Finished difference Result 1054 states and 2888 transitions. [2025-04-13 18:09:39,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:09:39,488 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 18:09:39,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:39,497 INFO L225 Difference]: With dead ends: 1054 [2025-04-13 18:09:39,497 INFO L226 Difference]: Without dead ends: 1002 [2025-04-13 18:09:39,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:09:39,497 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 222 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:39,497 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 442 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-04-13 18:09:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 886. [2025-04-13 18:09:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 2.7502824858757062) internal successors, (2434), 885 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 2434 transitions. [2025-04-13 18:09:39,511 INFO L79 Accepts]: Start accepts. Automaton has 886 states and 2434 transitions. Word has length 56 [2025-04-13 18:09:39,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:39,511 INFO L485 AbstractCegarLoop]: Abstraction has 886 states and 2434 transitions. [2025-04-13 18:09:39,511 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 18:09:39,511 INFO L278 IsEmpty]: Start isEmpty. Operand 886 states and 2434 transitions. [2025-04-13 18:09:39,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:39,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:39,512 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:39,512 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2025-04-13 18:09:39,512 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 18:09:39,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1227958307, now seen corresponding path program 315 times [2025-04-13 18:09:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:39,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722510498] [2025-04-13 18:09:39,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:39,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:39,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:39,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:39,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09: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 18:09:39,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:39,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722510498] [2025-04-13 18:09:39,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722510498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:39,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:39,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360162530] [2025-04-13 18:09:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:39,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:39,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:39,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:39,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:39,611 INFO L87 Difference]: Start difference. First operand 886 states and 2434 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 18:09:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:39,914 INFO L93 Difference]: Finished difference Result 1012 states and 2770 transitions. [2025-04-13 18:09:39,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:39,914 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 18:09:39,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:39,923 INFO L225 Difference]: With dead ends: 1012 [2025-04-13 18:09:39,923 INFO L226 Difference]: Without dead ends: 904 [2025-04-13 18:09:39,924 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:39,924 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 220 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:39,924 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 381 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-04-13 18:09:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 842. [2025-04-13 18:09:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.7300832342449466) internal successors, (2296), 841 states have internal predecessors, (2296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2296 transitions. [2025-04-13 18:09:39,937 INFO L79 Accepts]: Start accepts. Automaton has 842 states and 2296 transitions. Word has length 56 [2025-04-13 18:09:39,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:39,937 INFO L485 AbstractCegarLoop]: Abstraction has 842 states and 2296 transitions. [2025-04-13 18:09:39,937 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 18:09:39,937 INFO L278 IsEmpty]: Start isEmpty. Operand 842 states and 2296 transitions. [2025-04-13 18:09:39,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:39,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:39,938 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:39,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2025-04-13 18:09:39,938 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 18:09:39,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -859431653, now seen corresponding path program 316 times [2025-04-13 18:09:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:39,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198704716] [2025-04-13 18:09:39,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:39,943 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:39,946 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 18:09:39,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:39,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:40,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198704716] [2025-04-13 18:09:40,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198704716] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:40,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973082531] [2025-04-13 18:09:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:40,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:40,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:40,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:40,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:40,023 INFO L87 Difference]: Start difference. First operand 842 states and 2296 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 18:09:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:40,355 INFO L93 Difference]: Finished difference Result 979 states and 2667 transitions. [2025-04-13 18:09:40,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:40,356 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 18:09:40,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:40,364 INFO L225 Difference]: With dead ends: 979 [2025-04-13 18:09:40,364 INFO L226 Difference]: Without dead ends: 867 [2025-04-13 18:09:40,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:09:40,365 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 208 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:40,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 396 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-04-13 18:09:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 786. [2025-04-13 18:09:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 2.7617834394904457) internal successors, (2168), 785 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2168 transitions. [2025-04-13 18:09:40,377 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2168 transitions. Word has length 56 [2025-04-13 18:09:40,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:40,377 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2168 transitions. [2025-04-13 18:09:40,377 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 18:09:40,377 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2168 transitions. [2025-04-13 18:09:40,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:40,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:40,378 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:40,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2025-04-13 18:09:40,378 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 18:09:40,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1458965881, now seen corresponding path program 317 times [2025-04-13 18:09:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:40,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946954760] [2025-04-13 18:09:40,379 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:40,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:40,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:40,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:40,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:40,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:41,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946954760] [2025-04-13 18:09:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946954760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:41,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058643830] [2025-04-13 18:09:41,270 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:41,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:41,272 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 18:09:41,273 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 18:09:41,396 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:41,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:41,415 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:41,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:41,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:09:41,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:41,614 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:41,614 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 18:09:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:41,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:09:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058643830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:09:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 18:09:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873136188] [2025-04-13 18:09:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:41,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:41,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:41,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:09:41,634 INFO L87 Difference]: Start difference. First operand 786 states and 2168 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 18:09:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:42,346 INFO L93 Difference]: Finished difference Result 1122 states and 3117 transitions. [2025-04-13 18:09:42,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:09:42,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 18:09:42,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:42,358 INFO L225 Difference]: With dead ends: 1122 [2025-04-13 18:09:42,358 INFO L226 Difference]: Without dead ends: 978 [2025-04-13 18:09:42,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1707, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:09:42,359 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 244 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:42,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 528 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:09:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-04-13 18:09:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 884. [2025-04-13 18:09:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.755379388448471) internal successors, (2433), 883 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2433 transitions. [2025-04-13 18:09:42,377 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 2433 transitions. Word has length 56 [2025-04-13 18:09:42,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:42,377 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 2433 transitions. [2025-04-13 18:09:42,377 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 18:09:42,377 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 2433 transitions. [2025-04-13 18:09:42,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:42,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:42,378 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:42,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-04-13 18:09:42,578 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 18:09:42,579 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 18:09:42,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1422832613, now seen corresponding path program 318 times [2025-04-13 18:09:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:42,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400025755] [2025-04-13 18:09:42,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:42,584 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:42,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:42,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:42,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:42,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:42,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400025755] [2025-04-13 18:09:42,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400025755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:42,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:42,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:42,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268050140] [2025-04-13 18:09:42,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:42,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:42,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:42,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:42,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:42,680 INFO L87 Difference]: Start difference. First operand 884 states and 2433 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 18:09:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:42,998 INFO L93 Difference]: Finished difference Result 1051 states and 2890 transitions. [2025-04-13 18:09:42,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:42,998 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 18:09:42,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:43,008 INFO L225 Difference]: With dead ends: 1051 [2025-04-13 18:09:43,008 INFO L226 Difference]: Without dead ends: 973 [2025-04-13 18:09:43,008 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 18:09:43,008 INFO L437 NwaCegarLoop]: 57 mSDtfsCounter, 205 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:43,009 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 416 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:43,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-04-13 18:09:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 884. [2025-04-13 18:09:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.755379388448471) internal successors, (2433), 883 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2433 transitions. [2025-04-13 18:09:43,024 INFO L79 Accepts]: Start accepts. Automaton has 884 states and 2433 transitions. Word has length 56 [2025-04-13 18:09:43,025 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:43,025 INFO L485 AbstractCegarLoop]: Abstraction has 884 states and 2433 transitions. [2025-04-13 18:09:43,025 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 18:09:43,025 INFO L278 IsEmpty]: Start isEmpty. Operand 884 states and 2433 transitions. [2025-04-13 18:09:43,026 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:43,026 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:43,026 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:43,026 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2025-04-13 18:09:43,026 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 18:09:43,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1584200251, now seen corresponding path program 319 times [2025-04-13 18:09:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:43,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017013022] [2025-04-13 18:09:43,026 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:43,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:43,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:43,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:43,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:43,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 18:09:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:43,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017013022] [2025-04-13 18:09:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017013022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:43,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608644452] [2025-04-13 18:09:43,752 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:43,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:43,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:43,754 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 18:09:43,754 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 18:09:43,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:43,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:43,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:43,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:43,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:43,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:44,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:44,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 18:09:44,098 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 18:09:44,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:44,250 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:44,251 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 18:09:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:44,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608644452] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:44,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:44,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 32 [2025-04-13 18:09:44,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773515632] [2025-04-13 18:09:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:44,276 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:44,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:44,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:44,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:44,276 INFO L87 Difference]: Start difference. First operand 884 states and 2433 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 18:09:44,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:44,803 INFO L93 Difference]: Finished difference Result 1064 states and 2931 transitions. [2025-04-13 18:09:44,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:44,804 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 18:09:44,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:44,812 INFO L225 Difference]: With dead ends: 1064 [2025-04-13 18:09:44,812 INFO L226 Difference]: Without dead ends: 1005 [2025-04-13 18:09:44,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=2339, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:44,813 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 219 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:44,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 471 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-04-13 18:09:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 892. [2025-04-13 18:09:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.753086419753086) internal successors, (2453), 891 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2453 transitions. [2025-04-13 18:09:44,826 INFO L79 Accepts]: Start accepts. Automaton has 892 states and 2453 transitions. Word has length 56 [2025-04-13 18:09:44,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:44,826 INFO L485 AbstractCegarLoop]: Abstraction has 892 states and 2453 transitions. [2025-04-13 18:09:44,827 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 18:09:44,827 INFO L278 IsEmpty]: Start isEmpty. Operand 892 states and 2453 transitions. [2025-04-13 18:09:44,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:44,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:44,827 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:44,834 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 18:09:45,028 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 18:09:45,028 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 18:09:45,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:45,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1434494941, now seen corresponding path program 320 times [2025-04-13 18:09:45,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:45,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456619581] [2025-04-13 18:09:45,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:45,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:45,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:45,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:45,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:45,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:45,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456619581] [2025-04-13 18:09:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456619581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885078875] [2025-04-13 18:09:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:45,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:45,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:45,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:45,128 INFO L87 Difference]: Start difference. First operand 892 states and 2453 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 18:09:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:45,431 INFO L93 Difference]: Finished difference Result 1067 states and 2930 transitions. [2025-04-13 18:09:45,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:09:45,431 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 18:09:45,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:45,441 INFO L225 Difference]: With dead ends: 1067 [2025-04-13 18:09:45,441 INFO L226 Difference]: Without dead ends: 1008 [2025-04-13 18:09:45,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:45,442 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 191 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:45,442 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 415 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-04-13 18:09:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 900. [2025-04-13 18:09:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.7508342602892104) internal successors, (2473), 899 states have internal predecessors, (2473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2473 transitions. [2025-04-13 18:09:45,457 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 2473 transitions. Word has length 56 [2025-04-13 18:09:45,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:45,457 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 2473 transitions. [2025-04-13 18:09:45,457 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 18:09:45,457 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 2473 transitions. [2025-04-13 18:09:45,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:45,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:45,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 18:09:45,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2025-04-13 18:09:45,458 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 18:09:45,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1417973795, now seen corresponding path program 321 times [2025-04-13 18:09:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:45,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073459008] [2025-04-13 18:09:45,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:45,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:45,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:45,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:45,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:45,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 18:09:45,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:45,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073459008] [2025-04-13 18:09:45,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073459008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:45,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:45,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925088765] [2025-04-13 18:09:45,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:45,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:45,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:45,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:45,560 INFO L87 Difference]: Start difference. First operand 900 states and 2473 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 18:09:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:45,863 INFO L93 Difference]: Finished difference Result 1057 states and 2904 transitions. [2025-04-13 18:09:45,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:45,863 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 18:09:45,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:45,872 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 18:09:45,872 INFO L226 Difference]: Without dead ends: 1005 [2025-04-13 18:09:45,872 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:45,873 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 194 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:45,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 439 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2025-04-13 18:09:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 900. [2025-04-13 18:09:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.746384872080089) internal successors, (2469), 899 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2469 transitions. [2025-04-13 18:09:45,886 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 2469 transitions. Word has length 56 [2025-04-13 18:09:45,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:45,886 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 2469 transitions. [2025-04-13 18:09:45,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 18:09:45,886 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 2469 transitions. [2025-04-13 18:09:45,887 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:45,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:45,887 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:45,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2025-04-13 18:09:45,887 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 18:09:45,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:45,888 INFO L85 PathProgramCache]: Analyzing trace with hash 941706267, now seen corresponding path program 322 times [2025-04-13 18:09:45,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:45,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518830680] [2025-04-13 18:09:45,888 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:45,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:45,902 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 18:09:45,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:45,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:45,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 18:09:45,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:45,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518830680] [2025-04-13 18:09:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518830680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954203507] [2025-04-13 18:09:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:45,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:45,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:45,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:45,972 INFO L87 Difference]: Start difference. First operand 900 states and 2469 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 18:09:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:46,264 INFO L93 Difference]: Finished difference Result 1029 states and 2820 transitions. [2025-04-13 18:09:46,264 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:46,264 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 18:09:46,264 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:46,273 INFO L225 Difference]: With dead ends: 1029 [2025-04-13 18:09:46,273 INFO L226 Difference]: Without dead ends: 973 [2025-04-13 18:09:46,273 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 18:09:46,273 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 156 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:46,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 415 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-04-13 18:09:46,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 892. [2025-04-13 18:09:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.748597081930415) internal successors, (2449), 891 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2449 transitions. [2025-04-13 18:09:46,287 INFO L79 Accepts]: Start accepts. Automaton has 892 states and 2449 transitions. Word has length 56 [2025-04-13 18:09:46,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:46,287 INFO L485 AbstractCegarLoop]: Abstraction has 892 states and 2449 transitions. [2025-04-13 18:09:46,287 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 18:09:46,287 INFO L278 IsEmpty]: Start isEmpty. Operand 892 states and 2449 transitions. [2025-04-13 18:09:46,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:46,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:46,288 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:46,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2025-04-13 18:09:46,288 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 18:09:46,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1074425641, now seen corresponding path program 323 times [2025-04-13 18:09:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:46,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429453147] [2025-04-13 18:09:46,289 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:46,293 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:46,300 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:46,300 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:46,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 18:09:46,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:46,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429453147] [2025-04-13 18:09:46,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429453147] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:46,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900517234] [2025-04-13 18:09:46,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:46,917 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 18:09:46,917 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 18:09:47,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:47,061 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:47,061 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:47,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:47,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 18:09:47,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:47,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:47,240 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 18:09:47,246 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 18:09:47,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:47,430 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:47,430 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 18:09:47,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900517234] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:09:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752230099] [2025-04-13 18:09:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:47,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:47,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:47,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=969, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:47,457 INFO L87 Difference]: Start difference. First operand 892 states and 2449 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 18:09:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:47,978 INFO L93 Difference]: Finished difference Result 1026 states and 2817 transitions. [2025-04-13 18:09:47,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:47,978 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 18:09:47,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:47,987 INFO L225 Difference]: With dead ends: 1026 [2025-04-13 18:09:47,987 INFO L226 Difference]: Without dead ends: 922 [2025-04-13 18:09:47,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=207, Invalid=2343, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:09:47,988 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 230 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:47,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 443 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-04-13 18:09:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 844. [2025-04-13 18:09:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 2.7319098457888495) internal successors, (2303), 843 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2303 transitions. [2025-04-13 18:09:48,001 INFO L79 Accepts]: Start accepts. Automaton has 844 states and 2303 transitions. Word has length 56 [2025-04-13 18:09:48,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:48,001 INFO L485 AbstractCegarLoop]: Abstraction has 844 states and 2303 transitions. [2025-04-13 18:09:48,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 18:09:48,002 INFO L278 IsEmpty]: Start isEmpty. Operand 844 states and 2303 transitions. [2025-04-13 18:09:48,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:48,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:48,002 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:48,009 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 18:09:48,203 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 18:09:48,203 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 18:09:48,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1743369977, now seen corresponding path program 324 times [2025-04-13 18:09:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:48,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493848925] [2025-04-13 18:09:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:48,208 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:48,212 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:48,212 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:48,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 18:09:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:48,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493848925] [2025-04-13 18:09:48,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493848925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:48,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:48,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912724746] [2025-04-13 18:09:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:48,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:48,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:48,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:48,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:48,303 INFO L87 Difference]: Start difference. First operand 844 states and 2303 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 18:09:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:48,609 INFO L93 Difference]: Finished difference Result 1019 states and 2784 transitions. [2025-04-13 18:09:48,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:48,609 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 18:09:48,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:48,618 INFO L225 Difference]: With dead ends: 1019 [2025-04-13 18:09:48,618 INFO L226 Difference]: Without dead ends: 960 [2025-04-13 18:09:48,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:09:48,619 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 202 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:48,619 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 410 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-04-13 18:09:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 852. [2025-04-13 18:09:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 2.72972972972973) internal successors, (2323), 851 states have internal predecessors, (2323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2323 transitions. [2025-04-13 18:09:48,632 INFO L79 Accepts]: Start accepts. Automaton has 852 states and 2323 transitions. Word has length 56 [2025-04-13 18:09:48,632 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:48,632 INFO L485 AbstractCegarLoop]: Abstraction has 852 states and 2323 transitions. [2025-04-13 18:09:48,632 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 18:09:48,632 INFO L278 IsEmpty]: Start isEmpty. Operand 852 states and 2323 transitions. [2025-04-13 18:09:48,633 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:48,633 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:48,633 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:48,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2025-04-13 18:09:48,633 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 18:09:48,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:48,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1287717799, now seen corresponding path program 325 times [2025-04-13 18:09:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:48,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015272209] [2025-04-13 18:09:48,634 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:48,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:48,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:48,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:48,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:49,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015272209] [2025-04-13 18:09:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015272209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:49,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285911975] [2025-04-13 18:09:49,378 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:49,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:49,380 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 18:09:49,381 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 18:09:49,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:49,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:49,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:49,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:49,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:49,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:49,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:49,705 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 18:09:49,738 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 18:09:49,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:49,899 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:49,900 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 18:09:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285911975] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:09:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593599447] [2025-04-13 18:09:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:49,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:49,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:49,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:49,925 INFO L87 Difference]: Start difference. First operand 852 states and 2323 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 18:09:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:50,461 INFO L93 Difference]: Finished difference Result 1008 states and 2749 transitions. [2025-04-13 18:09:50,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:09:50,462 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 18:09:50,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:50,471 INFO L225 Difference]: With dead ends: 1008 [2025-04-13 18:09:50,471 INFO L226 Difference]: Without dead ends: 956 [2025-04-13 18:09:50,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=226, Invalid=2530, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:09:50,472 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 193 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:50,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 421 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-04-13 18:09:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 848. [2025-04-13 18:09:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 2.728453364817001) internal successors, (2311), 847 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 2311 transitions. [2025-04-13 18:09:50,486 INFO L79 Accepts]: Start accepts. Automaton has 848 states and 2311 transitions. Word has length 56 [2025-04-13 18:09:50,486 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:50,486 INFO L485 AbstractCegarLoop]: Abstraction has 848 states and 2311 transitions. [2025-04-13 18:09:50,486 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 18:09:50,486 INFO L278 IsEmpty]: Start isEmpty. Operand 848 states and 2311 transitions. [2025-04-13 18:09:50,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:50,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:50,487 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:50,494 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 18:09:50,687 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 18:09:50,687 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 18:09:50,687 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash 907033149, now seen corresponding path program 326 times [2025-04-13 18:09:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:50,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820174850] [2025-04-13 18:09:50,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:50,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:50,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:50,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:50,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 18:09:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:50,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820174850] [2025-04-13 18:09:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820174850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193815196] [2025-04-13 18:09:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:50,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:50,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:50,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:50,785 INFO L87 Difference]: Start difference. First operand 848 states and 2311 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 18:09:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:51,079 INFO L93 Difference]: Finished difference Result 985 states and 2682 transitions. [2025-04-13 18:09:51,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:09:51,079 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 18:09:51,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:51,088 INFO L225 Difference]: With dead ends: 985 [2025-04-13 18:09:51,088 INFO L226 Difference]: Without dead ends: 877 [2025-04-13 18:09:51,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 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 18:09:51,089 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 168 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:51,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 416 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-04-13 18:09:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 796. [2025-04-13 18:09:51,095 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 18:09:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2191 transitions. [2025-04-13 18:09:51,102 INFO L79 Accepts]: Start accepts. Automaton has 796 states and 2191 transitions. Word has length 56 [2025-04-13 18:09:51,102 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:51,102 INFO L485 AbstractCegarLoop]: Abstraction has 796 states and 2191 transitions. [2025-04-13 18:09:51,102 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 18:09:51,102 INFO L278 IsEmpty]: Start isEmpty. Operand 796 states and 2191 transitions. [2025-04-13 18:09:51,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:51,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:51,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 18:09:51,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2025-04-13 18:09:51,103 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 18:09:51,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2000421045, now seen corresponding path program 327 times [2025-04-13 18:09:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:51,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816829890] [2025-04-13 18:09:51,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:51,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:51,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:51,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:51,112 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:51,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:51,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816829890] [2025-04-13 18:09:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816829890] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:51,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:51,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755347142] [2025-04-13 18:09:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:51,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:51,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:51,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:51,223 INFO L87 Difference]: Start difference. First operand 796 states and 2191 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 18:09:51,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:51,549 INFO L93 Difference]: Finished difference Result 1080 states and 2978 transitions. [2025-04-13 18:09:51,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:51,549 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 18:09:51,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:51,558 INFO L225 Difference]: With dead ends: 1080 [2025-04-13 18:09:51,558 INFO L226 Difference]: Without dead ends: 936 [2025-04-13 18:09:51,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:51,558 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 242 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:51,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 531 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-04-13 18:09:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 850. [2025-04-13 18:09:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 2.730270906949352) internal successors, (2318), 849 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:51,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2318 transitions. [2025-04-13 18:09:51,572 INFO L79 Accepts]: Start accepts. Automaton has 850 states and 2318 transitions. Word has length 56 [2025-04-13 18:09:51,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:51,572 INFO L485 AbstractCegarLoop]: Abstraction has 850 states and 2318 transitions. [2025-04-13 18:09:51,572 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 18:09:51,572 INFO L278 IsEmpty]: Start isEmpty. Operand 850 states and 2318 transitions. [2025-04-13 18:09:51,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:51,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:51,573 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:51,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2025-04-13 18:09:51,573 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 18:09:51,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -988370345, now seen corresponding path program 328 times [2025-04-13 18:09:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:51,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902238299] [2025-04-13 18:09:51,573 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:51,578 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:51,580 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 18:09:51,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:51,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:51,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 18:09:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:51,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902238299] [2025-04-13 18:09:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902238299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:51,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:51,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949226735] [2025-04-13 18:09:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:51,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:51,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:51,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:51,652 INFO L87 Difference]: Start difference. First operand 850 states and 2318 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 18:09:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:51,966 INFO L93 Difference]: Finished difference Result 998 states and 2724 transitions. [2025-04-13 18:09:51,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:09:51,966 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 18:09:51,966 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:51,975 INFO L225 Difference]: With dead ends: 998 [2025-04-13 18:09:51,975 INFO L226 Difference]: Without dead ends: 939 [2025-04-13 18:09:51,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:09:51,975 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 189 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:51,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 491 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-04-13 18:09:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 858. [2025-04-13 18:09:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 857 states have (on average 2.7281213535589264) internal successors, (2338), 857 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2338 transitions. [2025-04-13 18:09:51,988 INFO L79 Accepts]: Start accepts. Automaton has 858 states and 2338 transitions. Word has length 56 [2025-04-13 18:09:51,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:51,988 INFO L485 AbstractCegarLoop]: Abstraction has 858 states and 2338 transitions. [2025-04-13 18:09:51,989 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 18:09:51,989 INFO L278 IsEmpty]: Start isEmpty. Operand 858 states and 2338 transitions. [2025-04-13 18:09:51,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:51,989 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:51,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2025-04-13 18:09:51,990 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 18:09:51,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 876518631, now seen corresponding path program 329 times [2025-04-13 18:09:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:51,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332093638] [2025-04-13 18:09:51,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:51,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:52,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:52,002 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:52,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:52,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332093638] [2025-04-13 18:09:52,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332093638] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:52,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665436711] [2025-04-13 18:09:52,661 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:52,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:52,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:52,663 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 18:09:52,663 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 18:09:52,798 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:52,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:52,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:52,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:52,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:09:52,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:53,023 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:53,023 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 18:09:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:53,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:09:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665436711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:09:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:09:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173535455] [2025-04-13 18:09:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:53,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:53,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:53,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:53,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:09:53,033 INFO L87 Difference]: Start difference. First operand 858 states and 2338 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 18:09:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:53,651 INFO L93 Difference]: Finished difference Result 987 states and 2689 transitions. [2025-04-13 18:09:53,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:53,651 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 18:09:53,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:53,660 INFO L225 Difference]: With dead ends: 987 [2025-04-13 18:09:53,660 INFO L226 Difference]: Without dead ends: 935 [2025-04-13 18:09:53,661 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=1551, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:09:53,661 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 197 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:53,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 484 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:09:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-04-13 18:09:53,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 854. [2025-04-13 18:09:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 2.7268464243845254) internal successors, (2326), 853 states have internal predecessors, (2326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 2326 transitions. [2025-04-13 18:09:53,674 INFO L79 Accepts]: Start accepts. Automaton has 854 states and 2326 transitions. Word has length 56 [2025-04-13 18:09:53,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:53,674 INFO L485 AbstractCegarLoop]: Abstraction has 854 states and 2326 transitions. [2025-04-13 18:09:53,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 18:09:53,674 INFO L278 IsEmpty]: Start isEmpty. Operand 854 states and 2326 transitions. [2025-04-13 18:09:53,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:53,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:53,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 18:09:53,681 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 18:09:53,875 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 18:09:53,875 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 18:09:53,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1824707173, now seen corresponding path program 330 times [2025-04-13 18:09:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:53,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129208203] [2025-04-13 18:09:53,876 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:53,881 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:53,885 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:53,885 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:53,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:53,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129208203] [2025-04-13 18:09:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129208203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:53,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:53,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23754105] [2025-04-13 18:09:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:53,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:53,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:53,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:53,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:53,984 INFO L87 Difference]: Start difference. First operand 854 states and 2326 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 18:09:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:54,298 INFO L93 Difference]: Finished difference Result 991 states and 2697 transitions. [2025-04-13 18:09:54,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:09:54,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 18:09:54,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:54,307 INFO L225 Difference]: With dead ends: 991 [2025-04-13 18:09:54,307 INFO L226 Difference]: Without dead ends: 887 [2025-04-13 18:09:54,308 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:09:54,308 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 203 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:54,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 485 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-04-13 18:09:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 806. [2025-04-13 18:09:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 2.7503105590062114) internal successors, (2214), 805 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2214 transitions. [2025-04-13 18:09:54,321 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2214 transitions. Word has length 56 [2025-04-13 18:09:54,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:54,321 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2214 transitions. [2025-04-13 18:09:54,321 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 18:09:54,321 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2214 transitions. [2025-04-13 18:09:54,322 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:54,322 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:54,322 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:54,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2025-04-13 18:09:54,322 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 18:09:54,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1963147911, now seen corresponding path program 331 times [2025-04-13 18:09:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:54,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959966464] [2025-04-13 18:09:54,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:54,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:54,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:54,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:54,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:55,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 18:09:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:55,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959966464] [2025-04-13 18:09:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959966464] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:55,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679839589] [2025-04-13 18:09:55,005 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:09:55,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:55,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:55,007 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 18:09:55,009 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 18:09:55,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:09:55,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:55,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:55,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:55,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:55,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:55,369 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:55,370 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 18:09:55,375 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 18:09:55,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:55,557 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:55,558 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 18:09:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:55,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679839589] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:55,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:55,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:09:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926315370] [2025-04-13 18:09:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:55,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:09:55,582 INFO L87 Difference]: Start difference. First operand 806 states and 2214 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 18:09:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:56,009 INFO L93 Difference]: Finished difference Result 970 states and 2627 transitions. [2025-04-13 18:09:56,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:09:56,009 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 18:09:56,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:56,018 INFO L225 Difference]: With dead ends: 970 [2025-04-13 18:09:56,018 INFO L226 Difference]: Without dead ends: 766 [2025-04-13 18:09:56,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:09:56,019 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 169 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:56,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 515 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-04-13 18:09:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2025-04-13 18:09:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 2.76078431372549) internal successors, (2112), 765 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2112 transitions. [2025-04-13 18:09:56,031 INFO L79 Accepts]: Start accepts. Automaton has 766 states and 2112 transitions. Word has length 56 [2025-04-13 18:09:56,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:56,031 INFO L485 AbstractCegarLoop]: Abstraction has 766 states and 2112 transitions. [2025-04-13 18:09:56,031 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 18:09:56,031 INFO L278 IsEmpty]: Start isEmpty. Operand 766 states and 2112 transitions. [2025-04-13 18:09:56,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:56,031 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:56,032 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:56,038 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 18:09:56,232 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 18:09:56,232 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 18:09:56,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 745283095, now seen corresponding path program 332 times [2025-04-13 18:09:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:56,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90795989] [2025-04-13 18:09:56,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:56,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:56,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:56,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:09:56,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:56,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 18:09:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:56,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90795989] [2025-04-13 18:09:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90795989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:56,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:56,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761913259] [2025-04-13 18:09:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:56,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:56,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:56,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:56,340 INFO L87 Difference]: Start difference. First operand 766 states and 2112 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 18:09:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:56,671 INFO L93 Difference]: Finished difference Result 898 states and 2449 transitions. [2025-04-13 18:09:56,671 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:09:56,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 18:09:56,671 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:56,680 INFO L225 Difference]: With dead ends: 898 [2025-04-13 18:09:56,680 INFO L226 Difference]: Without dead ends: 801 [2025-04-13 18:09:56,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:09:56,680 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 187 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:56,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 305 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-04-13 18:09:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 770. [2025-04-13 18:09:56,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 2.756827048114434) internal successors, (2120), 769 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2120 transitions. [2025-04-13 18:09:56,693 INFO L79 Accepts]: Start accepts. Automaton has 770 states and 2120 transitions. Word has length 56 [2025-04-13 18:09:56,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:56,693 INFO L485 AbstractCegarLoop]: Abstraction has 770 states and 2120 transitions. [2025-04-13 18:09:56,693 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 18:09:56,693 INFO L278 IsEmpty]: Start isEmpty. Operand 770 states and 2120 transitions. [2025-04-13 18:09:56,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:56,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:56,694 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:56,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2025-04-13 18:09:56,694 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 18:09:56,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:56,694 INFO L85 PathProgramCache]: Analyzing trace with hash -99944847, now seen corresponding path program 333 times [2025-04-13 18:09:56,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:56,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727892758] [2025-04-13 18:09:56,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:56,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:56,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:56,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:56,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:09:56,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:56,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:56,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727892758] [2025-04-13 18:09:56,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727892758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:56,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:56,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:56,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468843855] [2025-04-13 18:09:56,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:56,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:56,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:56,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:56,809 INFO L87 Difference]: Start difference. First operand 770 states and 2120 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 18:09:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:57,100 INFO L93 Difference]: Finished difference Result 998 states and 2727 transitions. [2025-04-13 18:09:57,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:09:57,100 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 18:09:57,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:57,109 INFO L225 Difference]: With dead ends: 998 [2025-04-13 18:09:57,109 INFO L226 Difference]: Without dead ends: 854 [2025-04-13 18:09:57,110 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 18:09:57,110 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 201 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:57,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 446 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2025-04-13 18:09:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 814. [2025-04-13 18:09:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 2.7232472324723247) internal successors, (2214), 813 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2214 transitions. [2025-04-13 18:09:57,123 INFO L79 Accepts]: Start accepts. Automaton has 814 states and 2214 transitions. Word has length 56 [2025-04-13 18:09:57,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:57,123 INFO L485 AbstractCegarLoop]: Abstraction has 814 states and 2214 transitions. [2025-04-13 18:09:57,123 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 18:09:57,123 INFO L278 IsEmpty]: Start isEmpty. Operand 814 states and 2214 transitions. [2025-04-13 18:09:57,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:57,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:57,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 18:09:57,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2025-04-13 18:09:57,124 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 18:09:57,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1497057271, now seen corresponding path program 334 times [2025-04-13 18:09:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:57,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969587941] [2025-04-13 18:09:57,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:09:57,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:57,129 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:57,131 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 18:09:57,131 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:09:57,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:57,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:57,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969587941] [2025-04-13 18:09:57,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969587941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:57,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:57,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:09:57,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131690922] [2025-04-13 18:09:57,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:57,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:09:57,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:57,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:09:57,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:09:57,214 INFO L87 Difference]: Start difference. First operand 814 states and 2214 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 18:09:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:57,519 INFO L93 Difference]: Finished difference Result 931 states and 2512 transitions. [2025-04-13 18:09:57,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:09:57,520 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 18:09:57,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:57,529 INFO L225 Difference]: With dead ends: 931 [2025-04-13 18:09:57,529 INFO L226 Difference]: Without dead ends: 853 [2025-04-13 18:09:57,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:09:57,529 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:57,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 300 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2025-04-13 18:09:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 814. [2025-04-13 18:09:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 2.7232472324723247) internal successors, (2214), 813 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2214 transitions. [2025-04-13 18:09:57,542 INFO L79 Accepts]: Start accepts. Automaton has 814 states and 2214 transitions. Word has length 56 [2025-04-13 18:09:57,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:57,542 INFO L485 AbstractCegarLoop]: Abstraction has 814 states and 2214 transitions. [2025-04-13 18:09:57,542 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 18:09:57,542 INFO L278 IsEmpty]: Start isEmpty. Operand 814 states and 2214 transitions. [2025-04-13 18:09:57,542 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:57,542 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:57,543 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:57,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2025-04-13 18:09:57,543 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 18:09:57,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash -225179217, now seen corresponding path program 335 times [2025-04-13 18:09:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:57,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243774200] [2025-04-13 18:09:57,543 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:57,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:57,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:57,555 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:57,555 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:09:58,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:58,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243774200] [2025-04-13 18:09:58,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243774200] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:58,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595880886] [2025-04-13 18:09:58,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:09:58,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:58,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:58,396 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 18:09:58,397 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 18:09:58,527 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:58,545 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:09:58,545 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:58,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:58,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:09:58,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:58,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:58,699 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 18:09:58,706 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 18:09:58,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:58,850 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:09:58,850 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 18:09:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:58,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595880886] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:58,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:09:58,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:09:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491663936] [2025-04-13 18:09:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:58,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:58,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:58,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:09:58,875 INFO L87 Difference]: Start difference. First operand 814 states and 2214 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 18:09:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:59,385 INFO L93 Difference]: Finished difference Result 940 states and 2545 transitions. [2025-04-13 18:09:59,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:09:59,385 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 18:09:59,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:59,394 INFO L225 Difference]: With dead ends: 940 [2025-04-13 18:09:59,394 INFO L226 Difference]: Without dead ends: 881 [2025-04-13 18:09:59,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:09:59,395 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 251 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:59,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 419 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:09:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-04-13 18:09:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 822. [2025-04-13 18:09:59,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 2.721071863580999) internal successors, (2234), 821 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2234 transitions. [2025-04-13 18:09:59,407 INFO L79 Accepts]: Start accepts. Automaton has 822 states and 2234 transitions. Word has length 56 [2025-04-13 18:09:59,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:59,407 INFO L485 AbstractCegarLoop]: Abstraction has 822 states and 2234 transitions. [2025-04-13 18:09:59,408 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 18:09:59,408 INFO L278 IsEmpty]: Start isEmpty. Operand 822 states and 2234 transitions. [2025-04-13 18:09:59,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:09:59,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:59,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 18:09:59,415 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 18:09:59,609 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 18:09:59,609 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 18:09:59,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 59417529, now seen corresponding path program 336 times [2025-04-13 18:09:59,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:59,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603452869] [2025-04-13 18:09:59,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:09:59,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:59,614 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:09:59,618 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:09:59,618 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:09:59,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:59,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:59,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603452869] [2025-04-13 18:09:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603452869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:59,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:59,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:09:59,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471572834] [2025-04-13 18:09:59,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:59,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:09:59,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:59,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:09:59,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:09:59,721 INFO L87 Difference]: Start difference. First operand 822 states and 2234 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 18:10:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:00,064 INFO L93 Difference]: Finished difference Result 928 states and 2501 transitions. [2025-04-13 18:10:00,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:00,064 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 18:10:00,064 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:00,074 INFO L225 Difference]: With dead ends: 928 [2025-04-13 18:10:00,074 INFO L226 Difference]: Without dead ends: 869 [2025-04-13 18:10:00,074 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:10:00,075 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 173 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:00,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 326 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-04-13 18:10:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 826. [2025-04-13 18:10:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 2.7175757575757578) internal successors, (2242), 825 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2242 transitions. [2025-04-13 18:10:00,088 INFO L79 Accepts]: Start accepts. Automaton has 826 states and 2242 transitions. Word has length 56 [2025-04-13 18:10:00,088 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:00,088 INFO L485 AbstractCegarLoop]: Abstraction has 826 states and 2242 transitions. [2025-04-13 18:10:00,089 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 18:10:00,089 INFO L278 IsEmpty]: Start isEmpty. Operand 826 states and 2242 transitions. [2025-04-13 18:10:00,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:00,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:00,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 18:10:00,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2025-04-13 18:10:00,090 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 18:10:00,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1517972467, now seen corresponding path program 337 times [2025-04-13 18:10:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:00,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978212840] [2025-04-13 18:10:00,090 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:00,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:00,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:00,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:00,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:00,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978212840] [2025-04-13 18:10:00,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978212840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:00,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397987601] [2025-04-13 18:10:00,759 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:00,762 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 18:10:00,762 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 18:10:00,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:00,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:00,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:00,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:00,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:00,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:01,072 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:01,073 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 18:10:01,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 18:10:01,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:01,233 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:01,233 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 18:10:01,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 18:10:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397987601] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888365514] [2025-04-13 18:10:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:01,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:01,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:01,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:01,260 INFO L87 Difference]: Start difference. First operand 826 states and 2242 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 18:10:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:01,773 INFO L93 Difference]: Finished difference Result 937 states and 2526 transitions. [2025-04-13 18:10:01,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:01,773 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 18:10:01,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:01,782 INFO L225 Difference]: With dead ends: 937 [2025-04-13 18:10:01,782 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 18:10:01,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:10:01,783 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 204 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:01,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 427 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 18:10:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 826. [2025-04-13 18:10:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 2.712727272727273) internal successors, (2238), 825 states have internal predecessors, (2238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2238 transitions. [2025-04-13 18:10:01,795 INFO L79 Accepts]: Start accepts. Automaton has 826 states and 2238 transitions. Word has length 56 [2025-04-13 18:10:01,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:01,795 INFO L485 AbstractCegarLoop]: Abstraction has 826 states and 2238 transitions. [2025-04-13 18:10:01,795 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 18:10:01,795 INFO L278 IsEmpty]: Start isEmpty. Operand 826 states and 2238 transitions. [2025-04-13 18:10:01,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:01,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:01,796 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:01,803 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 18:10:01,996 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 18:10:01,996 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 18:10:01,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -433371145, now seen corresponding path program 338 times [2025-04-13 18:10:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:01,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307105148] [2025-04-13 18:10:01,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:02,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:02,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:02,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:02,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:02,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307105148] [2025-04-13 18:10:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307105148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475868517] [2025-04-13 18:10:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:02,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:02,117 INFO L87 Difference]: Start difference. First operand 826 states and 2238 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 18:10:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:02,426 INFO L93 Difference]: Finished difference Result 894 states and 2399 transitions. [2025-04-13 18:10:02,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:10:02,426 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 18:10:02,426 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:02,436 INFO L225 Difference]: With dead ends: 894 [2025-04-13 18:10:02,436 INFO L226 Difference]: Without dead ends: 834 [2025-04-13 18:10:02,436 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:10:02,436 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 143 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:02,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 313 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-04-13 18:10:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2025-04-13 18:10:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 2.7183271832718328) internal successors, (2210), 813 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2210 transitions. [2025-04-13 18:10:02,448 INFO L79 Accepts]: Start accepts. Automaton has 814 states and 2210 transitions. Word has length 56 [2025-04-13 18:10:02,448 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:02,448 INFO L485 AbstractCegarLoop]: Abstraction has 814 states and 2210 transitions. [2025-04-13 18:10:02,448 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 18:10:02,448 INFO L278 IsEmpty]: Start isEmpty. Operand 814 states and 2210 transitions. [2025-04-13 18:10:02,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:02,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:02,449 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:02,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2025-04-13 18:10:02,449 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 18:10:02,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1861520621, now seen corresponding path program 339 times [2025-04-13 18:10:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:02,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824346081] [2025-04-13 18:10:02,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:02,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:02,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:02,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:02,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824346081] [2025-04-13 18:10:02,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824346081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110021322] [2025-04-13 18:10:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:02,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:02,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:02,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:02,567 INFO L87 Difference]: Start difference. First operand 814 states and 2210 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 18:10:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:02,867 INFO L93 Difference]: Finished difference Result 902 states and 2431 transitions. [2025-04-13 18:10:02,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:02,867 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 18:10:02,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:02,876 INFO L225 Difference]: With dead ends: 902 [2025-04-13 18:10:02,877 INFO L226 Difference]: Without dead ends: 798 [2025-04-13 18:10:02,877 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 18:10:02,877 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 192 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:02,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 403 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-04-13 18:10:02,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 766. [2025-04-13 18:10:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 2.6980392156862747) internal successors, (2064), 765 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2064 transitions. [2025-04-13 18:10:02,889 INFO L79 Accepts]: Start accepts. Automaton has 766 states and 2064 transitions. Word has length 56 [2025-04-13 18:10:02,889 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:02,889 INFO L485 AbstractCegarLoop]: Abstraction has 766 states and 2064 transitions. [2025-04-13 18:10:02,889 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 18:10:02,889 INFO L278 IsEmpty]: Start isEmpty. Operand 766 states and 2064 transitions. [2025-04-13 18:10:02,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:02,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:02,890 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:02,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2025-04-13 18:10:02,890 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 18:10:02,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:02,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1507365607, now seen corresponding path program 340 times [2025-04-13 18:10:02,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:02,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149950808] [2025-04-13 18:10:02,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:02,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:02,895 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:02,898 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 18:10:02,898 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:02,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:02,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:02,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:02,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149950808] [2025-04-13 18:10:02,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149950808] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:02,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:02,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809376524] [2025-04-13 18:10:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:02,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:02,979 INFO L87 Difference]: Start difference. First operand 766 states and 2064 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 18:10:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:03,274 INFO L93 Difference]: Finished difference Result 863 states and 2302 transitions. [2025-04-13 18:10:03,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:10:03,274 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 18:10:03,274 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:03,284 INFO L225 Difference]: With dead ends: 863 [2025-04-13 18:10:03,284 INFO L226 Difference]: Without dead ends: 723 [2025-04-13 18:10:03,285 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 18:10:03,285 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 177 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:03,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 303 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:03,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-04-13 18:10:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2025-04-13 18:10:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 2.7022160664819945) internal successors, (1951), 722 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1951 transitions. [2025-04-13 18:10:03,297 INFO L79 Accepts]: Start accepts. Automaton has 723 states and 1951 transitions. Word has length 56 [2025-04-13 18:10:03,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:03,297 INFO L485 AbstractCegarLoop]: Abstraction has 723 states and 1951 transitions. [2025-04-13 18:10:03,298 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 18:10:03,298 INFO L278 IsEmpty]: Start isEmpty. Operand 723 states and 1951 transitions. [2025-04-13 18:10:03,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:03,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:03,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 18:10:03,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2025-04-13 18:10:03,298 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 18:10:03,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1055221449, now seen corresponding path program 341 times [2025-04-13 18:10:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:03,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424857516] [2025-04-13 18:10:03,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:03,304 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:03,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:03,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:04,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424857516] [2025-04-13 18:10:04,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424857516] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:04,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257761810] [2025-04-13 18:10:04,196 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:04,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:04,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:04,198 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 18:10:04,198 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 18:10:04,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:04,354 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:04,354 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:04,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:04,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:10:04,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:04,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:04,502 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 18:10:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:04,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:10:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257761810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:04,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:10:04,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 23 [2025-04-13 18:10:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097256025] [2025-04-13 18:10:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:04,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:04,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:04,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:10:04,509 INFO L87 Difference]: Start difference. First operand 723 states and 1951 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 18:10:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:05,113 INFO L93 Difference]: Finished difference Result 860 states and 2309 transitions. [2025-04-13 18:10:05,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:10:05,113 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 18:10:05,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:05,125 INFO L225 Difference]: With dead ends: 860 [2025-04-13 18:10:05,125 INFO L226 Difference]: Without dead ends: 801 [2025-04-13 18:10:05,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=1629, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:10:05,126 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 240 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:05,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 384 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-04-13 18:10:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 727. [2025-04-13 18:10:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 2.6983471074380163) internal successors, (1959), 726 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1959 transitions. [2025-04-13 18:10:05,143 INFO L79 Accepts]: Start accepts. Automaton has 727 states and 1959 transitions. Word has length 56 [2025-04-13 18:10:05,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:05,144 INFO L485 AbstractCegarLoop]: Abstraction has 727 states and 1959 transitions. [2025-04-13 18:10:05,144 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 18:10:05,144 INFO L278 IsEmpty]: Start isEmpty. Operand 727 states and 1959 transitions. [2025-04-13 18:10:05,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:05,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:05,145 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:05,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-04-13 18:10:05,345 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 18:10:05,345 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 18:10:05,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:05,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1645760503, now seen corresponding path program 342 times [2025-04-13 18:10:05,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:05,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124443822] [2025-04-13 18:10:05,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:05,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:05,351 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:05,355 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:05,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:05,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:05,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 18:10:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:05,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124443822] [2025-04-13 18:10:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124443822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407429295] [2025-04-13 18:10:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:05,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:05,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:05,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:05,456 INFO L87 Difference]: Start difference. First operand 727 states and 1959 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 18:10:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:05,775 INFO L93 Difference]: Finished difference Result 867 states and 2320 transitions. [2025-04-13 18:10:05,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:05,775 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 18:10:05,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:05,784 INFO L225 Difference]: With dead ends: 867 [2025-04-13 18:10:05,784 INFO L226 Difference]: Without dead ends: 770 [2025-04-13 18:10:05,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:10:05,785 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 208 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:05,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 310 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:05,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-04-13 18:10:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 735. [2025-04-13 18:10:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 2.696185286103542) internal successors, (1979), 734 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:05,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1979 transitions. [2025-04-13 18:10:05,797 INFO L79 Accepts]: Start accepts. Automaton has 735 states and 1979 transitions. Word has length 56 [2025-04-13 18:10:05,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:05,797 INFO L485 AbstractCegarLoop]: Abstraction has 735 states and 1979 transitions. [2025-04-13 18:10:05,797 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 18:10:05,797 INFO L278 IsEmpty]: Start isEmpty. Operand 735 states and 1979 transitions. [2025-04-13 18:10:05,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:05,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:05,797 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:05,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2025-04-13 18:10:05,798 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 18:10:05,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash -237571801, now seen corresponding path program 343 times [2025-04-13 18:10:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:05,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905448985] [2025-04-13 18:10:05,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:05,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:05,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:05,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:05,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:06,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905448985] [2025-04-13 18:10:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905448985] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:06,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835961332] [2025-04-13 18:10:06,518 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:06,520 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 18:10:06,520 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 18:10:06,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:06,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:06,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:06,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:06,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:06,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:06,827 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:06,827 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 18:10:06,834 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 18:10:06,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:06,995 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:06,995 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 18:10:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:07,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835961332] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:07,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:07,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:07,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968942775] [2025-04-13 18:10:07,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:07,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:07,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:07,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=852, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:07,019 INFO L87 Difference]: Start difference. First operand 735 states and 1979 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 18:10:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:07,548 INFO L93 Difference]: Finished difference Result 834 states and 2231 transitions. [2025-04-13 18:10:07,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:07,548 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 18:10:07,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:07,557 INFO L225 Difference]: With dead ends: 834 [2025-04-13 18:10:07,557 INFO L226 Difference]: Without dead ends: 778 [2025-04-13 18:10:07,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=2256, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:10:07,557 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 178 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:07,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 384 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:07,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-04-13 18:10:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 727. [2025-04-13 18:10:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 2.6983471074380163) internal successors, (1959), 726 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1959 transitions. [2025-04-13 18:10:07,569 INFO L79 Accepts]: Start accepts. Automaton has 727 states and 1959 transitions. Word has length 56 [2025-04-13 18:10:07,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:07,570 INFO L485 AbstractCegarLoop]: Abstraction has 727 states and 1959 transitions. [2025-04-13 18:10:07,570 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 18:10:07,570 INFO L278 IsEmpty]: Start isEmpty. Operand 727 states and 1959 transitions. [2025-04-13 18:10:07,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:07,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:07,570 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:07,577 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 18:10:07,771 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 18:10:07,771 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 18:10:07,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1897432617, now seen corresponding path program 344 times [2025-04-13 18:10:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:07,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020157299] [2025-04-13 18:10:07,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:07,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:07,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:07,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:07,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:07,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 18:10:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:07,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020157299] [2025-04-13 18:10:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020157299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752127962] [2025-04-13 18:10:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:07,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:07,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:07,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:07,877 INFO L87 Difference]: Start difference. First operand 727 states and 1959 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 18:10:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:08,200 INFO L93 Difference]: Finished difference Result 867 states and 2320 transitions. [2025-04-13 18:10:08,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:08,200 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 18:10:08,201 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:08,210 INFO L225 Difference]: With dead ends: 867 [2025-04-13 18:10:08,210 INFO L226 Difference]: Without dead ends: 789 [2025-04-13 18:10:08,210 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 18:10:08,210 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 188 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:08,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 306 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-04-13 18:10:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 731. [2025-04-13 18:10:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 730 states have (on average 2.6945205479452055) internal successors, (1967), 730 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1967 transitions. [2025-04-13 18:10:08,222 INFO L79 Accepts]: Start accepts. Automaton has 731 states and 1967 transitions. Word has length 56 [2025-04-13 18:10:08,222 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:08,222 INFO L485 AbstractCegarLoop]: Abstraction has 731 states and 1967 transitions. [2025-04-13 18:10:08,223 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 18:10:08,223 INFO L278 IsEmpty]: Start isEmpty. Operand 731 states and 1967 transitions. [2025-04-13 18:10:08,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:08,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:08,223 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:08,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2025-04-13 18:10:08,223 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 18:10:08,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:08,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1364096485, now seen corresponding path program 345 times [2025-04-13 18:10:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:08,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126446839] [2025-04-13 18:10:08,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:08,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:08,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:08,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:08,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:08,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 18:10:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:08,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126446839] [2025-04-13 18:10:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126446839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:08,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:08,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:08,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495344702] [2025-04-13 18:10:08,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:08,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:08,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:08,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:08,324 INFO L87 Difference]: Start difference. First operand 731 states and 1967 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 18:10:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:08,617 INFO L93 Difference]: Finished difference Result 849 states and 2274 transitions. [2025-04-13 18:10:08,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:08,618 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 18:10:08,618 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:08,627 INFO L225 Difference]: With dead ends: 849 [2025-04-13 18:10:08,627 INFO L226 Difference]: Without dead ends: 790 [2025-04-13 18:10:08,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:10:08,627 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 210 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:08,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 366 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-04-13 18:10:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 739. [2025-04-13 18:10:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 2.692411924119241) internal successors, (1987), 738 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1987 transitions. [2025-04-13 18:10:08,639 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 1987 transitions. Word has length 56 [2025-04-13 18:10:08,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:08,639 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 1987 transitions. [2025-04-13 18:10:08,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 18:10:08,639 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 1987 transitions. [2025-04-13 18:10:08,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:08,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:08,640 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:08,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2025-04-13 18:10:08,640 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 18:10:08,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:08,640 INFO L85 PathProgramCache]: Analyzing trace with hash 959894937, now seen corresponding path program 346 times [2025-04-13 18:10:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:08,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619459976] [2025-04-13 18:10:08,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:08,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:08,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:08,648 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 18:10:08,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:08,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:08,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:08,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619459976] [2025-04-13 18:10:08,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619459976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:08,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:08,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:08,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541282670] [2025-04-13 18:10:08,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:08,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:08,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:08,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:08,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:08,729 INFO L87 Difference]: Start difference. First operand 739 states and 1987 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 18:10:09,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:09,070 INFO L93 Difference]: Finished difference Result 860 states and 2297 transitions. [2025-04-13 18:10:09,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:09,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 18:10:09,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:09,079 INFO L225 Difference]: With dead ends: 860 [2025-04-13 18:10:09,079 INFO L226 Difference]: Without dead ends: 801 [2025-04-13 18:10:09,080 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 18:10:09,080 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:09,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 340 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-04-13 18:10:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 739. [2025-04-13 18:10:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 2.692411924119241) internal successors, (1987), 738 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1987 transitions. [2025-04-13 18:10:09,092 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 1987 transitions. Word has length 56 [2025-04-13 18:10:09,092 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:09,092 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 1987 transitions. [2025-04-13 18:10:09,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 18:10:09,092 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 1987 transitions. [2025-04-13 18:10:09,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:09,092 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:09,092 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:09,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2025-04-13 18:10:09,093 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 18:10:09,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:09,093 INFO L85 PathProgramCache]: Analyzing trace with hash 71303235, now seen corresponding path program 347 times [2025-04-13 18:10:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:09,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139207039] [2025-04-13 18:10:09,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:09,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:09,105 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:09,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:10,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139207039] [2025-04-13 18:10:10,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139207039] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:10,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329348815] [2025-04-13 18:10:10,018 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:10,020 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 18:10:10,020 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 18:10:10,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:10,171 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:10,171 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:10,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:10,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:10,330 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:10,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 18:10:10,337 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 18:10:10,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:10,489 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:10,489 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 18:10:10,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 18:10:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329348815] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:10,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18, 12] total 32 [2025-04-13 18:10:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563279813] [2025-04-13 18:10:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:10,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:10,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:10,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:10,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:10:10,512 INFO L87 Difference]: Start difference. First operand 739 states and 1987 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 18:10:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:10,979 INFO L93 Difference]: Finished difference Result 842 states and 2247 transitions. [2025-04-13 18:10:10,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:10,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 18:10:10,979 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:10,988 INFO L225 Difference]: With dead ends: 842 [2025-04-13 18:10:10,988 INFO L226 Difference]: Without dead ends: 790 [2025-04-13 18:10:10,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=2257, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:10:10,988 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 177 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:10,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 361 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-04-13 18:10:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 739. [2025-04-13 18:10:10,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 2.686991869918699) internal successors, (1983), 738 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1983 transitions. [2025-04-13 18:10:11,000 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 1983 transitions. Word has length 56 [2025-04-13 18:10:11,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:11,000 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 1983 transitions. [2025-04-13 18:10:11,000 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 18:10:11,000 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 1983 transitions. [2025-04-13 18:10:11,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:11,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:11,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 18:10:11,008 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 18:10:11,201 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 18:10:11,202 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 18:10:11,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 467106263, now seen corresponding path program 348 times [2025-04-13 18:10:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:11,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676843220] [2025-04-13 18:10:11,202 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:11,207 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:11,211 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:11,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:11,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676843220] [2025-04-13 18:10:11,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676843220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:11,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:11,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180736288] [2025-04-13 18:10:11,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:11,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:11,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:11,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:11,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:11,310 INFO L87 Difference]: Start difference. First operand 739 states and 1983 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 18:10:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:11,619 INFO L93 Difference]: Finished difference Result 822 states and 2187 transitions. [2025-04-13 18:10:11,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:11,620 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 18:10:11,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:11,629 INFO L225 Difference]: With dead ends: 822 [2025-04-13 18:10:11,629 INFO L226 Difference]: Without dead ends: 762 [2025-04-13 18:10:11,629 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 18:10:11,629 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 138 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:11,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 329 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-04-13 18:10:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 727. [2025-04-13 18:10:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 2.6928374655647382) internal successors, (1955), 726 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1955 transitions. [2025-04-13 18:10:11,641 INFO L79 Accepts]: Start accepts. Automaton has 727 states and 1955 transitions. Word has length 56 [2025-04-13 18:10:11,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:11,641 INFO L485 AbstractCegarLoop]: Abstraction has 727 states and 1955 transitions. [2025-04-13 18:10:11,641 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 18:10:11,641 INFO L278 IsEmpty]: Start isEmpty. Operand 727 states and 1955 transitions. [2025-04-13 18:10:11,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:11,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:11,642 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:11,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2025-04-13 18:10:11,642 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 18:10:11,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash -272244919, now seen corresponding path program 349 times [2025-04-13 18:10:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:11,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374804326] [2025-04-13 18:10:11,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:11,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:11,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:11,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:11,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:12,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374804326] [2025-04-13 18:10:12,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374804326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:12,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624825738] [2025-04-13 18:10:12,563 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:12,565 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 18:10:12,565 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 18:10:12,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:12,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:12,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:12,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:12,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:12,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:12,926 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 18:10:12,932 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 18:10:12,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:13,136 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:13,136 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 18:10:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624825738] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:10:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593248942] [2025-04-13 18:10:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:13,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:13,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:13,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:10:13,160 INFO L87 Difference]: Start difference. First operand 727 states and 1955 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 18:10:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:13,692 INFO L93 Difference]: Finished difference Result 807 states and 2152 transitions. [2025-04-13 18:10:13,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:13,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 18:10:13,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:13,701 INFO L225 Difference]: With dead ends: 807 [2025-04-13 18:10:13,701 INFO L226 Difference]: Without dead ends: 699 [2025-04-13 18:10:13,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:10:13,702 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 177 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:13,702 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 372 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:13,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-04-13 18:10:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 675. [2025-04-13 18:10:13,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 2.672106824925816) internal successors, (1801), 674 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1801 transitions. [2025-04-13 18:10:13,713 INFO L79 Accepts]: Start accepts. Automaton has 675 states and 1801 transitions. Word has length 56 [2025-04-13 18:10:13,713 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:13,713 INFO L485 AbstractCegarLoop]: Abstraction has 675 states and 1801 transitions. [2025-04-13 18:10:13,713 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 18:10:13,713 INFO L278 IsEmpty]: Start isEmpty. Operand 675 states and 1801 transitions. [2025-04-13 18:10:13,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:13,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:13,714 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:13,720 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 18:10:13,914 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 18:10:13,914 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 18:10:13,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash -489755367, now seen corresponding path program 350 times [2025-04-13 18:10:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:13,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766978046] [2025-04-13 18:10:13,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:13,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:13,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:13,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:13,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:14,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 18:10:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:14,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766978046] [2025-04-13 18:10:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766978046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512983484] [2025-04-13 18:10:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:14,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:14,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:14,016 INFO L87 Difference]: Start difference. First operand 675 states and 1801 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 18:10:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:14,313 INFO L93 Difference]: Finished difference Result 788 states and 2087 transitions. [2025-04-13 18:10:14,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:14,313 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 18:10:14,314 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:14,323 INFO L225 Difference]: With dead ends: 788 [2025-04-13 18:10:14,323 INFO L226 Difference]: Without dead ends: 710 [2025-04-13 18:10:14,323 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 18:10:14,323 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 206 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:14,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 298 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-04-13 18:10:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 683. [2025-04-13 18:10:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 2.6700879765395893) internal successors, (1821), 682 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1821 transitions. [2025-04-13 18:10:14,335 INFO L79 Accepts]: Start accepts. Automaton has 683 states and 1821 transitions. Word has length 56 [2025-04-13 18:10:14,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:14,335 INFO L485 AbstractCegarLoop]: Abstraction has 683 states and 1821 transitions. [2025-04-13 18:10:14,335 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 18:10:14,335 INFO L278 IsEmpty]: Start isEmpty. Operand 683 states and 1821 transitions. [2025-04-13 18:10:14,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:14,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:14,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 18:10:14,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2025-04-13 18:10:14,336 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 18:10:14,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1895797747, now seen corresponding path program 351 times [2025-04-13 18:10:14,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:14,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278781630] [2025-04-13 18:10:14,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:14,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:14,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:14,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:14,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:14,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:14,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 18:10:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:14,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278781630] [2025-04-13 18:10:14,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278781630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:14,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:14,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:14,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650073583] [2025-04-13 18:10:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:14,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:14,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:14,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:14,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:14,438 INFO L87 Difference]: Start difference. First operand 683 states and 1821 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 18:10:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:14,761 INFO L93 Difference]: Finished difference Result 850 states and 2257 transitions. [2025-04-13 18:10:14,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:10:14,761 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 18:10:14,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:14,771 INFO L225 Difference]: With dead ends: 850 [2025-04-13 18:10:14,771 INFO L226 Difference]: Without dead ends: 772 [2025-04-13 18:10:14,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:10:14,771 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 223 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:14,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 341 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-04-13 18:10:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 691. [2025-04-13 18:10:14,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 2.6739130434782608) internal successors, (1845), 690 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:14,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1845 transitions. [2025-04-13 18:10:14,784 INFO L79 Accepts]: Start accepts. Automaton has 691 states and 1845 transitions. Word has length 56 [2025-04-13 18:10:14,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:14,785 INFO L485 AbstractCegarLoop]: Abstraction has 691 states and 1845 transitions. [2025-04-13 18:10:14,785 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 18:10:14,785 INFO L278 IsEmpty]: Start isEmpty. Operand 691 states and 1845 transitions. [2025-04-13 18:10:14,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:14,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:14,785 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:14,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2025-04-13 18:10:14,785 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 18:10:14,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1927395109, now seen corresponding path program 352 times [2025-04-13 18:10:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:14,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302655671] [2025-04-13 18:10:14,786 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:14,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:14,793 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 18:10:14,793 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:14,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:14,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302655671] [2025-04-13 18:10:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302655671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:14,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:14,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19020607] [2025-04-13 18:10:14,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:14,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:14,872 INFO L87 Difference]: Start difference. First operand 691 states and 1845 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 18:10:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:15,192 INFO L93 Difference]: Finished difference Result 812 states and 2151 transitions. [2025-04-13 18:10:15,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:10:15,192 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 18:10:15,192 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:15,202 INFO L225 Difference]: With dead ends: 812 [2025-04-13 18:10:15,202 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 18:10:15,202 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 18:10:15,202 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 195 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:15,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 326 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 18:10:15,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 703. [2025-04-13 18:10:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 2.668091168091168) internal successors, (1873), 702 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1873 transitions. [2025-04-13 18:10:15,214 INFO L79 Accepts]: Start accepts. Automaton has 703 states and 1873 transitions. Word has length 56 [2025-04-13 18:10:15,214 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:15,214 INFO L485 AbstractCegarLoop]: Abstraction has 703 states and 1873 transitions. [2025-04-13 18:10:15,214 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 18:10:15,214 INFO L278 IsEmpty]: Start isEmpty. Operand 703 states and 1873 transitions. [2025-04-13 18:10:15,215 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:15,215 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:15,215 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:15,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2025-04-13 18:10:15,215 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 18:10:15,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 966781359, now seen corresponding path program 353 times [2025-04-13 18:10:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:15,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656954482] [2025-04-13 18:10:15,215 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:15,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:15,227 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:15,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:15,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:16,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656954482] [2025-04-13 18:10:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656954482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:16,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72152411] [2025-04-13 18:10:16,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:16,139 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 18:10:16,152 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 18:10:16,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:16,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:16,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:16,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:16,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:16,465 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:16,466 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 18:10:16,472 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 18:10:16,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:16,622 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:16,622 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 18:10:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:16,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72152411] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:16,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:16,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:16,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200264313] [2025-04-13 18:10:16,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:16,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:16,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:16,644 INFO L87 Difference]: Start difference. First operand 703 states and 1873 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 18:10:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:17,203 INFO L93 Difference]: Finished difference Result 839 states and 2218 transitions. [2025-04-13 18:10:17,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:10:17,203 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 18:10:17,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:17,212 INFO L225 Difference]: With dead ends: 839 [2025-04-13 18:10:17,212 INFO L226 Difference]: Without dead ends: 780 [2025-04-13 18:10:17,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=2350, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:10:17,213 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 202 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:17,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 362 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-04-13 18:10:17,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 703. [2025-04-13 18:10:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 2.668091168091168) internal successors, (1873), 702 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1873 transitions. [2025-04-13 18:10:17,225 INFO L79 Accepts]: Start accepts. Automaton has 703 states and 1873 transitions. Word has length 56 [2025-04-13 18:10:17,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:17,225 INFO L485 AbstractCegarLoop]: Abstraction has 703 states and 1873 transitions. [2025-04-13 18:10:17,225 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 18:10:17,225 INFO L278 IsEmpty]: Start isEmpty. Operand 703 states and 1873 transitions. [2025-04-13 18:10:17,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:17,226 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:17,226 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:17,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-04-13 18:10:17,426 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 18:10:17,426 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 18:10:17,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1874783513, now seen corresponding path program 354 times [2025-04-13 18:10:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:17,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057014308] [2025-04-13 18:10:17,427 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:17,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:17,437 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:17,437 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:17,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:17,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057014308] [2025-04-13 18:10:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057014308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:17,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:17,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783985145] [2025-04-13 18:10:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:17,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:17,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:17,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:17,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:17,537 INFO L87 Difference]: Start difference. First operand 703 states and 1873 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 18:10:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:17,849 INFO L93 Difference]: Finished difference Result 786 states and 2069 transitions. [2025-04-13 18:10:17,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:17,849 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 18:10:17,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:17,858 INFO L225 Difference]: With dead ends: 786 [2025-04-13 18:10:17,858 INFO L226 Difference]: Without dead ends: 730 [2025-04-13 18:10:17,859 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 18:10:17,859 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 150 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:17,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 325 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-04-13 18:10:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 703. [2025-04-13 18:10:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 2.6623931623931623) internal successors, (1869), 702 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1869 transitions. [2025-04-13 18:10:17,870 INFO L79 Accepts]: Start accepts. Automaton has 703 states and 1869 transitions. Word has length 56 [2025-04-13 18:10:17,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:17,870 INFO L485 AbstractCegarLoop]: Abstraction has 703 states and 1869 transitions. [2025-04-13 18:10:17,870 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 18:10:17,870 INFO L278 IsEmpty]: Start isEmpty. Operand 703 states and 1869 transitions. [2025-04-13 18:10:17,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:17,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:17,871 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:17,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2025-04-13 18:10:17,871 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 18:10:17,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -326011891, now seen corresponding path program 355 times [2025-04-13 18:10:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:17,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099293462] [2025-04-13 18:10:17,871 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:17,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:17,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:17,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:18,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 18:10:18,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:18,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099293462] [2025-04-13 18:10:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099293462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:18,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228952110] [2025-04-13 18:10:18,484 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:18,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:18,485 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 18:10:18,486 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 18:10:18,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:18,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:18,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:18,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:18,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:18,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:18,804 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:18,804 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 18:10:18,811 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 18:10:18,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:18,965 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:18,965 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 18:10:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228952110] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:18,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:18,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125556001] [2025-04-13 18:10:18,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:18,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:18,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:18,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:18,992 INFO L87 Difference]: Start difference. First operand 703 states and 1869 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 18:10:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:19,506 INFO L93 Difference]: Finished difference Result 801 states and 2108 transitions. [2025-04-13 18:10:19,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:19,506 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 18:10:19,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:19,515 INFO L225 Difference]: With dead ends: 801 [2025-04-13 18:10:19,515 INFO L226 Difference]: Without dead ends: 745 [2025-04-13 18:10:19,515 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=2166, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:10:19,515 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 171 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:19,515 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 351 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-04-13 18:10:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 695. [2025-04-13 18:10:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.664265129682997) internal successors, (1849), 694 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1849 transitions. [2025-04-13 18:10:19,529 INFO L79 Accepts]: Start accepts. Automaton has 695 states and 1849 transitions. Word has length 56 [2025-04-13 18:10:19,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:19,529 INFO L485 AbstractCegarLoop]: Abstraction has 695 states and 1849 transitions. [2025-04-13 18:10:19,529 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 18:10:19,529 INFO L278 IsEmpty]: Start isEmpty. Operand 695 states and 1849 transitions. [2025-04-13 18:10:19,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:19,530 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:19,530 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:19,536 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 18:10:19,730 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 18:10:19,730 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 18:10:19,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1618520073, now seen corresponding path program 356 times [2025-04-13 18:10:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:19,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881988828] [2025-04-13 18:10:19,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:19,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:19,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:19,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:19,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:19,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881988828] [2025-04-13 18:10:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881988828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2803002] [2025-04-13 18:10:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:19,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:19,837 INFO L87 Difference]: Start difference. First operand 695 states and 1849 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 18:10:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:20,148 INFO L93 Difference]: Finished difference Result 789 states and 2084 transitions. [2025-04-13 18:10:20,149 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:20,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 18:10:20,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:20,158 INFO L225 Difference]: With dead ends: 789 [2025-04-13 18:10:20,158 INFO L226 Difference]: Without dead ends: 730 [2025-04-13 18:10:20,159 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 18:10:20,159 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 188 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:20,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 326 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-04-13 18:10:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 703. [2025-04-13 18:10:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 2.6623931623931623) internal successors, (1869), 702 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1869 transitions. [2025-04-13 18:10:20,170 INFO L79 Accepts]: Start accepts. Automaton has 703 states and 1869 transitions. Word has length 56 [2025-04-13 18:10:20,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:20,171 INFO L485 AbstractCegarLoop]: Abstraction has 703 states and 1869 transitions. [2025-04-13 18:10:20,171 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 18:10:20,171 INFO L278 IsEmpty]: Start isEmpty. Operand 703 states and 1869 transitions. [2025-04-13 18:10:20,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:20,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:20,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 18:10:20,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2025-04-13 18:10:20,171 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 18:10:20,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1647395373, now seen corresponding path program 357 times [2025-04-13 18:10:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:20,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288518261] [2025-04-13 18:10:20,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:20,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:20,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:20,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:20,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288518261] [2025-04-13 18:10:20,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288518261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:20,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:20,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:20,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888605892] [2025-04-13 18:10:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:20,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:20,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:20,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:20,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:20,276 INFO L87 Difference]: Start difference. First operand 703 states and 1869 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 18:10:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:20,596 INFO L93 Difference]: Finished difference Result 808 states and 2131 transitions. [2025-04-13 18:10:20,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:10:20,596 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 18:10:20,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:20,606 INFO L225 Difference]: With dead ends: 808 [2025-04-13 18:10:20,606 INFO L226 Difference]: Without dead ends: 707 [2025-04-13 18:10:20,606 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 18:10:20,607 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 200 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:20,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 339 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-04-13 18:10:20,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 699. [2025-04-13 18:10:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 2.660458452722063) internal successors, (1857), 698 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 18:10:20,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1857 transitions. [2025-04-13 18:10:20,618 INFO L79 Accepts]: Start accepts. Automaton has 699 states and 1857 transitions. Word has length 56 [2025-04-13 18:10:20,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:20,618 INFO L485 AbstractCegarLoop]: Abstraction has 699 states and 1857 transitions. [2025-04-13 18:10:20,618 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 18:10:20,618 INFO L278 IsEmpty]: Start isEmpty. Operand 699 states and 1857 transitions. [2025-04-13 18:10:20,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:20,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:20,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 18:10:20,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2025-04-13 18:10:20,619 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 18:10:20,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash -2111308747, now seen corresponding path program 358 times [2025-04-13 18:10:20,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:20,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52525288] [2025-04-13 18:10:20,619 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:20,624 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:20,627 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 18:10:20,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:20,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:20,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 18:10:20,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:20,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52525288] [2025-04-13 18:10:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52525288] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:20,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306472544] [2025-04-13 18:10:20,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:20,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:20,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:20,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:20,707 INFO L87 Difference]: Start difference. First operand 699 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 18:10:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:20,994 INFO L93 Difference]: Finished difference Result 774 states and 2037 transitions. [2025-04-13 18:10:20,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:20,994 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 18:10:20,994 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:21,003 INFO L225 Difference]: With dead ends: 774 [2025-04-13 18:10:21,003 INFO L226 Difference]: Without dead ends: 722 [2025-04-13 18:10:21,003 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 18:10:21,003 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 144 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:21,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 317 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-04-13 18:10:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 695. [2025-04-13 18:10:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.65850144092219) internal successors, (1845), 694 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1845 transitions. [2025-04-13 18:10:21,015 INFO L79 Accepts]: Start accepts. Automaton has 695 states and 1845 transitions. Word has length 56 [2025-04-13 18:10:21,015 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:21,015 INFO L485 AbstractCegarLoop]: Abstraction has 695 states and 1845 transitions. [2025-04-13 18:10:21,015 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 18:10:21,015 INFO L278 IsEmpty]: Start isEmpty. Operand 695 states and 1845 transitions. [2025-04-13 18:10:21,016 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:21,016 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:21,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 18:10:21,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2025-04-13 18:10:21,016 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 18:10:21,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1920508687, now seen corresponding path program 359 times [2025-04-13 18:10:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:21,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561941727] [2025-04-13 18:10:21,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:21,021 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:21,028 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:21,029 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:21,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:21,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561941727] [2025-04-13 18:10:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561941727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:21,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136905426] [2025-04-13 18:10:21,963 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:21,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:21,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:21,965 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 18:10:21,966 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 18:10:22,107 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:22,128 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:22,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:22,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:22,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:10:22,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:22,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:22,288 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 18:10:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:22,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:10:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136905426] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:10:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 25 [2025-04-13 18:10:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072096151] [2025-04-13 18:10:22,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:22,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:22,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:22,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:22,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:10:22,295 INFO L87 Difference]: Start difference. First operand 695 states and 1845 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 18:10:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:22,926 INFO L93 Difference]: Finished difference Result 808 states and 2131 transitions. [2025-04-13 18:10:22,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:10:22,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 18:10:22,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:22,943 INFO L225 Difference]: With dead ends: 808 [2025-04-13 18:10:22,943 INFO L226 Difference]: Without dead ends: 749 [2025-04-13 18:10:22,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1886, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:10:22,944 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 199 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:22,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 368 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2025-04-13 18:10:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 699. [2025-04-13 18:10:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 2.654727793696275) internal successors, (1853), 698 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:22,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1853 transitions. [2025-04-13 18:10:22,958 INFO L79 Accepts]: Start accepts. Automaton has 699 states and 1853 transitions. Word has length 56 [2025-04-13 18:10:22,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:22,958 INFO L485 AbstractCegarLoop]: Abstraction has 699 states and 1853 transitions. [2025-04-13 18:10:22,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 18:10:22,958 INFO L278 IsEmpty]: Start isEmpty. Operand 699 states and 1853 transitions. [2025-04-13 18:10:22,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:22,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:22,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 18:10:22,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2025-04-13 18:10:23,159 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 18:10:23,160 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 18:10:23,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1840110395, now seen corresponding path program 360 times [2025-04-13 18:10:23,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:23,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816671644] [2025-04-13 18:10:23,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:23,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:23,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:23,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:23,169 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:23,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:23,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816671644] [2025-04-13 18:10:23,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816671644] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:23,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:23,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83277767] [2025-04-13 18:10:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:23,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:23,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:23,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:23,268 INFO L87 Difference]: Start difference. First operand 699 states and 1853 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 18:10:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:23,559 INFO L93 Difference]: Finished difference Result 755 states and 1978 transitions. [2025-04-13 18:10:23,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:23,559 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 18:10:23,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:23,569 INFO L225 Difference]: With dead ends: 755 [2025-04-13 18:10:23,569 INFO L226 Difference]: Without dead ends: 679 [2025-04-13 18:10:23,569 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 18:10:23,569 INFO L437 NwaCegarLoop]: 37 mSDtfsCounter, 146 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:23,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 311 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-04-13 18:10:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2025-04-13 18:10:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 2.6651917404129795) internal successors, (1807), 678 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1807 transitions. [2025-04-13 18:10:23,580 INFO L79 Accepts]: Start accepts. Automaton has 679 states and 1807 transitions. Word has length 56 [2025-04-13 18:10:23,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:23,580 INFO L485 AbstractCegarLoop]: Abstraction has 679 states and 1807 transitions. [2025-04-13 18:10:23,580 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 18:10:23,580 INFO L278 IsEmpty]: Start isEmpty. Operand 679 states and 1807 transitions. [2025-04-13 18:10:23,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:23,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:23,581 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:23,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2025-04-13 18:10:23,581 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 18:10:23,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1081665359, now seen corresponding path program 361 times [2025-04-13 18:10:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:23,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110798781] [2025-04-13 18:10:23,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:23,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:23,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:23,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:23,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:24,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110798781] [2025-04-13 18:10:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110798781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:24,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119093374] [2025-04-13 18:10:24,298 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:24,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:24,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:24,300 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 18:10:24,300 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 18:10:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:24,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:24,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:24,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:24,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:24,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:24,616 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:24,616 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 18:10:24,623 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 18:10:24,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:24,781 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:24,781 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 18:10:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:24,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119093374] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:24,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:24,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:24,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700570661] [2025-04-13 18:10:24,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:24,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:24,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:24,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:24,805 INFO L87 Difference]: Start difference. First operand 679 states and 1807 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 18:10:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:25,316 INFO L93 Difference]: Finished difference Result 754 states and 1987 transitions. [2025-04-13 18:10:25,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:25,316 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 18:10:25,316 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:25,326 INFO L225 Difference]: With dead ends: 754 [2025-04-13 18:10:25,326 INFO L226 Difference]: Without dead ends: 698 [2025-04-13 18:10:25,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=2175, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:10:25,327 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 149 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:25,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 365 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-04-13 18:10:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 671. [2025-04-13 18:10:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 2.6671641791044776) internal successors, (1787), 670 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1787 transitions. [2025-04-13 18:10:25,342 INFO L79 Accepts]: Start accepts. Automaton has 671 states and 1787 transitions. Word has length 56 [2025-04-13 18:10:25,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:25,342 INFO L485 AbstractCegarLoop]: Abstraction has 671 states and 1787 transitions. [2025-04-13 18:10:25,342 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 18:10:25,342 INFO L278 IsEmpty]: Start isEmpty. Operand 671 states and 1787 transitions. [2025-04-13 18:10:25,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:25,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:25,343 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:25,350 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 18:10:25,543 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 18:10:25,543 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 18:10:25,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:25,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1755381063, now seen corresponding path program 362 times [2025-04-13 18:10:25,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:25,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544594464] [2025-04-13 18:10:25,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:25,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:25,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:25,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:25,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:25,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 18:10:25,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:25,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544594464] [2025-04-13 18:10:25,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544594464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:25,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625541643] [2025-04-13 18:10:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:25,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:25,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:25,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:25,653 INFO L87 Difference]: Start difference. First operand 671 states and 1787 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 18:10:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:25,969 INFO L93 Difference]: Finished difference Result 765 states and 2022 transitions. [2025-04-13 18:10:25,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:25,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 18:10:25,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:25,978 INFO L225 Difference]: With dead ends: 765 [2025-04-13 18:10:25,978 INFO L226 Difference]: Without dead ends: 706 [2025-04-13 18:10:25,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:25,979 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 194 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:25,979 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 363 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-04-13 18:10:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 679. [2025-04-13 18:10:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 2.6651917404129795) internal successors, (1807), 678 states have internal predecessors, (1807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1807 transitions. [2025-04-13 18:10:25,990 INFO L79 Accepts]: Start accepts. Automaton has 679 states and 1807 transitions. Word has length 56 [2025-04-13 18:10:25,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:25,990 INFO L485 AbstractCegarLoop]: Abstraction has 679 states and 1807 transitions. [2025-04-13 18:10:25,990 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 18:10:25,990 INFO L278 IsEmpty]: Start isEmpty. Operand 679 states and 1807 transitions. [2025-04-13 18:10:25,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:25,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:25,991 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:25,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2025-04-13 18:10:25,991 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 18:10:25,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1390540395, now seen corresponding path program 363 times [2025-04-13 18:10:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:25,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731682634] [2025-04-13 18:10:25,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:25,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:26,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:26,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:26,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:26,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731682634] [2025-04-13 18:10:26,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731682634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:26,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:26,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656302644] [2025-04-13 18:10:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:26,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:26,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:26,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:26,097 INFO L87 Difference]: Start difference. First operand 679 states and 1807 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 18:10:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:26,400 INFO L93 Difference]: Finished difference Result 754 states and 1987 transitions. [2025-04-13 18:10:26,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:26,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 18:10:26,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:26,409 INFO L225 Difference]: With dead ends: 754 [2025-04-13 18:10:26,409 INFO L226 Difference]: Without dead ends: 702 [2025-04-13 18:10:26,409 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:10:26,409 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 153 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:26,410 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 355 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:26,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-04-13 18:10:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 675. [2025-04-13 18:10:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 2.663204747774481) internal successors, (1795), 674 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1795 transitions. [2025-04-13 18:10:26,420 INFO L79 Accepts]: Start accepts. Automaton has 675 states and 1795 transitions. Word has length 56 [2025-04-13 18:10:26,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:26,420 INFO L485 AbstractCegarLoop]: Abstraction has 675 states and 1795 transitions. [2025-04-13 18:10:26,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 18:10:26,420 INFO L278 IsEmpty]: Start isEmpty. Operand 675 states and 1795 transitions. [2025-04-13 18:10:26,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:26,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:26,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 18:10:26,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2025-04-13 18:10:26,421 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 18:10:26,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:26,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1703249405, now seen corresponding path program 364 times [2025-04-13 18:10:26,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:26,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956311672] [2025-04-13 18:10:26,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:26,426 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:26,428 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 18:10:26,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:26,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10: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 18:10:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:26,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956311672] [2025-04-13 18:10:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956311672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064568092] [2025-04-13 18:10:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:26,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:26,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:26,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:26,510 INFO L87 Difference]: Start difference. First operand 675 states and 1795 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 18:10:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:26,796 INFO L93 Difference]: Finished difference Result 731 states and 1920 transitions. [2025-04-13 18:10:26,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:26,796 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 18:10:26,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:26,806 INFO L225 Difference]: With dead ends: 731 [2025-04-13 18:10:26,806 INFO L226 Difference]: Without dead ends: 531 [2025-04-13 18:10:26,806 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:10:26,806 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 152 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:26,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 350 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-04-13 18:10:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-04-13 18:10:26,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 2.6622641509433964) internal successors, (1411), 530 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1411 transitions. [2025-04-13 18:10:26,819 INFO L79 Accepts]: Start accepts. Automaton has 531 states and 1411 transitions. Word has length 56 [2025-04-13 18:10:26,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:26,819 INFO L485 AbstractCegarLoop]: Abstraction has 531 states and 1411 transitions. [2025-04-13 18:10:26,819 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 18:10:26,819 INFO L278 IsEmpty]: Start isEmpty. Operand 531 states and 1411 transitions. [2025-04-13 18:10:26,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:26,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:26,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 18:10:26,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2025-04-13 18:10:26,820 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 18:10:26,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash -630820043, now seen corresponding path program 365 times [2025-04-13 18:10:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:26,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246779030] [2025-04-13 18:10:26,820 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:26,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:26,833 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:26,833 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:26,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:28,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:28,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246779030] [2025-04-13 18:10:28,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246779030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:28,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576941311] [2025-04-13 18:10:28,216 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:28,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:28,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:28,217 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 18:10:28,218 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 18:10:28,359 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:28,380 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:28,380 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:28,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 18:10:28,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:28,421 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 18:10:28,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:28,810 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 18:10:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:28,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:29,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 18:10:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576941311] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17, 16] total 41 [2025-04-13 18:10:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059605911] [2025-04-13 18:10:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:29,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:10:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:10:29,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1584, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:10:29,280 INFO L87 Difference]: Start difference. First operand 531 states and 1411 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 18:10:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:30,013 INFO L93 Difference]: Finished difference Result 755 states and 2010 transitions. [2025-04-13 18:10:30,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:30,013 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 18:10:30,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:30,022 INFO L225 Difference]: With dead ends: 755 [2025-04-13 18:10:30,022 INFO L226 Difference]: Without dead ends: 631 [2025-04-13 18:10:30,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=3155, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 18:10:30,023 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 262 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:30,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 540 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-04-13 18:10:30,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 599. [2025-04-13 18:10:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 2.6538461538461537) internal successors, (1587), 598 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1587 transitions. [2025-04-13 18:10:30,034 INFO L79 Accepts]: Start accepts. Automaton has 599 states and 1587 transitions. Word has length 56 [2025-04-13 18:10:30,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:30,034 INFO L485 AbstractCegarLoop]: Abstraction has 599 states and 1587 transitions. [2025-04-13 18:10:30,034 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 18:10:30,035 INFO L278 IsEmpty]: Start isEmpty. Operand 599 states and 1587 transitions. [2025-04-13 18:10:30,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:30,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:30,035 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:30,042 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 18:10:30,235 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 18:10:30,236 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 18:10:30,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash 474860117, now seen corresponding path program 366 times [2025-04-13 18:10:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:30,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689607850] [2025-04-13 18:10:30,236 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:30,241 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:30,245 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:30,245 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:30,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:30,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689607850] [2025-04-13 18:10:30,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689607850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:30,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:30,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329899208] [2025-04-13 18:10:30,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:30,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:30,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:30,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:30,343 INFO L87 Difference]: Start difference. First operand 599 states and 1587 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 18:10:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:30,681 INFO L93 Difference]: Finished difference Result 781 states and 2098 transitions. [2025-04-13 18:10:30,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:10:30,681 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 18:10:30,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:30,690 INFO L225 Difference]: With dead ends: 781 [2025-04-13 18:10:30,690 INFO L226 Difference]: Without dead ends: 684 [2025-04-13 18:10:30,691 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:10:30,691 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 257 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:30,691 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 404 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-04-13 18:10:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 632. [2025-04-13 18:10:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 2.6782884310618065) internal successors, (1690), 631 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1690 transitions. [2025-04-13 18:10:30,702 INFO L79 Accepts]: Start accepts. Automaton has 632 states and 1690 transitions. Word has length 56 [2025-04-13 18:10:30,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:30,702 INFO L485 AbstractCegarLoop]: Abstraction has 632 states and 1690 transitions. [2025-04-13 18:10:30,702 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 18:10:30,702 INFO L278 IsEmpty]: Start isEmpty. Operand 632 states and 1690 transitions. [2025-04-13 18:10:30,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:30,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:30,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 18:10:30,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2025-04-13 18:10:30,703 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 18:10:30,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash -756054413, now seen corresponding path program 367 times [2025-04-13 18:10:30,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:30,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787025968] [2025-04-13 18:10:30,703 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:30,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:30,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:30,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:30,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:30,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:31,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787025968] [2025-04-13 18:10:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787025968] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:31,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692888716] [2025-04-13 18:10:31,456 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:31,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:31,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:31,458 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 18:10:31,459 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 18:10:31,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:31,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:31,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:31,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:31,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:31,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:31,830 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:31,830 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 18:10:31,837 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 18:10:31,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:31,993 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:31,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 18:10:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692888716] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 30 [2025-04-13 18:10:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704329572] [2025-04-13 18:10:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:32,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:32,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:32,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:32,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:32,018 INFO L87 Difference]: Start difference. First operand 632 states and 1690 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 18:10:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:32,510 INFO L93 Difference]: Finished difference Result 830 states and 2249 transitions. [2025-04-13 18:10:32,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:32,511 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 18:10:32,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:32,521 INFO L225 Difference]: With dead ends: 830 [2025-04-13 18:10:32,521 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 18:10:32,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=2076, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:10:32,522 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 197 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:32,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 425 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 18:10:32,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 684. [2025-04-13 18:10:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 2.705710102489019) internal successors, (1848), 683 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1848 transitions. [2025-04-13 18:10:32,534 INFO L79 Accepts]: Start accepts. Automaton has 684 states and 1848 transitions. Word has length 56 [2025-04-13 18:10:32,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:32,534 INFO L485 AbstractCegarLoop]: Abstraction has 684 states and 1848 transitions. [2025-04-13 18:10:32,534 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 18:10:32,534 INFO L278 IsEmpty]: Start isEmpty. Operand 684 states and 1848 transitions. [2025-04-13 18:10:32,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:32,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:32,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 18:10:32,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2025-04-13 18:10:32,735 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 18:10:32,735 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 18:10:32,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:32,736 INFO L85 PathProgramCache]: Analyzing trace with hash -211005449, now seen corresponding path program 368 times [2025-04-13 18:10:32,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:32,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233125910] [2025-04-13 18:10:32,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:32,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:32,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:32,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:32,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:32,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:32,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233125910] [2025-04-13 18:10:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233125910] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:32,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:32,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:32,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960954272] [2025-04-13 18:10:32,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:32,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:32,842 INFO L87 Difference]: Start difference. First operand 684 states and 1848 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 18:10:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:33,150 INFO L93 Difference]: Finished difference Result 778 states and 2083 transitions. [2025-04-13 18:10:33,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:10:33,151 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 18:10:33,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:33,160 INFO L225 Difference]: With dead ends: 778 [2025-04-13 18:10:33,160 INFO L226 Difference]: Without dead ends: 719 [2025-04-13 18:10:33,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:10:33,160 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 171 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:33,160 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 401 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-04-13 18:10:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 684. [2025-04-13 18:10:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 2.705710102489019) internal successors, (1848), 683 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1848 transitions. [2025-04-13 18:10:33,178 INFO L79 Accepts]: Start accepts. Automaton has 684 states and 1848 transitions. Word has length 56 [2025-04-13 18:10:33,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:33,178 INFO L485 AbstractCegarLoop]: Abstraction has 684 states and 1848 transitions. [2025-04-13 18:10:33,178 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 18:10:33,178 INFO L278 IsEmpty]: Start isEmpty. Operand 684 states and 1848 transitions. [2025-04-13 18:10:33,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:33,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:33,179 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:33,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2025-04-13 18:10:33,179 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 18:10:33,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2048847663, now seen corresponding path program 369 times [2025-04-13 18:10:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:33,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126480011] [2025-04-13 18:10:33,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:33,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:33,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:33,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:33,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:33,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126480011] [2025-04-13 18:10:33,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126480011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:33,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:33,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454426465] [2025-04-13 18:10:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:33,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:33,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:33,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:33,282 INFO L87 Difference]: Start difference. First operand 684 states and 1848 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 18:10:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:33,558 INFO L93 Difference]: Finished difference Result 823 states and 2222 transitions. [2025-04-13 18:10:33,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:10:33,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 18:10:33,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:33,568 INFO L225 Difference]: With dead ends: 823 [2025-04-13 18:10:33,568 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 18:10:33,568 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 18:10:33,568 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 191 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:33,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 404 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 18:10:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 684. [2025-04-13 18:10:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 2.6998535871156664) internal successors, (1844), 683 states have internal predecessors, (1844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1844 transitions. [2025-04-13 18:10:33,580 INFO L79 Accepts]: Start accepts. Automaton has 684 states and 1844 transitions. Word has length 56 [2025-04-13 18:10:33,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:33,580 INFO L485 AbstractCegarLoop]: Abstraction has 684 states and 1844 transitions. [2025-04-13 18:10:33,580 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 18:10:33,580 INFO L278 IsEmpty]: Start isEmpty. Operand 684 states and 1844 transitions. [2025-04-13 18:10:33,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:33,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:33,581 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:33,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2025-04-13 18:10:33,581 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 18:10:33,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -703794123, now seen corresponding path program 370 times [2025-04-13 18:10:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:33,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126838498] [2025-04-13 18:10:33,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:33,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:33,588 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 18:10:33,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:33,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:33,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:33,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126838498] [2025-04-13 18:10:33,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126838498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:33,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:33,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:33,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405003069] [2025-04-13 18:10:33,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:33,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:33,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:33,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:33,666 INFO L87 Difference]: Start difference. First operand 684 states and 1844 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 18:10:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:33,961 INFO L93 Difference]: Finished difference Result 740 states and 1973 transitions. [2025-04-13 18:10:33,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:10:33,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 18:10:33,962 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:33,971 INFO L225 Difference]: With dead ends: 740 [2025-04-13 18:10:33,971 INFO L226 Difference]: Without dead ends: 680 [2025-04-13 18:10:33,971 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:10:33,971 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 158 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:33,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 397 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-04-13 18:10:33,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 672. [2025-04-13 18:10:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.700447093889717) internal successors, (1812), 671 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1812 transitions. [2025-04-13 18:10:33,983 INFO L79 Accepts]: Start accepts. Automaton has 672 states and 1812 transitions. Word has length 56 [2025-04-13 18:10:33,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:33,983 INFO L485 AbstractCegarLoop]: Abstraction has 672 states and 1812 transitions. [2025-04-13 18:10:33,983 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 18:10:33,983 INFO L278 IsEmpty]: Start isEmpty. Operand 672 states and 1812 transitions. [2025-04-13 18:10:33,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:33,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:33,984 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:33,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2025-04-13 18:10:33,984 INFO L403 AbstractCegarLoop]: === Iteration 372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:33,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1902571479, now seen corresponding path program 371 times [2025-04-13 18:10:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:33,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911047372] [2025-04-13 18:10:33,984 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:33,989 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:33,997 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:33,997 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:33,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:35,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911047372] [2025-04-13 18:10:35,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911047372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:35,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354744037] [2025-04-13 18:10:35,357 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:35,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:35,359 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:35,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-04-13 18:10:35,505 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:35,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:35,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:35,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 18:10:35,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:35,745 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:35,745 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 18:10:35,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 18:10:35,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:35,961 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:35,962 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 18:10:35,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 18:10:35,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354744037] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:35,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:35,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:10:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504558991] [2025-04-13 18:10:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:35,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:35,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:35,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1103, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:10:35,988 INFO L87 Difference]: Start difference. First operand 672 states and 1812 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 18:10:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:36,511 INFO L93 Difference]: Finished difference Result 815 states and 2198 transitions. [2025-04-13 18:10:36,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:10:36,511 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 18:10:36,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:36,520 INFO L225 Difference]: With dead ends: 815 [2025-04-13 18:10:36,520 INFO L226 Difference]: Without dead ends: 721 [2025-04-13 18:10:36,520 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=2541, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 18:10:36,521 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 209 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:36,521 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 419 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-04-13 18:10:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 634. [2025-04-13 18:10:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 2.677725118483412) internal successors, (1695), 633 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1695 transitions. [2025-04-13 18:10:36,532 INFO L79 Accepts]: Start accepts. Automaton has 634 states and 1695 transitions. Word has length 56 [2025-04-13 18:10:36,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:36,532 INFO L485 AbstractCegarLoop]: Abstraction has 634 states and 1695 transitions. [2025-04-13 18:10:36,532 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 18:10:36,532 INFO L278 IsEmpty]: Start isEmpty. Operand 634 states and 1695 transitions. [2025-04-13 18:10:36,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:36,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:36,533 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:36,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:36,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:36,733 INFO L403 AbstractCegarLoop]: === Iteration 373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:36,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1505546837, now seen corresponding path program 372 times [2025-04-13 18:10:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:36,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968158063] [2025-04-13 18:10:36,734 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:36,739 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:36,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:36,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:36,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:36,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 18:10:36,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:36,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968158063] [2025-04-13 18:10:36,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968158063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:36,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794646835] [2025-04-13 18:10:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:36,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:36,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:36,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:36,838 INFO L87 Difference]: Start difference. First operand 634 states and 1695 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 18:10:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:37,157 INFO L93 Difference]: Finished difference Result 728 states and 1930 transitions. [2025-04-13 18:10:37,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:10:37,158 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 18:10:37,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:37,167 INFO L225 Difference]: With dead ends: 728 [2025-04-13 18:10:37,167 INFO L226 Difference]: Without dead ends: 669 [2025-04-13 18:10:37,167 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:10:37,167 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 202 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:37,167 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 399 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2025-04-13 18:10:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 642. [2025-04-13 18:10:37,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 2.6755070202808113) internal successors, (1715), 641 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1715 transitions. [2025-04-13 18:10:37,179 INFO L79 Accepts]: Start accepts. Automaton has 642 states and 1715 transitions. Word has length 56 [2025-04-13 18:10:37,179 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:37,179 INFO L485 AbstractCegarLoop]: Abstraction has 642 states and 1715 transitions. [2025-04-13 18:10:37,179 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 18:10:37,179 INFO L278 IsEmpty]: Start isEmpty. Operand 642 states and 1715 transitions. [2025-04-13 18:10:37,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:37,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:37,179 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:37,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2025-04-13 18:10:37,179 INFO L403 AbstractCegarLoop]: === Iteration 374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:37,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:37,180 INFO L85 PathProgramCache]: Analyzing trace with hash -459571961, now seen corresponding path program 373 times [2025-04-13 18:10:37,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:37,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363033972] [2025-04-13 18:10:37,180 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:37,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:37,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:37,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:37,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:37,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 18:10:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:37,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363033972] [2025-04-13 18:10:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363033972] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:37,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730854433] [2025-04-13 18:10:37,924 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:37,926 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:37,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-04-13 18:10:38,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:38,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:38,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:38,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:38,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:38,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:38,270 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:38,270 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 18:10:38,304 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 18:10:38,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:38,458 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:38,458 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 18:10:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730854433] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:10:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878617312] [2025-04-13 18:10:38,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:38,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:38,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:38,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=1032, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:10:38,484 INFO L87 Difference]: Start difference. First operand 642 states and 1715 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 18:10:38,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:38,952 INFO L93 Difference]: Finished difference Result 729 states and 1923 transitions. [2025-04-13 18:10:38,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:10:38,953 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 18:10:38,953 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:38,962 INFO L225 Difference]: With dead ends: 729 [2025-04-13 18:10:38,962 INFO L226 Difference]: Without dead ends: 677 [2025-04-13 18:10:38,963 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=2437, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:10:38,963 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 171 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:38,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 356 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-04-13 18:10:38,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 650. [2025-04-13 18:10:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 2.667180277349769) internal successors, (1731), 649 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:38,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1731 transitions. [2025-04-13 18:10:38,977 INFO L79 Accepts]: Start accepts. Automaton has 650 states and 1731 transitions. Word has length 56 [2025-04-13 18:10:38,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:38,977 INFO L485 AbstractCegarLoop]: Abstraction has 650 states and 1731 transitions. [2025-04-13 18:10:38,977 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 18:10:38,977 INFO L278 IsEmpty]: Start isEmpty. Operand 650 states and 1731 transitions. [2025-04-13 18:10:38,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:38,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:38,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 18:10:38,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:39,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373,125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:39,178 INFO L403 AbstractCegarLoop]: === Iteration 375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:39,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1012758163, now seen corresponding path program 374 times [2025-04-13 18:10:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:39,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54811419] [2025-04-13 18:10:39,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:39,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:39,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:39,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:39,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:39,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:39,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:39,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54811419] [2025-04-13 18:10:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54811419] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:39,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:39,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344836886] [2025-04-13 18:10:39,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:39,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:39,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:39,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:39,283 INFO L87 Difference]: Start difference. First operand 650 states and 1731 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 18:10:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:39,592 INFO L93 Difference]: Finished difference Result 725 states and 1911 transitions. [2025-04-13 18:10:39,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:10:39,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 18:10:39,592 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:39,602 INFO L225 Difference]: With dead ends: 725 [2025-04-13 18:10:39,602 INFO L226 Difference]: Without dead ends: 673 [2025-04-13 18:10:39,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:10:39,602 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 157 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:39,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 403 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-04-13 18:10:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 638. [2025-04-13 18:10:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.673469387755102) internal successors, (1703), 637 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1703 transitions. [2025-04-13 18:10:39,614 INFO L79 Accepts]: Start accepts. Automaton has 638 states and 1703 transitions. Word has length 56 [2025-04-13 18:10:39,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:39,614 INFO L485 AbstractCegarLoop]: Abstraction has 638 states and 1703 transitions. [2025-04-13 18:10:39,614 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 18:10:39,614 INFO L278 IsEmpty]: Start isEmpty. Operand 638 states and 1703 transitions. [2025-04-13 18:10:39,614 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:39,614 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:39,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 18:10:39,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2025-04-13 18:10:39,614 INFO L403 AbstractCegarLoop]: === Iteration 376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:39,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash -803120115, now seen corresponding path program 375 times [2025-04-13 18:10:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:39,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956103019] [2025-04-13 18:10:39,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:39,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:39,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:39,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:39,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:39,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:39,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 18:10:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:39,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956103019] [2025-04-13 18:10:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956103019] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480727048] [2025-04-13 18:10:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:39,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:39,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:39,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:39,714 INFO L87 Difference]: Start difference. First operand 638 states and 1703 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 18:10:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:39,970 INFO L93 Difference]: Finished difference Result 702 states and 1844 transitions. [2025-04-13 18:10:39,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:39,970 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 18:10:39,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:39,979 INFO L225 Difference]: With dead ends: 702 [2025-04-13 18:10:39,980 INFO L226 Difference]: Without dead ends: 604 [2025-04-13 18:10:39,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:10:39,980 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 157 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:39,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 353 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-04-13 18:10:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-04-13 18:10:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 2.6434494195688227) internal successors, (1594), 603 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1594 transitions. [2025-04-13 18:10:39,991 INFO L79 Accepts]: Start accepts. Automaton has 604 states and 1594 transitions. Word has length 56 [2025-04-13 18:10:39,991 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:39,991 INFO L485 AbstractCegarLoop]: Abstraction has 604 states and 1594 transitions. [2025-04-13 18:10:39,991 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 18:10:39,991 INFO L278 IsEmpty]: Start isEmpty. Operand 604 states and 1594 transitions. [2025-04-13 18:10:39,991 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:39,991 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:39,991 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:39,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2025-04-13 18:10:39,991 INFO L403 AbstractCegarLoop]: === Iteration 377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:39,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 669210009, now seen corresponding path program 376 times [2025-04-13 18:10:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:39,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162172723] [2025-04-13 18:10:39,992 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:39,997 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:39,999 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 18:10:39,999 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:39,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:40,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162172723] [2025-04-13 18:10:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162172723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119812706] [2025-04-13 18:10:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:40,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:40,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:40,081 INFO L87 Difference]: Start difference. First operand 604 states and 1594 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 18:10:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:40,376 INFO L93 Difference]: Finished difference Result 660 states and 1719 transitions. [2025-04-13 18:10:40,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:10:40,376 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 18:10:40,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:40,385 INFO L225 Difference]: With dead ends: 660 [2025-04-13 18:10:40,386 INFO L226 Difference]: Without dead ends: 558 [2025-04-13 18:10:40,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:10:40,386 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 164 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:40,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 392 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:40,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-04-13 18:10:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2025-04-13 18:10:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.673249551166966) internal successors, (1489), 557 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1489 transitions. [2025-04-13 18:10:40,396 INFO L79 Accepts]: Start accepts. Automaton has 558 states and 1489 transitions. Word has length 56 [2025-04-13 18:10:40,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:40,396 INFO L485 AbstractCegarLoop]: Abstraction has 558 states and 1489 transitions. [2025-04-13 18:10:40,396 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 18:10:40,397 INFO L278 IsEmpty]: Start isEmpty. Operand 558 states and 1489 transitions. [2025-04-13 18:10:40,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:40,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:40,397 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:40,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2025-04-13 18:10:40,397 INFO L403 AbstractCegarLoop]: === Iteration 378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:40,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash -832942885, now seen corresponding path program 377 times [2025-04-13 18:10:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:40,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134129556] [2025-04-13 18:10:40,398 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:40,402 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:40,411 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:40,411 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:40,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:41,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134129556] [2025-04-13 18:10:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134129556] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:41,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261999429] [2025-04-13 18:10:41,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:41,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:41,320 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:41,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-04-13 18:10:41,473 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:41,491 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:41,491 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:41,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:41,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:10:41,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:41,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:41,699 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 18:10:41,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 18:10:41,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:10:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261999429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:10:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 24 [2025-04-13 18:10:41,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083192847] [2025-04-13 18:10:41,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:41,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:41,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:41,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:10:41,707 INFO L87 Difference]: Start difference. First operand 558 states and 1489 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 18:10:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:42,349 INFO L93 Difference]: Finished difference Result 702 states and 1846 transitions. [2025-04-13 18:10:42,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:42,349 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 18:10:42,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:42,358 INFO L225 Difference]: With dead ends: 702 [2025-04-13 18:10:42,358 INFO L226 Difference]: Without dead ends: 460 [2025-04-13 18:10:42,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:10:42,359 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 187 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:42,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 451 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:10:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-04-13 18:10:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-04-13 18:10:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.588235294117647) internal successors, (1188), 459 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1188 transitions. [2025-04-13 18:10:42,368 INFO L79 Accepts]: Start accepts. Automaton has 460 states and 1188 transitions. Word has length 56 [2025-04-13 18:10:42,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:42,368 INFO L485 AbstractCegarLoop]: Abstraction has 460 states and 1188 transitions. [2025-04-13 18:10:42,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 18:10:42,368 INFO L278 IsEmpty]: Start isEmpty. Operand 460 states and 1188 transitions. [2025-04-13 18:10:42,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:42,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:42,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 18:10:42,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2025-04-13 18:10:42,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable377 [2025-04-13 18:10:42,569 INFO L403 AbstractCegarLoop]: === Iteration 379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:42,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash 105809049, now seen corresponding path program 378 times [2025-04-13 18:10:42,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:42,569 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274775790] [2025-04-13 18:10:42,570 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:42,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:42,574 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:42,578 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:42,578 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:42,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:42,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274775790] [2025-04-13 18:10:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274775790] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:42,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:42,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876023523] [2025-04-13 18:10:42,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:42,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:42,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:42,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:42,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:42,681 INFO L87 Difference]: Start difference. First operand 460 states and 1188 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 18:10:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:42,915 INFO L93 Difference]: Finished difference Result 519 states and 1324 transitions. [2025-04-13 18:10:42,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:10:42,915 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 18:10:42,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:42,931 INFO L225 Difference]: With dead ends: 519 [2025-04-13 18:10:42,931 INFO L226 Difference]: Without dead ends: 441 [2025-04-13 18:10:42,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 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 18:10:42,931 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 105 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:42,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 344 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-04-13 18:10:42,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2025-04-13 18:10:42,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 2.575) internal successors, (1133), 440 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1133 transitions. [2025-04-13 18:10:42,942 INFO L79 Accepts]: Start accepts. Automaton has 441 states and 1133 transitions. Word has length 56 [2025-04-13 18:10:42,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:42,942 INFO L485 AbstractCegarLoop]: Abstraction has 441 states and 1133 transitions. [2025-04-13 18:10:42,942 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 18:10:42,942 INFO L278 IsEmpty]: Start isEmpty. Operand 441 states and 1133 transitions. [2025-04-13 18:10:42,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:42,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:42,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 18:10:42,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2025-04-13 18:10:42,943 INFO L403 AbstractCegarLoop]: === Iteration 380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:42,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 804922993, now seen corresponding path program 379 times [2025-04-13 18:10:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:42,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282015905] [2025-04-13 18:10:42,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:42,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:42,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:42,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:43,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282015905] [2025-04-13 18:10:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282015905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:43,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380743599] [2025-04-13 18:10:43,697 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:43,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:43,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:43,698 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:43,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-04-13 18:10:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:43,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:43,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:43,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:43,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:43,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:44,060 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:44,060 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 18:10:44,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 18:10:44,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:44,268 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:44,268 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 18:10:44,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 18:10:44,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380743599] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:44,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:44,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:10:44,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100937289] [2025-04-13 18:10:44,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:44,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:44,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:44,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:44,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:10:44,297 INFO L87 Difference]: Start difference. First operand 441 states and 1133 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 18:10:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:44,743 INFO L93 Difference]: Finished difference Result 653 states and 1692 transitions. [2025-04-13 18:10:44,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:44,744 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 18:10:44,744 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:44,752 INFO L225 Difference]: With dead ends: 653 [2025-04-13 18:10:44,752 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 18:10:44,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=2258, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:10:44,753 INFO L437 NwaCegarLoop]: 53 mSDtfsCounter, 143 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:44,753 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 442 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 18:10:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 485. [2025-04-13 18:10:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.5351239669421486) internal successors, (1227), 484 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 18:10:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1227 transitions. [2025-04-13 18:10:44,763 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1227 transitions. Word has length 56 [2025-04-13 18:10:44,763 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:44,763 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1227 transitions. [2025-04-13 18:10:44,763 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 18:10:44,764 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1227 transitions. [2025-04-13 18:10:44,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:44,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:44,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 18:10:44,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2025-04-13 18:10:44,964 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:44,964 INFO L403 AbstractCegarLoop]: === Iteration 381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:44,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1331830693, now seen corresponding path program 380 times [2025-04-13 18:10:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:44,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656233517] [2025-04-13 18:10:44,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:44,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:44,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:44,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:44,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:45,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:45,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656233517] [2025-04-13 18:10:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656233517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139838958] [2025-04-13 18:10:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:45,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:45,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:45,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:45,069 INFO L87 Difference]: Start difference. First operand 485 states and 1227 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 18:10:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:45,317 INFO L93 Difference]: Finished difference Result 571 states and 1438 transitions. [2025-04-13 18:10:45,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:45,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 18:10:45,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:45,326 INFO L225 Difference]: With dead ends: 571 [2025-04-13 18:10:45,326 INFO L226 Difference]: Without dead ends: 512 [2025-04-13 18:10:45,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 18:10:45,327 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 112 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:45,327 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 345 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-13 18:10:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 489. [2025-04-13 18:10:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.5307377049180326) internal successors, (1235), 488 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1235 transitions. [2025-04-13 18:10:45,336 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1235 transitions. Word has length 56 [2025-04-13 18:10:45,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:45,336 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1235 transitions. [2025-04-13 18:10:45,336 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 18:10:45,336 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1235 transitions. [2025-04-13 18:10:45,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:45,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:45,337 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:45,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2025-04-13 18:10:45,337 INFO L403 AbstractCegarLoop]: === Iteration 382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:45,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 679688623, now seen corresponding path program 381 times [2025-04-13 18:10:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:45,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666523982] [2025-04-13 18:10:45,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:45,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:45,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:45,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:45,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:45,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:45,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:45,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666523982] [2025-04-13 18:10:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666523982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:45,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:45,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:45,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359910461] [2025-04-13 18:10:45,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:45,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:45,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:45,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:45,438 INFO L87 Difference]: Start difference. First operand 489 states and 1235 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 18:10:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:45,695 INFO L93 Difference]: Finished difference Result 599 states and 1518 transitions. [2025-04-13 18:10:45,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:45,695 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 18:10:45,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:45,704 INFO L225 Difference]: With dead ends: 599 [2025-04-13 18:10:45,704 INFO L226 Difference]: Without dead ends: 540 [2025-04-13 18:10:45,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:10:45,705 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:45,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 388 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:45,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-04-13 18:10:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 493. [2025-04-13 18:10:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 2.5345528455284554) internal successors, (1247), 492 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1247 transitions. [2025-04-13 18:10:45,714 INFO L79 Accepts]: Start accepts. Automaton has 493 states and 1247 transitions. Word has length 56 [2025-04-13 18:10:45,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:45,714 INFO L485 AbstractCegarLoop]: Abstraction has 493 states and 1247 transitions. [2025-04-13 18:10:45,714 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 18:10:45,714 INFO L278 IsEmpty]: Start isEmpty. Operand 493 states and 1247 transitions. [2025-04-13 18:10:45,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:45,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:45,715 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:45,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2025-04-13 18:10:45,715 INFO L403 AbstractCegarLoop]: === Iteration 383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:45,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1824619367, now seen corresponding path program 382 times [2025-04-13 18:10:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:45,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21041603] [2025-04-13 18:10:45,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:45,721 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:45,723 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 18:10:45,723 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:45,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 18:10:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:45,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21041603] [2025-04-13 18:10:45,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21041603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:45,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:45,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:45,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369045874] [2025-04-13 18:10:45,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:45,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:45,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:45,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:45,800 INFO L87 Difference]: Start difference. First operand 493 states and 1247 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 18:10:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:46,024 INFO L93 Difference]: Finished difference Result 545 states and 1360 transitions. [2025-04-13 18:10:46,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:10:46,025 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 18:10:46,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:46,033 INFO L225 Difference]: With dead ends: 545 [2025-04-13 18:10:46,033 INFO L226 Difference]: Without dead ends: 489 [2025-04-13 18:10:46,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:10:46,034 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 86 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:46,034 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 337 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-13 18:10:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-04-13 18:10:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 2.5307377049180326) internal successors, (1235), 488 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1235 transitions. [2025-04-13 18:10:46,044 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1235 transitions. Word has length 56 [2025-04-13 18:10:46,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:46,045 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1235 transitions. [2025-04-13 18:10:46,045 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 18:10:46,045 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1235 transitions. [2025-04-13 18:10:46,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:46,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:46,045 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:46,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2025-04-13 18:10:46,045 INFO L403 AbstractCegarLoop]: === Iteration 384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:46,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -613104627, now seen corresponding path program 383 times [2025-04-13 18:10:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:46,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853473655] [2025-04-13 18:10:46,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:46,052 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:46,059 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:46,060 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:46,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:47,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 18:10:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:47,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853473655] [2025-04-13 18:10:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853473655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:47,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801435555] [2025-04-13 18:10:47,264 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:47,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:47,266 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:47,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-04-13 18:10:47,410 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:47,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:47,432 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:47,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:47,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 18:10:47,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:47,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:47,639 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 18:10: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 18:10:47,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 18:10:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801435555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:47,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 18:10:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 26 [2025-04-13 18:10:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299510954] [2025-04-13 18:10:47,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:47,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:10:47,677 INFO L87 Difference]: Start difference. First operand 489 states and 1235 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 18:10:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:48,305 INFO L93 Difference]: Finished difference Result 600 states and 1497 transitions. [2025-04-13 18:10:48,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:10:48,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 18:10:48,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:48,318 INFO L225 Difference]: With dead ends: 600 [2025-04-13 18:10:48,318 INFO L226 Difference]: Without dead ends: 528 [2025-04-13 18:10:48,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:10:48,318 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:48,318 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 409 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:10:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-04-13 18:10:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 485. [2025-04-13 18:10:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.5268595041322315) internal successors, (1223), 484 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1223 transitions. [2025-04-13 18:10:48,331 INFO L79 Accepts]: Start accepts. Automaton has 485 states and 1223 transitions. Word has length 56 [2025-04-13 18:10:48,331 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:48,331 INFO L485 AbstractCegarLoop]: Abstraction has 485 states and 1223 transitions. [2025-04-13 18:10:48,331 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 18:10:48,332 INFO L278 IsEmpty]: Start isEmpty. Operand 485 states and 1223 transitions. [2025-04-13 18:10:48,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:48,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:48,332 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:48,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:48,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:48,536 INFO L403 AbstractCegarLoop]: === Iteration 385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:48,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1022955657, now seen corresponding path program 384 times [2025-04-13 18:10:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:48,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350383951] [2025-04-13 18:10:48,536 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:48,542 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:48,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:48,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:48,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:48,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350383951] [2025-04-13 18:10:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350383951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421136367] [2025-04-13 18:10:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:48,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:48,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:48,635 INFO L87 Difference]: Start difference. First operand 485 states and 1223 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 18:10:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:48,891 INFO L93 Difference]: Finished difference Result 579 states and 1458 transitions. [2025-04-13 18:10:48,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:48,892 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 18:10:48,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:48,901 INFO L225 Difference]: With dead ends: 579 [2025-04-13 18:10:48,901 INFO L226 Difference]: Without dead ends: 520 [2025-04-13 18:10:48,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:10:48,901 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 138 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:48,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 336 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-04-13 18:10:48,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 493. [2025-04-13 18:10:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 2.5264227642276422) internal successors, (1243), 492 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1243 transitions. [2025-04-13 18:10:48,913 INFO L79 Accepts]: Start accepts. Automaton has 493 states and 1243 transitions. Word has length 56 [2025-04-13 18:10:48,913 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:48,913 INFO L485 AbstractCegarLoop]: Abstraction has 493 states and 1243 transitions. [2025-04-13 18:10:48,913 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 18:10:48,913 INFO L278 IsEmpty]: Start isEmpty. Operand 493 states and 1243 transitions. [2025-04-13 18:10:48,914 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:48,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:48,914 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:48,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2025-04-13 18:10:48,914 INFO L403 AbstractCegarLoop]: === Iteration 386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:48,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash -956652781, now seen corresponding path program 385 times [2025-04-13 18:10:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:48,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996029668] [2025-04-13 18:10:48,914 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:48,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:49,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:49,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996029668] [2025-04-13 18:10:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996029668] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:49,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122821815] [2025-04-13 18:10:49,714 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:49,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:49,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:49,716 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-13 18:10:49,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:49,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:49,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:49,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:49,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:49,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:50,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:50,098 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 18:10:50,103 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 18:10:50,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:50,291 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:50,291 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 18:10:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:50,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122821815] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:50,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:50,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16, 12] total 32 [2025-04-13 18:10:50,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494427473] [2025-04-13 18:10:50,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:50,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:50,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:50,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=978, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:10:50,316 INFO L87 Difference]: Start difference. First operand 493 states and 1243 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 18:10:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:50,777 INFO L93 Difference]: Finished difference Result 557 states and 1392 transitions. [2025-04-13 18:10:50,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:10:50,777 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 18:10:50,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:50,786 INFO L225 Difference]: With dead ends: 557 [2025-04-13 18:10:50,786 INFO L226 Difference]: Without dead ends: 453 [2025-04-13 18:10:50,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=2169, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:10:50,786 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:50,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 398 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-04-13 18:10:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2025-04-13 18:10:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.470720720720721) internal successors, (1097), 444 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1097 transitions. [2025-04-13 18:10:50,795 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1097 transitions. Word has length 56 [2025-04-13 18:10:50,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:50,795 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1097 transitions. [2025-04-13 18:10:50,795 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 18:10:50,795 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1097 transitions. [2025-04-13 18:10:50,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:50,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:50,796 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:50,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:50,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:50,996 INFO L403 AbstractCegarLoop]: === Iteration 387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:50,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1515744331, now seen corresponding path program 386 times [2025-04-13 18:10:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:50,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196356364] [2025-04-13 18:10:50,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:50,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:51,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:51,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:51,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:51,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:51,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 18:10:51,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:51,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196356364] [2025-04-13 18:10:51,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196356364] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:51,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077030774] [2025-04-13 18:10:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:51,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:51,094 INFO L87 Difference]: Start difference. First operand 445 states and 1097 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 18:10:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:51,325 INFO L93 Difference]: Finished difference Result 520 states and 1277 transitions. [2025-04-13 18:10:51,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:51,325 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 18:10:51,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:51,333 INFO L225 Difference]: With dead ends: 520 [2025-04-13 18:10:51,333 INFO L226 Difference]: Without dead ends: 468 [2025-04-13 18:10:51,334 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:10:51,334 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 101 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:51,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 337 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:10:51,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-04-13 18:10:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 441. [2025-04-13 18:10:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 2.465909090909091) internal successors, (1085), 440 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:51,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1085 transitions. [2025-04-13 18:10:51,343 INFO L79 Accepts]: Start accepts. Automaton has 441 states and 1085 transitions. Word has length 56 [2025-04-13 18:10:51,343 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:51,343 INFO L485 AbstractCegarLoop]: Abstraction has 441 states and 1085 transitions. [2025-04-13 18:10:51,343 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 18:10:51,343 INFO L278 IsEmpty]: Start isEmpty. Operand 441 states and 1085 transitions. [2025-04-13 18:10:51,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:51,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:51,343 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:51,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2025-04-13 18:10:51,343 INFO L403 AbstractCegarLoop]: === Iteration 388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:51,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:51,344 INFO L85 PathProgramCache]: Analyzing trace with hash 632622921, now seen corresponding path program 387 times [2025-04-13 18:10:51,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:51,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462008038] [2025-04-13 18:10:51,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:10:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:51,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:51,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:51,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:10:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:51,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 18:10:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:51,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462008038] [2025-04-13 18:10:51,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462008038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:51,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 18:10:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970985321] [2025-04-13 18:10:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:51,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:10:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:10:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:10:51,446 INFO L87 Difference]: Start difference. First operand 441 states and 1085 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 18:10:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:51,680 INFO L93 Difference]: Finished difference Result 497 states and 1210 transitions. [2025-04-13 18:10:51,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:51,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 18:10:51,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:51,689 INFO L225 Difference]: With dead ends: 497 [2025-04-13 18:10:51,689 INFO L226 Difference]: Without dead ends: 389 [2025-04-13 18:10:51,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:10:51,689 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 103 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:51,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 334 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:10:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-04-13 18:10:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-04-13 18:10:51,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.4871134020618557) internal successors, (965), 388 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 965 transitions. [2025-04-13 18:10:51,697 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 965 transitions. Word has length 56 [2025-04-13 18:10:51,698 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:51,698 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 965 transitions. [2025-04-13 18:10:51,698 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 18:10:51,698 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 965 transitions. [2025-04-13 18:10:51,698 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:51,698 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:51,698 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:51,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2025-04-13 18:10:51,698 INFO L403 AbstractCegarLoop]: === Iteration 389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:51,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 540271317, now seen corresponding path program 388 times [2025-04-13 18:10:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:51,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774509541] [2025-04-13 18:10:51,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:51,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:51,704 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:51,706 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 18:10:51,706 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:10:51,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:51,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:51,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774509541] [2025-04-13 18:10:51,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774509541] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:51,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:51,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:51,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991392002] [2025-04-13 18:10:51,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:51,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:51,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:51,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:51,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:51,778 INFO L87 Difference]: Start difference. First operand 389 states and 965 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 18:10:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:52,040 INFO L93 Difference]: Finished difference Result 429 states and 1050 transitions. [2025-04-13 18:10:52,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:52,040 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 18:10:52,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:52,052 INFO L225 Difference]: With dead ends: 429 [2025-04-13 18:10:52,053 INFO L226 Difference]: Without dead ends: 370 [2025-04-13 18:10:52,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:10:52,053 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:52,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 414 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:52,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-04-13 18:10:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-04-13 18:10:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.4661246612466123) internal successors, (910), 369 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 910 transitions. [2025-04-13 18:10:52,072 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 910 transitions. Word has length 56 [2025-04-13 18:10:52,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:52,072 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 910 transitions. [2025-04-13 18:10:52,072 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 18:10:52,072 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 910 transitions. [2025-04-13 18:10:52,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:52,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:52,073 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:52,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2025-04-13 18:10:52,073 INFO L403 AbstractCegarLoop]: === Iteration 390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:52,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash 263467829, now seen corresponding path program 389 times [2025-04-13 18:10:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:52,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170219960] [2025-04-13 18:10:52,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:52,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:52,087 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:52,087 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:52,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:53,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:53,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170219960] [2025-04-13 18:10:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170219960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:53,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853966705] [2025-04-13 18:10:53,044 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:10:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:53,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:53,046 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:53,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-04-13 18:10:53,194 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:53,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:53,214 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:10:53,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:53,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 18:10:53,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:53,443 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:53,444 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 18:10:53,449 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 18:10:53,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:53,635 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:53,635 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 18:10:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:53,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853966705] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:53,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:53,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 33 [2025-04-13 18:10:53,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529065382] [2025-04-13 18:10:53,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:53,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:53,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:53,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:53,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:10:53,659 INFO L87 Difference]: Start difference. First operand 370 states and 910 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 18:10:54,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:54,083 INFO L93 Difference]: Finished difference Result 530 states and 1307 transitions. [2025-04-13 18:10:54,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:10:54,083 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 18:10:54,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:54,098 INFO L225 Difference]: With dead ends: 530 [2025-04-13 18:10:54,098 INFO L226 Difference]: Without dead ends: 386 [2025-04-13 18:10:54,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=2185, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:10:54,099 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 127 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:54,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 461 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-13 18:10:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 370. [2025-04-13 18:10:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.3468834688346885) internal successors, (866), 369 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 866 transitions. [2025-04-13 18:10:54,110 INFO L79 Accepts]: Start accepts. Automaton has 370 states and 866 transitions. Word has length 56 [2025-04-13 18:10:54,110 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:54,110 INFO L485 AbstractCegarLoop]: Abstraction has 370 states and 866 transitions. [2025-04-13 18:10:54,110 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 18:10:54,110 INFO L278 IsEmpty]: Start isEmpty. Operand 370 states and 866 transitions. [2025-04-13 18:10:54,111 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:54,111 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:54,111 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:54,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 18:10:54,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable389 [2025-04-13 18:10:54,311 INFO L403 AbstractCegarLoop]: === Iteration 391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:54,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash 47482643, now seen corresponding path program 390 times [2025-04-13 18:10:54,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:54,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453635732] [2025-04-13 18:10:54,311 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:10:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:54,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:54,321 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:54,321 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:10:54,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:54,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 18:10:54,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:54,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453635732] [2025-04-13 18:10:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453635732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831386943] [2025-04-13 18:10:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:54,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:54,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:54,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:54,425 INFO L87 Difference]: Start difference. First operand 370 states and 866 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 18:10:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:54,679 INFO L93 Difference]: Finished difference Result 418 states and 971 transitions. [2025-04-13 18:10:54,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:10:54,679 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 18:10:54,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:54,688 INFO L225 Difference]: With dead ends: 418 [2025-04-13 18:10:54,688 INFO L226 Difference]: Without dead ends: 366 [2025-04-13 18:10:54,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:10:54,688 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 143 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:54,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 403 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-04-13 18:10:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-04-13 18:10:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.33972602739726) internal successors, (854), 365 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 854 transitions. [2025-04-13 18:10:54,696 INFO L79 Accepts]: Start accepts. Automaton has 366 states and 854 transitions. Word has length 56 [2025-04-13 18:10:54,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:54,696 INFO L485 AbstractCegarLoop]: Abstraction has 366 states and 854 transitions. [2025-04-13 18:10:54,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 18:10:54,696 INFO L278 IsEmpty]: Start isEmpty. Operand 366 states and 854 transitions. [2025-04-13 18:10:54,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:54,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 18:10:54,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2025-04-13 18:10:54,697 INFO L403 AbstractCegarLoop]: === Iteration 392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:54,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:54,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1498107945, now seen corresponding path program 391 times [2025-04-13 18:10:54,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:54,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316594631] [2025-04-13 18:10:54,697 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:54,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:54,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:54,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:54,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:54,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:55,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:55,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316594631] [2025-04-13 18:10:55,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316594631] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:55,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640121304] [2025-04-13 18:10:55,715 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:10:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:55,717 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:10:55,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-04-13 18:10:55,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-13 18:10:55,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-13 18:10:55,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:10:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:55,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 18:10:55,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:56,100 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:56,100 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 18:10:56,122 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 18:10:56,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:56,320 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-13 18:10:56,320 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 18:10:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640121304] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:10:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 12] total 34 [2025-04-13 18:10:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356645397] [2025-04-13 18:10:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:56,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:56,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:56,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1101, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:10:56,351 INFO L87 Difference]: Start difference. First operand 366 states and 854 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 18:10:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:56,766 INFO L93 Difference]: Finished difference Result 422 states and 979 transitions. [2025-04-13 18:10:56,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 18:10:56,766 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 18:10:56,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:56,775 INFO L225 Difference]: With dead ends: 422 [2025-04-13 18:10:56,775 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 18:10:56,776 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=2263, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:10:56,776 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 126 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:56,776 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 402 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:10:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 18:10:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-04-13 18:10:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.3406940063091484) internal successors, (742), 317 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:10:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 742 transitions. [2025-04-13 18:10:56,784 INFO L79 Accepts]: Start accepts. Automaton has 318 states and 742 transitions. Word has length 56 [2025-04-13 18:10:56,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:56,784 INFO L485 AbstractCegarLoop]: Abstraction has 318 states and 742 transitions. [2025-04-13 18:10:56,784 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 18:10:56,784 INFO L278 IsEmpty]: Start isEmpty. Operand 318 states and 742 transitions. [2025-04-13 18:10:56,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-04-13 18:10:56,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:56,784 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:56,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2025-04-13 18:10:56,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:56,984 INFO L403 AbstractCegarLoop]: === Iteration 393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:10:56,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 133675579, now seen corresponding path program 392 times [2025-04-13 18:10:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:56,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898638341] [2025-04-13 18:10:56,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:10:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:56,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-04-13 18:10:56,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 54 of 56 statements. [2025-04-13 18:10:56,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:10:56,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:57,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 18:10:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:57,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898638341] [2025-04-13 18:10:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898638341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:10:57,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:10:57,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:10:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40080244] [2025-04-13 18:10:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:10:57,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:10:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:57,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:10:57,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:10:57,094 INFO L87 Difference]: Start difference. First operand 318 states and 742 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 18:10:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:57,296 INFO L93 Difference]: Finished difference Result 318 states and 742 transitions. [2025-04-13 18:10:57,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:10:57,296 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 18:10:57,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:10:57,304 INFO L225 Difference]: With dead ends: 318 [2025-04-13 18:10:57,304 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:10:57,305 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:10:57,305 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 120 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:10:57,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 417 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:10:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:10:57,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:10:57,305 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 18:10:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:10:57,308 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 56 [2025-04-13 18:10:57,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:57,308 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:10:57,309 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 18:10:57,309 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:10:57,309 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:10:57,311 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:10:57,311 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:10:57,311 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:10:57,311 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:10:57,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2025-04-13 18:10:57,313 INFO L422 BasicCegarLoop]: Path program histogram: [392, 1] [2025-04-13 18:10:57,314 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:10:57,315 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:10:57,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:10:57 BasicIcfg [2025-04-13 18:10:57,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:10:57,316 INFO L158 Benchmark]: Toolchain (without parser) took 480338.55ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 100.8MB in the beginning and 927.8MB in the end (delta: -826.9MB). Peak memory consumption was 237.7MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.95ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 85.4MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 82.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: Boogie Preprocessor took 52.16ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: RCFGBuilder took 510.69ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 30.9MB in the end (delta: 49.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,316 INFO L158 Benchmark]: TraceAbstraction took 479466.82ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 30.2MB in the beginning and 927.8MB in the end (delta: -897.5MB). Peak memory consumption was 170.6MB. Max. memory is 8.0GB. [2025-04-13 18:10:57,317 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.95ms. Allocated memory is still 142.6MB. Free memory was 100.8MB in the beginning and 85.4MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 82.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.16ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.6MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 510.69ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 30.9MB in the end (delta: 49.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 479466.82ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 30.2MB in the beginning and 927.8MB in the end (delta: -897.5MB). Peak memory consumption was 170.6MB. 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: 479.4s, OverallIterations: 393, TraceHistogramMax: 2, PathProgramHistogramMax: 392, EmptinessCheckTime: 0.7s, AutomataDifference: 224.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95461 SdHoareTripleChecker+Valid, 124.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95461 mSDsluCounter, 196388 SdHoareTripleChecker+Invalid, 105.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172512 mSDsCounter, 1796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353377 IncrementalHoareTripleChecker+Invalid, 355173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1796 mSolverCounterUnsat, 23876 mSDtfsCounter, 353377 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26186 GetRequests, 12040 SyntacticMatches, 4 SemanticMatches, 14142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104283 ImplicationChecksByTransitivity, 155.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4133occurred in iteration=10, InterpolantAutomatonStates: 10550, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.8s AutomataMinimizationTime, 393 MinimizatonAttempts, 68013 StatesRemovedByMinimization, 368 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 196.9s InterpolantComputationTime, 29240 NumberOfCodeBlocks, 28230 NumberOfCodeBlocksAsserted, 654 NumberOfCheckSat, 34206 ConstructedInterpolants, 1481 QuantifiedInterpolants, 319055 SizeOfPredicates, 2309 NumberOfNonLiveVariables, 35261 ConjunctsInSsa, 3770 ConjunctsInUnsatCore, 623 InterpolantComputations, 388 PerfectInterpolantSequences, 1189/1752 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 18:10:57,438 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...