./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:15:49,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:15:49,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:15:49,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:15:49,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:15:49,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:15:49,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:15:49,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:15:49,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:15:49,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:15:49,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:15:49,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:15:49,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:15:49,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:15:49,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:15:49,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:49,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:15:49,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 [2025-02-05 16:15:49,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:15:49,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:15:49,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:15:49,748 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:15:49,748 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:15:49,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:15:51,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b8da67b2/dc2a395dce09470a92389517eb506720/FLAG713cf80a9 [2025-02-05 16:15:51,290 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:15:51,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:15:51,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b8da67b2/dc2a395dce09470a92389517eb506720/FLAG713cf80a9 [2025-02-05 16:15:51,614 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b8da67b2/dc2a395dce09470a92389517eb506720 [2025-02-05 16:15:51,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:15:51,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:15:51,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:51,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:15:51,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:15:51,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141bb26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51, skipping insertion in model container [2025-02-05 16:15:51,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:15:51,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2025-02-05 16:15:51,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:51,805 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:15:51,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c[8209,8222] [2025-02-05 16:15:51,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:15:51,861 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:15:51,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51 WrapperNode [2025-02-05 16:15:51,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:15:51,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:51,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:15:51,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:15:51,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,897 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 275 [2025-02-05 16:15:51,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:15:51,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:15:51,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:15:51,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:15:51,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,923 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:15:51,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:15:51,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:15:51,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:15:51,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:15:51,942 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (1/1) ... [2025-02-05 16:15:51,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:15:51,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:51,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:15:51,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:15:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:15:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:15:51,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:15:51,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:15:52,042 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:15:52,043 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:15:52,411 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-05 16:15:52,412 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:15:52,430 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:15:52,430 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:15:52,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:52 BoogieIcfgContainer [2025-02-05 16:15:52,431 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:15:52,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:15:52,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:15:52,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:15:52,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:15:51" (1/3) ... [2025-02-05 16:15:52,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9a228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:52, skipping insertion in model container [2025-02-05 16:15:52,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:15:51" (2/3) ... [2025-02-05 16:15:52,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a9a228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:15:52, skipping insertion in model container [2025-02-05 16:15:52,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:15:52" (3/3) ... [2025-02-05 16:15:52,445 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2025-02-05 16:15:52,463 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:15:52,468 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c that has 1 procedures, 68 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 16:15:52,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:15:52,538 INFO L333 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=PETRI_NET, 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;@336a48ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:15:52,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:15:52,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:15:52,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,549 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] [2025-02-05 16:15:52,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,554 INFO L85 PathProgramCache]: Analyzing trace with hash -983011031, now seen corresponding path program 1 times [2025-02-05 16:15:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080175396] [2025-02-05 16:15:52,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:15:52,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:15:52,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080175396] [2025-02-05 16:15:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080175396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:52,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 16:15:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771431928] [2025-02-05 16:15:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:52,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 16:15:52,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:52,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 16:15:52,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:52,834 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 67 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:52,845 INFO L93 Difference]: Finished difference Result 108 states and 176 transitions. [2025-02-05 16:15:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 16:15:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 16:15:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:52,850 INFO L225 Difference]: With dead ends: 108 [2025-02-05 16:15:52,850 INFO L226 Difference]: Without dead ends: 65 [2025-02-05 16:15:52,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 16:15:52,853 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:52,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-05 16:15:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-05 16:15:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.703125) internal successors, (109), 64 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 109 transitions. [2025-02-05 16:15:52,872 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 109 transitions. Word has length 21 [2025-02-05 16:15:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 109 transitions. [2025-02-05 16:15:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 109 transitions. [2025-02-05 16:15:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 16:15:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:52,874 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] [2025-02-05 16:15:52,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:15:52,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1493545208, now seen corresponding path program 1 times [2025-02-05 16:15:52,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:52,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905051636] [2025-02-05 16:15:52,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:52,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 16:15:52,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 16:15:52,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:52,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:53,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905051636] [2025-02-05 16:15:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905051636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:15:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328529217] [2025-02-05 16:15:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:15:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:15:53,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:53,065 INFO L87 Difference]: Start difference. First operand 65 states and 109 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,125 INFO L93 Difference]: Finished difference Result 141 states and 227 transitions. [2025-02-05 16:15:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:15:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 16:15:53,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,130 INFO L225 Difference]: With dead ends: 141 [2025-02-05 16:15:53,130 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 16:15:53,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:15:53,131 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 56 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 391 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 16:15:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 65. [2025-02-05 16:15:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2025-02-05 16:15:53,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 21 [2025-02-05 16:15:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,139 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2025-02-05 16:15:53,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2025-02-05 16:15:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:15:53,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,140 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] [2025-02-05 16:15:53,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:15:53,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1079123086, now seen corresponding path program 1 times [2025-02-05 16:15:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299778467] [2025-02-05 16:15:53,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:15:53,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:15:53,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299778467] [2025-02-05 16:15:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299778467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105490682] [2025-02-05 16:15:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:53,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:53,336 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,484 INFO L93 Difference]: Finished difference Result 353 states and 542 transitions. [2025-02-05 16:15:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:15:53,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-02-05 16:15:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,487 INFO L225 Difference]: With dead ends: 353 [2025-02-05 16:15:53,487 INFO L226 Difference]: Without dead ends: 317 [2025-02-05 16:15:53,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:15:53,488 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 461 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 870 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-02-05 16:15:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 99. [2025-02-05 16:15:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 140 transitions. [2025-02-05 16:15:53,500 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 140 transitions. Word has length 43 [2025-02-05 16:15:53,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,504 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 140 transitions. [2025-02-05 16:15:53,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,504 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 140 transitions. [2025-02-05 16:15:53,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 16:15:53,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,505 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] [2025-02-05 16:15:53,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:15:53,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash -829814099, now seen corresponding path program 1 times [2025-02-05 16:15:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024412068] [2025-02-05 16:15:53,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 16:15:53,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 16:15:53,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024412068] [2025-02-05 16:15:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024412068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042586438] [2025-02-05 16:15:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:53,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:53,633 INFO L87 Difference]: Start difference. First operand 99 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,652 INFO L93 Difference]: Finished difference Result 228 states and 343 transitions. [2025-02-05 16:15:53,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:53,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 16:15:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,653 INFO L225 Difference]: With dead ends: 228 [2025-02-05 16:15:53,653 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 16:15:53,653 INFO L434 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-02-05 16:15:53,654 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 16:15:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-02-05 16:15:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4709677419354839) internal successors, (228), 155 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 228 transitions. [2025-02-05 16:15:53,666 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 228 transitions. Word has length 45 [2025-02-05 16:15:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 228 transitions. [2025-02-05 16:15:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 228 transitions. [2025-02-05 16:15:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 16:15:53,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,667 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] [2025-02-05 16:15:53,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:15:53,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash -797490864, now seen corresponding path program 1 times [2025-02-05 16:15:53,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835829415] [2025-02-05 16:15:53,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 16:15:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 16:15:53,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:53,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:53,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835829415] [2025-02-05 16:15:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835829415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:53,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327723189] [2025-02-05 16:15:53,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:53,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:53,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:53,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:53,849 INFO L87 Difference]: Start difference. First operand 156 states and 228 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:53,927 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2025-02-05 16:15:53,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:53,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-02-05 16:15:53,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:53,928 INFO L225 Difference]: With dead ends: 285 [2025-02-05 16:15:53,928 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 16:15:53,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:53,929 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:53,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 239 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 16:15:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2025-02-05 16:15:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.4580645161290322) internal successors, (226), 155 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2025-02-05 16:15:53,951 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 45 [2025-02-05 16:15:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:53,951 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2025-02-05 16:15:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2025-02-05 16:15:53,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 16:15:53,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:53,952 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] [2025-02-05 16:15:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:15:53,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:53,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1078124725, now seen corresponding path program 1 times [2025-02-05 16:15:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795747966] [2025-02-05 16:15:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:53,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 16:15:53,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 16:15:53,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795747966] [2025-02-05 16:15:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795747966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:15:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641818482] [2025-02-05 16:15:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:15:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:15:54,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:54,129 INFO L87 Difference]: Start difference. First operand 156 states and 226 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,163 INFO L93 Difference]: Finished difference Result 164 states and 235 transitions. [2025-02-05 16:15:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:15:54,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-05 16:15:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,165 INFO L225 Difference]: With dead ends: 164 [2025-02-05 16:15:54,165 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 16:15:54,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:15:54,168 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 16:15:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-05 16:15:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.434782608695652) internal successors, (231), 161 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 231 transitions. [2025-02-05 16:15:54,180 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 231 transitions. Word has length 46 [2025-02-05 16:15:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,180 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 231 transitions. [2025-02-05 16:15:54,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 231 transitions. [2025-02-05 16:15:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,181 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] [2025-02-05 16:15:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:15:54,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1763610702, now seen corresponding path program 1 times [2025-02-05 16:15:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250208590] [2025-02-05 16:15:54,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250208590] [2025-02-05 16:15:54,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250208590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318935790] [2025-02-05 16:15:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:54,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,227 INFO L87 Difference]: Start difference. First operand 162 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,240 INFO L93 Difference]: Finished difference Result 308 states and 452 transitions. [2025-02-05 16:15:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:54,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 16:15:54,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,242 INFO L225 Difference]: With dead ends: 308 [2025-02-05 16:15:54,242 INFO L226 Difference]: Without dead ends: 232 [2025-02-05 16:15:54,242 INFO L434 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-02-05 16:15:54,242 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-05 16:15:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2025-02-05 16:15:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-02-05 16:15:54,249 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 47 [2025-02-05 16:15:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,250 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-02-05 16:15:54,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-02-05 16:15:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:54,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,250 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] [2025-02-05 16:15:54,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:15:54,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1315665166, now seen corresponding path program 1 times [2025-02-05 16:15:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659997442] [2025-02-05 16:15:54,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:54,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659997442] [2025-02-05 16:15:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659997442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962971995] [2025-02-05 16:15:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:54,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:54,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,294 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,309 INFO L93 Difference]: Finished difference Result 604 states and 892 transitions. [2025-02-05 16:15:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:54,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 16:15:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,310 INFO L225 Difference]: With dead ends: 604 [2025-02-05 16:15:54,310 INFO L226 Difference]: Without dead ends: 405 [2025-02-05 16:15:54,311 INFO L434 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-02-05 16:15:54,311 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-02-05 16:15:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 403. [2025-02-05 16:15:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.4527363184079602) internal successors, (584), 402 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 584 transitions. [2025-02-05 16:15:54,325 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 584 transitions. Word has length 47 [2025-02-05 16:15:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,325 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 584 transitions. [2025-02-05 16:15:54,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 584 transitions. [2025-02-05 16:15:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:54,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,325 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] [2025-02-05 16:15:54,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:15:54,325 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1730841038, now seen corresponding path program 1 times [2025-02-05 16:15:54,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106732239] [2025-02-05 16:15:54,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:54,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:54,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106732239] [2025-02-05 16:15:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106732239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131125702] [2025-02-05 16:15:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:54,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,367 INFO L87 Difference]: Start difference. First operand 403 states and 584 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,386 INFO L93 Difference]: Finished difference Result 1099 states and 1606 transitions. [2025-02-05 16:15:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 16:15:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,388 INFO L225 Difference]: With dead ends: 1099 [2025-02-05 16:15:54,388 INFO L226 Difference]: Without dead ends: 727 [2025-02-05 16:15:54,389 INFO L434 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-02-05 16:15:54,389 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-02-05 16:15:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 725. [2025-02-05 16:15:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4364640883977902) internal successors, (1040), 724 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1040 transitions. [2025-02-05 16:15:54,413 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1040 transitions. Word has length 47 [2025-02-05 16:15:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,413 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1040 transitions. [2025-02-05 16:15:54,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1040 transitions. [2025-02-05 16:15:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:15:54,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,413 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] [2025-02-05 16:15:54,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:15:54,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1244122766, now seen corresponding path program 1 times [2025-02-05 16:15:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795818261] [2025-02-05 16:15:54,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:15:54,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:15:54,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:54,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795818261] [2025-02-05 16:15:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795818261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:54,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761606375] [2025-02-05 16:15:54,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:54,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:54,456 INFO L87 Difference]: Start difference. First operand 725 states and 1040 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,488 INFO L93 Difference]: Finished difference Result 2017 states and 2890 transitions. [2025-02-05 16:15:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 16:15:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,492 INFO L225 Difference]: With dead ends: 2017 [2025-02-05 16:15:54,492 INFO L226 Difference]: Without dead ends: 1323 [2025-02-05 16:15:54,493 INFO L434 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-02-05 16:15:54,493 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2025-02-05 16:15:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2025-02-05 16:15:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1320 states have (on average 1.406060606060606) internal successors, (1856), 1320 states have internal predecessors, (1856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1856 transitions. [2025-02-05 16:15:54,531 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1856 transitions. Word has length 47 [2025-02-05 16:15:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,531 INFO L471 AbstractCegarLoop]: Abstraction has 1321 states and 1856 transitions. [2025-02-05 16:15:54,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1856 transitions. [2025-02-05 16:15:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:54,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,532 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:54,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:15:54,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1711699493, now seen corresponding path program 1 times [2025-02-05 16:15:54,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699751477] [2025-02-05 16:15:54,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:54,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:54,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:15:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699751477] [2025-02-05 16:15:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699751477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:54,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:54,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147202931] [2025-02-05 16:15:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:54,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:54,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:54,647 INFO L87 Difference]: Start difference. First operand 1321 states and 1856 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:54,830 INFO L93 Difference]: Finished difference Result 6411 states and 9045 transitions. [2025-02-05 16:15:54,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:54,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:15:54,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:54,844 INFO L225 Difference]: With dead ends: 6411 [2025-02-05 16:15:54,844 INFO L226 Difference]: Without dead ends: 5481 [2025-02-05 16:15:54,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:54,846 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 330 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:54,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 494 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2025-02-05 16:15:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 2433. [2025-02-05 16:15:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2432 states have (on average 1.4013157894736843) internal successors, (3408), 2432 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 3408 transitions. [2025-02-05 16:15:54,925 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 3408 transitions. Word has length 64 [2025-02-05 16:15:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:54,926 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 3408 transitions. [2025-02-05 16:15:54,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 3408 transitions. [2025-02-05 16:15:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:54,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:54,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:54,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:15:54,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:54,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:54,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1263753957, now seen corresponding path program 1 times [2025-02-05 16:15:54,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:54,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499824750] [2025-02-05 16:15:54,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:54,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:54,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:54,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:54,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:15:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499824750] [2025-02-05 16:15:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499824750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:55,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023629252] [2025-02-05 16:15:55,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:55,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:55,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:55,048 INFO L87 Difference]: Start difference. First operand 2433 states and 3408 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,220 INFO L93 Difference]: Finished difference Result 7699 states and 10853 transitions. [2025-02-05 16:15:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:55,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:15:55,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,240 INFO L225 Difference]: With dead ends: 7699 [2025-02-05 16:15:55,240 INFO L226 Difference]: Without dead ends: 6409 [2025-02-05 16:15:55,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:55,245 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 330 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 488 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2025-02-05 16:15:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 4185. [2025-02-05 16:15:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4185 states, 4184 states have (on average 1.3977055449330784) internal successors, (5848), 4184 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5848 transitions. [2025-02-05 16:15:55,375 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5848 transitions. Word has length 64 [2025-02-05 16:15:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,376 INFO L471 AbstractCegarLoop]: Abstraction has 4185 states and 5848 transitions. [2025-02-05 16:15:55,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5848 transitions. [2025-02-05 16:15:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,378 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:55,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:15:55,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1678929829, now seen corresponding path program 1 times [2025-02-05 16:15:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358354955] [2025-02-05 16:15:55,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:55,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:55,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:15:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358354955] [2025-02-05 16:15:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358354955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392894595] [2025-02-05 16:15:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:55,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:55,501 INFO L87 Difference]: Start difference. First operand 4185 states and 5848 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:55,686 INFO L93 Difference]: Finished difference Result 8987 states and 12653 transitions. [2025-02-05 16:15:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:15:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:55,705 INFO L225 Difference]: With dead ends: 8987 [2025-02-05 16:15:55,706 INFO L226 Difference]: Without dead ends: 7697 [2025-02-05 16:15:55,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:55,710 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 352 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:55,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 471 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7697 states. [2025-02-05 16:15:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7697 to 5473. [2025-02-05 16:15:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5473 states, 5472 states have (on average 1.3976608187134503) internal successors, (7648), 5472 states have internal predecessors, (7648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 7648 transitions. [2025-02-05 16:15:55,849 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 7648 transitions. Word has length 64 [2025-02-05 16:15:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 5473 states and 7648 transitions. [2025-02-05 16:15:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 7648 transitions. [2025-02-05 16:15:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:15:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:55,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:55,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:15:55,851 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:55,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1192211557, now seen corresponding path program 1 times [2025-02-05 16:15:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337653424] [2025-02-05 16:15:55,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:55,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:15:55,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:15:55,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:55,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:15:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:55,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337653424] [2025-02-05 16:15:55,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337653424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:55,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:55,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:15:55,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338870027] [2025-02-05 16:15:55,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:55,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:15:55,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:55,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:15:55,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:15:55,949 INFO L87 Difference]: Start difference. First operand 5473 states and 7648 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:56,159 INFO L93 Difference]: Finished difference Result 10275 states and 14453 transitions. [2025-02-05 16:15:56,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:15:56,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:15:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:56,187 INFO L225 Difference]: With dead ends: 10275 [2025-02-05 16:15:56,187 INFO L226 Difference]: Without dead ends: 8985 [2025-02-05 16:15:56,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:15:56,191 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 344 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:56,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 481 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:15:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2025-02-05 16:15:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 6761. [2025-02-05 16:15:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3976331360946745) internal successors, (9448), 6760 states have internal predecessors, (9448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9448 transitions. [2025-02-05 16:15:56,354 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9448 transitions. Word has length 64 [2025-02-05 16:15:56,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:56,354 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9448 transitions. [2025-02-05 16:15:56,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9448 transitions. [2025-02-05 16:15:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:15:56,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:56,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:56,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:15:56,356 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash -312527480, now seen corresponding path program 1 times [2025-02-05 16:15:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243118584] [2025-02-05 16:15:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:56,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:15:56,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:15:56,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:56,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:56,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243118584] [2025-02-05 16:15:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243118584] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761998679] [2025-02-05 16:15:56,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:56,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:56,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:56,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:56,428 INFO L87 Difference]: Start difference. First operand 6761 states and 9448 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:56,573 INFO L93 Difference]: Finished difference Result 13493 states and 18866 transitions. [2025-02-05 16:15:56,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:56,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:15:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:56,585 INFO L225 Difference]: With dead ends: 13493 [2025-02-05 16:15:56,585 INFO L226 Difference]: Without dead ends: 6763 [2025-02-05 16:15:56,591 INFO L434 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-02-05 16:15:56,592 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 37 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:56,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-02-05 16:15:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6761. [2025-02-05 16:15:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6761 states, 6760 states have (on average 1.3792899408284023) internal successors, (9324), 6760 states have internal predecessors, (9324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6761 states to 6761 states and 9324 transitions. [2025-02-05 16:15:56,776 INFO L78 Accepts]: Start accepts. Automaton has 6761 states and 9324 transitions. Word has length 65 [2025-02-05 16:15:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:56,777 INFO L471 AbstractCegarLoop]: Abstraction has 6761 states and 9324 transitions. [2025-02-05 16:15:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 6761 states and 9324 transitions. [2025-02-05 16:15:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:15:56,779 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:56,779 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:56,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:15:56,779 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 144484355, now seen corresponding path program 1 times [2025-02-05 16:15:56,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:56,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542231889] [2025-02-05 16:15:56,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:56,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:15:56,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:15:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:56,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542231889] [2025-02-05 16:15:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542231889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:56,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:56,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57903271] [2025-02-05 16:15:56,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:56,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:56,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:56,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:56,856 INFO L87 Difference]: Start difference. First operand 6761 states and 9324 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:56,899 INFO L93 Difference]: Finished difference Result 9334 states and 12908 transitions. [2025-02-05 16:15:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:56,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:15:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:56,905 INFO L225 Difference]: With dead ends: 9334 [2025-02-05 16:15:56,905 INFO L226 Difference]: Without dead ends: 2604 [2025-02-05 16:15:56,910 INFO L434 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-02-05 16:15:56,911 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 31 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:56,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 183 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-02-05 16:15:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2596. [2025-02-05 16:15:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2596 states, 2595 states have (on average 1.373025048169557) internal successors, (3563), 2595 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 3563 transitions. [2025-02-05 16:15:56,965 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 3563 transitions. Word has length 66 [2025-02-05 16:15:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:56,966 INFO L471 AbstractCegarLoop]: Abstraction has 2596 states and 3563 transitions. [2025-02-05 16:15:56,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 3563 transitions. [2025-02-05 16:15:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:15:56,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:56,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:15:56,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1151726161, now seen corresponding path program 1 times [2025-02-05 16:15:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545117629] [2025-02-05 16:15:56,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:56,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:15:56,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:15:56,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:56,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:57,038 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:57,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545117629] [2025-02-05 16:15:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545117629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202210720] [2025-02-05 16:15:57,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:57,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:57,039 INFO L87 Difference]: Start difference. First operand 2596 states and 3563 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:57,090 INFO L93 Difference]: Finished difference Result 3876 states and 5325 transitions. [2025-02-05 16:15:57,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:57,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:15:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:57,093 INFO L225 Difference]: With dead ends: 3876 [2025-02-05 16:15:57,093 INFO L226 Difference]: Without dead ends: 1322 [2025-02-05 16:15:57,094 INFO L434 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-02-05 16:15:57,095 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:57,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-02-05 16:15:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2025-02-05 16:15:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.350265352539803) internal successors, (1781), 1319 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1781 transitions. [2025-02-05 16:15:57,118 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1781 transitions. Word has length 67 [2025-02-05 16:15:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:57,118 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1781 transitions. [2025-02-05 16:15:57,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1781 transitions. [2025-02-05 16:15:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:15:57,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:57,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:57,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:15:57,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:57,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:57,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2015928054, now seen corresponding path program 1 times [2025-02-05 16:15:57,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:57,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637412019] [2025-02-05 16:15:57,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:57,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:57,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:15:57,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:15:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637412019] [2025-02-05 16:15:57,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637412019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:15:57,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:15:57,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:15:57,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67248551] [2025-02-05 16:15:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:15:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:15:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:57,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:15:57,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:15:57,184 INFO L87 Difference]: Start difference. First operand 1320 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:15:57,200 INFO L93 Difference]: Finished difference Result 1962 states and 2652 transitions. [2025-02-05 16:15:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:15:57,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-05 16:15:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:15:57,202 INFO L225 Difference]: With dead ends: 1962 [2025-02-05 16:15:57,202 INFO L226 Difference]: Without dead ends: 684 [2025-02-05 16:15:57,203 INFO L434 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-02-05 16:15:57,203 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:15:57,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:15:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2025-02-05 16:15:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 682. [2025-02-05 16:15:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.3230543318649046) internal successors, (901), 681 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 901 transitions. [2025-02-05 16:15:57,214 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 901 transitions. Word has length 69 [2025-02-05 16:15:57,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:15:57,214 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 901 transitions. [2025-02-05 16:15:57,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:15:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 901 transitions. [2025-02-05 16:15:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:15:57,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:15:57,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:15:57,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:15:57,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:15:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:15:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 698177885, now seen corresponding path program 1 times [2025-02-05 16:15:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:15:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535971497] [2025-02-05 16:15:57,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:15:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:15:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:15:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:58,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:58,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:15:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535971497] [2025-02-05 16:15:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535971497] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:15:58,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140899152] [2025-02-05 16:15:58,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:15:58,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:15:58,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:15:58,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:15:58,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:15:58,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:15:58,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:15:58,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:15:58,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:15:58,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 16:15:58,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:15:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:59,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:15:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:15:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140899152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:15:59,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:15:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-02-05 16:15:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724363798] [2025-02-05 16:15:59,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:15:59,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:15:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:15:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:15:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:15:59,655 INFO L87 Difference]: Start difference. First operand 682 states and 901 transitions. Second operand has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:01,658 INFO L93 Difference]: Finished difference Result 3820 states and 5154 transitions. [2025-02-05 16:16:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 16:16:01,658 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:16:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:01,663 INFO L225 Difference]: With dead ends: 3820 [2025-02-05 16:16:01,663 INFO L226 Difference]: Without dead ends: 3180 [2025-02-05 16:16:01,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=913, Invalid=3779, Unknown=0, NotChecked=0, Total=4692 [2025-02-05 16:16:01,666 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 1516 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:01,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 926 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:16:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2025-02-05 16:16:01,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3124. [2025-02-05 16:16:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 3123 states have (on average 1.313480627601665) internal successors, (4102), 3123 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4102 transitions. [2025-02-05 16:16:01,711 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4102 transitions. Word has length 71 [2025-02-05 16:16:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:01,711 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4102 transitions. [2025-02-05 16:16:01,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:01,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4102 transitions. [2025-02-05 16:16:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:16:01,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:01,712 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:01,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:16:01,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:01,913 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:01,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2015357357, now seen corresponding path program 1 times [2025-02-05 16:16:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028899458] [2025-02-05 16:16:01,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:01,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:16:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:16:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028899458] [2025-02-05 16:16:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028899458] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219729133] [2025-02-05 16:16:02,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:02,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:02,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:02,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:02,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 16:16:02,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:16:02,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:16:02,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:02,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:02,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:16:02,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:02,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219729133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:03,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 16:16:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329091895] [2025-02-05 16:16:03,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:16:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:03,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:16:03,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:16:03,110 INFO L87 Difference]: Start difference. First operand 3124 states and 4102 transitions. Second operand has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:03,473 INFO L93 Difference]: Finished difference Result 6342 states and 8362 transitions. [2025-02-05 16:16:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:16:03,473 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:16:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:03,477 INFO L225 Difference]: With dead ends: 6342 [2025-02-05 16:16:03,477 INFO L226 Difference]: Without dead ends: 3260 [2025-02-05 16:16:03,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:16:03,481 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 848 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:03,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 398 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:16:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3260 states. [2025-02-05 16:16:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3260 to 2772. [2025-02-05 16:16:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2772 states, 2771 states have (on average 1.3016961385781307) internal successors, (3607), 2771 states have internal predecessors, (3607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3607 transitions. [2025-02-05 16:16:03,523 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3607 transitions. Word has length 72 [2025-02-05 16:16:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:03,523 INFO L471 AbstractCegarLoop]: Abstraction has 2772 states and 3607 transitions. [2025-02-05 16:16:03,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.478260869565218) internal successors, (172), 22 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3607 transitions. [2025-02-05 16:16:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:16:03,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:03,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:03,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:16:03,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:03,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1623098189, now seen corresponding path program 1 times [2025-02-05 16:16:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049229338] [2025-02-05 16:16:03,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:03,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:16:03,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:16:03,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:03,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:03,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049229338] [2025-02-05 16:16:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049229338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:03,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109791364] [2025-02-05 16:16:03,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:04,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:04,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 16:16:04,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:16:04,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:16:04,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:04,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:04,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:16:04,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:04,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109791364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:05,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:05,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-02-05 16:16:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491250748] [2025-02-05 16:16:05,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:05,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:16:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:05,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:16:05,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:16:05,026 INFO L87 Difference]: Start difference. First operand 2772 states and 3607 transitions. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:06,282 INFO L93 Difference]: Finished difference Result 14226 states and 18662 transitions. [2025-02-05 16:16:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 16:16:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:16:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:06,296 INFO L225 Difference]: With dead ends: 14226 [2025-02-05 16:16:06,296 INFO L226 Difference]: Without dead ends: 11496 [2025-02-05 16:16:06,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=617, Invalid=2353, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 16:16:06,300 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1374 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:06,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 925 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:16:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11496 states. [2025-02-05 16:16:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11496 to 11308. [2025-02-05 16:16:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11308 states, 11307 states have (on average 1.2801804192093393) internal successors, (14475), 11307 states have internal predecessors, (14475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11308 states to 11308 states and 14475 transitions. [2025-02-05 16:16:06,524 INFO L78 Accepts]: Start accepts. Automaton has 11308 states and 14475 transitions. Word has length 72 [2025-02-05 16:16:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:06,525 INFO L471 AbstractCegarLoop]: Abstraction has 11308 states and 14475 transitions. [2025-02-05 16:16:06,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 25 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:06,525 INFO L276 IsEmpty]: Start isEmpty. Operand 11308 states and 14475 transitions. [2025-02-05 16:16:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:16:06,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:06,527 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:06,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:16:06,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:06,728 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash 678209015, now seen corresponding path program 1 times [2025-02-05 16:16:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:06,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180517782] [2025-02-05 16:16:06,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:06,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:06,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:06,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:06,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180517782] [2025-02-05 16:16:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180517782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167043302] [2025-02-05 16:16:07,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:07,440 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:07,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 16:16:07,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:07,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:07,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:07,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:07,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 16:16:07,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:08,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:09,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167043302] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:09,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:09,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2025-02-05 16:16:09,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858182099] [2025-02-05 16:16:09,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:09,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 16:16:09,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:09,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 16:16:09,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:16:09,181 INFO L87 Difference]: Start difference. First operand 11308 states and 14475 transitions. Second operand has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:16:15,769 INFO L93 Difference]: Finished difference Result 27180 states and 34763 transitions. [2025-02-05 16:16:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-02-05 16:16:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 16:16:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:16:15,796 INFO L225 Difference]: With dead ends: 27180 [2025-02-05 16:16:15,796 INFO L226 Difference]: Without dead ends: 22090 [2025-02-05 16:16:15,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3578 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2270, Invalid=10162, Unknown=0, NotChecked=0, Total=12432 [2025-02-05 16:16:15,805 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 2764 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:16:15,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1404 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:16:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22090 states. [2025-02-05 16:16:16,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22090 to 10556. [2025-02-05 16:16:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 10555 states have (on average 1.2811937470393178) internal successors, (13523), 10555 states have internal predecessors, (13523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 13523 transitions. [2025-02-05 16:16:16,154 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 13523 transitions. Word has length 74 [2025-02-05 16:16:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:16:16,154 INFO L471 AbstractCegarLoop]: Abstraction has 10556 states and 13523 transitions. [2025-02-05 16:16:16,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.75) internal successors, (207), 36 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:16:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 13523 transitions. [2025-02-05 16:16:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:16:16,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:16:16,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:16:16,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:16:16,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 16:16:16,357 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:16:16,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:16:16,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1342630264, now seen corresponding path program 1 times [2025-02-05 16:16:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:16:16,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691721625] [2025-02-05 16:16:16,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:16,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:16:16,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:16,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:16,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:16,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:16:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691721625] [2025-02-05 16:16:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691721625] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:16:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88957489] [2025-02-05 16:16:17,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:16:17,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:16:17,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:16:17,225 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:16:17,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 16:16:17,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:16:17,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:16:17,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:16:17,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:16:17,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-05 16:16:17,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:16:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:21,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:16:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:16:25,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88957489] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:16:25,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:16:25,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 27, 24] total 66 [2025-02-05 16:16:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234160785] [2025-02-05 16:16:25,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:16:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-02-05 16:16:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:16:25,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-02-05 16:16:25,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=3783, Unknown=0, NotChecked=0, Total=4290 [2025-02-05 16:16:25,041 INFO L87 Difference]: Start difference. First operand 10556 states and 13523 transitions. Second operand has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:22,474 INFO L93 Difference]: Finished difference Result 29142 states and 37091 transitions. [2025-02-05 16:17:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2025-02-05 16:17:22,475 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-02-05 16:17:22,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:17:22,501 INFO L225 Difference]: With dead ends: 29142 [2025-02-05 16:17:22,502 INFO L226 Difference]: Without dead ends: 24952 [2025-02-05 16:17:22,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35313 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=14795, Invalid=74307, Unknown=0, NotChecked=0, Total=89102 [2025-02-05 16:17:22,519 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 4758 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4758 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 5618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:17:22,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4758 Valid, 3501 Invalid, 5618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-02-05 16:17:22,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24952 states. [2025-02-05 16:17:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24952 to 14573. [2025-02-05 16:17:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14573 states, 14572 states have (on average 1.2833516332692836) internal successors, (18701), 14572 states have internal predecessors, (18701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14573 states to 14573 states and 18701 transitions. [2025-02-05 16:17:23,055 INFO L78 Accepts]: Start accepts. Automaton has 14573 states and 18701 transitions. Word has length 74 [2025-02-05 16:17:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:17:23,055 INFO L471 AbstractCegarLoop]: Abstraction has 14573 states and 18701 transitions. [2025-02-05 16:17:23,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.0606060606060606) internal successors, (202), 66 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 14573 states and 18701 transitions. [2025-02-05 16:17:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 16:17:23,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:17:23,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:17:23,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:17:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-05 16:17:23,263 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:17:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:17:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 279957331, now seen corresponding path program 1 times [2025-02-05 16:17:23,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:17:23,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261229541] [2025-02-05 16:17:23,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:17:23,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:17:23,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:17:23,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:23,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:17:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:17:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261229541] [2025-02-05 16:17:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261229541] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:17:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709915079] [2025-02-05 16:17:23,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:17:23,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:17:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:17:23,352 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:17:23,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:17:23,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 16:17:23,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 16:17:23,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:17:23,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:17:23,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:17:23,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:17:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:23,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:17:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:17:23,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709915079] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:17:23,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:17:23,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-02-05 16:17:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104173261] [2025-02-05 16:17:23,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:17:23,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:17:23,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:17:23,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:17:23,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:17:23,806 INFO L87 Difference]: Start difference. First operand 14573 states and 18701 transitions. Second operand has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:17:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:17:25,891 INFO L93 Difference]: Finished difference Result 68983 states and 87320 transitions. [2025-02-05 16:17:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:17:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-05 16:17:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted.