./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/hardware-verification-bv/btor2c-lazyMod.miim.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:30:36,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:30:36,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:30:36,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:30:36,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:30:36,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:30:36,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:30:36,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:30:36,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:30:36,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:30:36,766 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:30:36,766 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:30:36,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:30:36,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:30:36,767 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:30:36,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:30:36,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:30:36,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:30:36,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:30:36,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:30:36,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:30:36,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:30:36,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:30:36,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:30:36,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:30:36,770 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8c8574ead59a3d6c844f4988721fe479d7d5d492b1ea6dd2e875c5c9834b070c [2025-02-07 23:30:36,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:30:36,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:30:36,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:30:36,995 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:30:36,995 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:30:36,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2025-02-07 23:30:38,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8248f6f/8e80769031854fdabceae0801c9aa2e5/FLAG7bf7d9290 [2025-02-07 23:30:38,526 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:30:38,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.miim.c [2025-02-07 23:30:38,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8248f6f/8e80769031854fdabceae0801c9aa2e5/FLAG7bf7d9290 [2025-02-07 23:30:38,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8248f6f/8e80769031854fdabceae0801c9aa2e5 [2025-02-07 23:30:38,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:30:38,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:30:38,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:30:38,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:30:38,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:30:38,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:30:38" (1/1) ... [2025-02-07 23:30:38,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157de673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:38, skipping insertion in model container [2025-02-07 23:30:38,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:30:38" (1/1) ... [2025-02-07 23:30:38,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:30:38,921 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/hardware-verification-bv/btor2c-lazyMod.miim.c[1244,1257] [2025-02-07 23:30:39,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:30:39,094 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:30:39,101 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/hardware-verification-bv/btor2c-lazyMod.miim.c[1244,1257] [2025-02-07 23:30:39,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:30:39,179 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:30:39,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39 WrapperNode [2025-02-07 23:30:39,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:30:39,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:30:39,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:30:39,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:30:39,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,292 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1717 [2025-02-07 23:30:39,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:30:39,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:30:39,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:30:39,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:30:39,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,378 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-02-07 23:30:39,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:30:39,459 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:30:39,459 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:30:39,459 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:30:39,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (1/1) ... [2025-02-07 23:30:39,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:30:39,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:30:39,485 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-07 23:30:39,489 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-07 23:30:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:30:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:30:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 23:30:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:30:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:30:39,769 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:30:39,771 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:30:40,919 INFO L? ?]: Removed 831 outVars from TransFormulas that were not future-live. [2025-02-07 23:30:40,919 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:30:40,961 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:30:40,961 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:30:40,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:30:40 BoogieIcfgContainer [2025-02-07 23:30:40,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:30:40,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:30:40,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:30:40,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:30:40,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:30:38" (1/3) ... [2025-02-07 23:30:40,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:30:40, skipping insertion in model container [2025-02-07 23:30:40,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:30:39" (2/3) ... [2025-02-07 23:30:40,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba2cd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:30:40, skipping insertion in model container [2025-02-07 23:30:40,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:30:40" (3/3) ... [2025-02-07 23:30:40,967 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.miim.c [2025-02-07 23:30:40,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:30:40,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.miim.c that has 1 procedures, 324 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:30:41,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:30:41,016 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;@5ea94551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:30:41,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:30:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 322 states have (on average 1.5) internal successors, (483), 323 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-07 23:30:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-07 23:30:41,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:41,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:30:41,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:41,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash -365133980, now seen corresponding path program 1 times [2025-02-07 23:30:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556499459] [2025-02-07 23:30:41,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:41,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-07 23:30:41,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-07 23:30:41,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:41,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:41,690 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-07 23:30:41,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:41,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556499459] [2025-02-07 23:30:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556499459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:30:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852060753] [2025-02-07 23:30:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:41,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:30:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:41,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:30:41,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:41,714 INFO L87 Difference]: Start difference. First operand has 324 states, 322 states have (on average 1.5) internal successors, (483), 323 states have internal predecessors, (483), 0 states have call successors, (0), 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 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-07 23:30:41,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:41,911 INFO L93 Difference]: Finished difference Result 551 states and 823 transitions. [2025-02-07 23:30:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:30:41,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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-07 23:30:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:41,921 INFO L225 Difference]: With dead ends: 551 [2025-02-07 23:30:41,921 INFO L226 Difference]: Without dead ends: 324 [2025-02-07 23:30:41,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:41,924 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:41,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1192 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:30:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-02-07 23:30:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-02-07 23:30:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4922600619195046) internal successors, (482), 323 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-07 23:30:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 482 transitions. [2025-02-07 23:30:41,955 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 482 transitions. Word has length 74 [2025-02-07 23:30:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:41,955 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 482 transitions. [2025-02-07 23:30:41,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-07 23:30:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 482 transitions. [2025-02-07 23:30:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 23:30:41,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:41,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:30:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:30:41,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:41,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:41,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1570427959, now seen corresponding path program 1 times [2025-02-07 23:30:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919738963] [2025-02-07 23:30:41,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:41,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 23:30:42,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 23:30:42,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:42,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:42,171 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-07 23:30:42,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919738963] [2025-02-07 23:30:42,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919738963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:42,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:42,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:30:42,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647779918] [2025-02-07 23:30:42,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:42,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:30:42,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:42,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:30:42,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:42,176 INFO L87 Difference]: Start difference. First operand 324 states and 482 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 23:30:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:42,334 INFO L93 Difference]: Finished difference Result 553 states and 822 transitions. [2025-02-07 23:30:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:30:42,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have 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-07 23:30:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:42,336 INFO L225 Difference]: With dead ends: 553 [2025-02-07 23:30:42,336 INFO L226 Difference]: Without dead ends: 326 [2025-02-07 23:30:42,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:42,337 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:42,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1189 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:30:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-07 23:30:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-07 23:30:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-07 23:30:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2025-02-07 23:30:42,347 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 75 [2025-02-07 23:30:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:42,347 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2025-02-07 23:30:42,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-07 23:30:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2025-02-07 23:30:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 23:30:42,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:42,349 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:30:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:30:42,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -924831297, now seen corresponding path program 1 times [2025-02-07 23:30:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:42,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126531938] [2025-02-07 23:30:42,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:42,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 23:30:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 23:30:42,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:42,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:42,744 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-07 23:30:42,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:42,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126531938] [2025-02-07 23:30:42,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126531938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:42,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:42,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:30:42,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055713398] [2025-02-07 23:30:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:42,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:30:42,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:42,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:30:42,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:42,746 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 23:30:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:42,904 INFO L93 Difference]: Finished difference Result 555 states and 823 transitions. [2025-02-07 23:30:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:30:42,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-07 23:30:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:42,906 INFO L225 Difference]: With dead ends: 555 [2025-02-07 23:30:42,906 INFO L226 Difference]: Without dead ends: 326 [2025-02-07 23:30:42,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:30:42,907 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 26 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:42,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1154 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:30:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-07 23:30:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-02-07 23:30:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4861538461538462) internal successors, (483), 325 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-07 23:30:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 483 transitions. [2025-02-07 23:30:42,915 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 483 transitions. Word has length 76 [2025-02-07 23:30:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:42,916 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 483 transitions. [2025-02-07 23:30:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-07 23:30:42,916 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 483 transitions. [2025-02-07 23:30:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-07 23:30:42,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:42,917 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:30:42,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:30:42,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:42,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1011603620, now seen corresponding path program 1 times [2025-02-07 23:30:42,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:42,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599750418] [2025-02-07 23:30:42,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:42,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-07 23:30:42,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-07 23:30:42,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:42,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:43,347 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-07 23:30:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599750418] [2025-02-07 23:30:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599750418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:43,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:43,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 23:30:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450938176] [2025-02-07 23:30:43,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:43,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 23:30:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:43,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 23:30:43,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:30:43,348 INFO L87 Difference]: Start difference. First operand 326 states and 483 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-07 23:30:43,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:43,652 INFO L93 Difference]: Finished difference Result 585 states and 865 transitions. [2025-02-07 23:30:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 23:30:43,652 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-07 23:30:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:43,654 INFO L225 Difference]: With dead ends: 585 [2025-02-07 23:30:43,654 INFO L226 Difference]: Without dead ends: 356 [2025-02-07 23:30:43,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:30:43,655 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 494 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:43,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 2345 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:30:43,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-07 23:30:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2025-02-07 23:30:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 1.4830508474576272) internal successors, (525), 354 states have internal predecessors, (525), 0 states have call successors, (0), 0 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-07 23:30:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 525 transitions. [2025-02-07 23:30:43,662 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 525 transitions. Word has length 77 [2025-02-07 23:30:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:43,662 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 525 transitions. [2025-02-07 23:30:43,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-07 23:30:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 525 transitions. [2025-02-07 23:30:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 23:30:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:43,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:30:43,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 899664038, now seen corresponding path program 1 times [2025-02-07 23:30:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538855701] [2025-02-07 23:30:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:43,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:30:43,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:30:43,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:43,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:44,409 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-07 23:30:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:44,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538855701] [2025-02-07 23:30:44,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538855701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:30:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991983436] [2025-02-07 23:30:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:44,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:30:44,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:44,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:30:44,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:30:44,412 INFO L87 Difference]: Start difference. First operand 355 states and 525 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-07 23:30:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:44,878 INFO L93 Difference]: Finished difference Result 618 states and 912 transitions. [2025-02-07 23:30:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:30:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-07 23:30:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:44,882 INFO L225 Difference]: With dead ends: 618 [2025-02-07 23:30:44,882 INFO L226 Difference]: Without dead ends: 360 [2025-02-07 23:30:44,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:30:44,883 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 497 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2688 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:30:44,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-07 23:30:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 359. [2025-02-07 23:30:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4804469273743017) internal successors, (530), 358 states have internal predecessors, (530), 0 states have call successors, (0), 0 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-07 23:30:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 530 transitions. [2025-02-07 23:30:44,895 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 530 transitions. Word has length 78 [2025-02-07 23:30:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:44,897 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 530 transitions. [2025-02-07 23:30:44,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-07 23:30:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 530 transitions. [2025-02-07 23:30:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 23:30:44,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:44,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:44,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:30:44,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 306727356, now seen corresponding path program 1 times [2025-02-07 23:30:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493781169] [2025-02-07 23:30:44,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:44,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 23:30:44,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 23:30:44,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:44,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:45,161 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-07 23:30:45,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493781169] [2025-02-07 23:30:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493781169] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:30:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449241184] [2025-02-07 23:30:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:30:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:30:45,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:30:45,166 INFO L87 Difference]: Start difference. First operand 359 states and 530 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-07 23:30:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:45,361 INFO L93 Difference]: Finished difference Result 627 states and 924 transitions. [2025-02-07 23:30:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:30:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-07 23:30:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:45,363 INFO L225 Difference]: With dead ends: 627 [2025-02-07 23:30:45,364 INFO L226 Difference]: Without dead ends: 365 [2025-02-07 23:30:45,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:30:45,365 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 443 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:45,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 1159 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:30:45,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-02-07 23:30:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-02-07 23:30:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.478021978021978) internal successors, (538), 364 states have internal predecessors, (538), 0 states have call successors, (0), 0 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-07 23:30:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 538 transitions. [2025-02-07 23:30:45,376 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 538 transitions. Word has length 78 [2025-02-07 23:30:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:45,377 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 538 transitions. [2025-02-07 23:30:45,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-07 23:30:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 538 transitions. [2025-02-07 23:30:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 23:30:45,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:45,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:30:45,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:45,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash 528802206, now seen corresponding path program 1 times [2025-02-07 23:30:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:45,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578775497] [2025-02-07 23:30:45,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:45,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 23:30:45,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 23:30:45,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:45,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:45,655 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-07 23:30:45,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:45,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578775497] [2025-02-07 23:30:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578775497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:30:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214031772] [2025-02-07 23:30:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:45,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:30:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:30:45,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:30:45,656 INFO L87 Difference]: Start difference. First operand 365 states and 538 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-07 23:30:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:45,809 INFO L93 Difference]: Finished difference Result 633 states and 931 transitions. [2025-02-07 23:30:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:30:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-02-07 23:30:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:45,810 INFO L225 Difference]: With dead ends: 633 [2025-02-07 23:30:45,811 INFO L226 Difference]: Without dead ends: 371 [2025-02-07 23:30:45,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:30:45,812 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 417 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:45,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 1179 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:30:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-02-07 23:30:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2025-02-07 23:30:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.4702702702702704) internal successors, (544), 370 states have internal predecessors, (544), 0 states have call successors, (0), 0 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-07 23:30:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 544 transitions. [2025-02-07 23:30:45,821 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 544 transitions. Word has length 79 [2025-02-07 23:30:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:45,822 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 544 transitions. [2025-02-07 23:30:45,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-07 23:30:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 544 transitions. [2025-02-07 23:30:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 23:30:45,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:45,823 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:45,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:30:45,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:45,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:45,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1315117020, now seen corresponding path program 1 times [2025-02-07 23:30:45,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:45,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608892494] [2025-02-07 23:30:45,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:45,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:45,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-07 23:30:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 23:30:45,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:45,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:46,032 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-07 23:30:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608892494] [2025-02-07 23:30:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608892494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:46,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:30:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335763325] [2025-02-07 23:30:46,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:46,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:30:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:46,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:30:46,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:46,034 INFO L87 Difference]: Start difference. First operand 371 states and 544 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-07 23:30:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:46,702 INFO L93 Difference]: Finished difference Result 754 states and 1099 transitions. [2025-02-07 23:30:46,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:30:46,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-02-07 23:30:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:46,704 INFO L225 Difference]: With dead ends: 754 [2025-02-07 23:30:46,704 INFO L226 Difference]: Without dead ends: 486 [2025-02-07 23:30:46,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:30:46,705 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 741 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:46,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 1204 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:30:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-07 23:30:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 392. [2025-02-07 23:30:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.4680306905370843) internal successors, (574), 391 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 23:30:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 574 transitions. [2025-02-07 23:30:46,713 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 574 transitions. Word has length 80 [2025-02-07 23:30:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 574 transitions. [2025-02-07 23:30:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-07 23:30:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 574 transitions. [2025-02-07 23:30:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-07 23:30:46,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:46,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:46,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 23:30:46,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash -136620413, now seen corresponding path program 1 times [2025-02-07 23:30:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110436471] [2025-02-07 23:30:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:46,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-07 23:30:46,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-07 23:30:46,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:46,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:46,923 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-07 23:30:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110436471] [2025-02-07 23:30:46,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110436471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:46,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:30:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862955158] [2025-02-07 23:30:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:30:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:46,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:30:46,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:30:46,925 INFO L87 Difference]: Start difference. First operand 392 states and 574 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-07 23:30:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:47,882 INFO L93 Difference]: Finished difference Result 869 states and 1268 transitions. [2025-02-07 23:30:47,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:30:47,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-02-07 23:30:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:47,884 INFO L225 Difference]: With dead ends: 869 [2025-02-07 23:30:47,884 INFO L226 Difference]: Without dead ends: 595 [2025-02-07 23:30:47,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:30:47,885 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1063 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:47,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1652 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:30:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-02-07 23:30:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 393. [2025-02-07 23:30:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 1.4642857142857142) internal successors, (574), 392 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 23:30:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2025-02-07 23:30:47,892 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 81 [2025-02-07 23:30:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:47,892 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2025-02-07 23:30:47,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-07 23:30:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2025-02-07 23:30:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-07 23:30:47,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:47,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:47,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 23:30:47,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:47,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1362162039, now seen corresponding path program 1 times [2025-02-07 23:30:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152194915] [2025-02-07 23:30:47,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:47,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-07 23:30:47,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-07 23:30:47,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:48,043 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-07 23:30:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:48,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152194915] [2025-02-07 23:30:48,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152194915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:48,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:48,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:30:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029720991] [2025-02-07 23:30:48,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:48,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:30:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:48,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:30:48,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:48,045 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-07 23:30:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:48,326 INFO L93 Difference]: Finished difference Result 719 states and 1040 transitions. [2025-02-07 23:30:48,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:30:48,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-07 23:30:48,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:48,328 INFO L225 Difference]: With dead ends: 719 [2025-02-07 23:30:48,328 INFO L226 Difference]: Without dead ends: 440 [2025-02-07 23:30:48,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:30:48,330 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 593 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:48,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1918 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:30:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-07 23:30:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 394. [2025-02-07 23:30:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 1.460559796437659) internal successors, (574), 393 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 23:30:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2025-02-07 23:30:48,339 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 82 [2025-02-07 23:30:48,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:48,339 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2025-02-07 23:30:48,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-07 23:30:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2025-02-07 23:30:48,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-07 23:30:48,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:48,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 23:30:48,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1932472936, now seen corresponding path program 1 times [2025-02-07 23:30:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144633476] [2025-02-07 23:30:48,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:48,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-07 23:30:48,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-07 23:30:48,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:48,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:48,491 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-07 23:30:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:48,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144633476] [2025-02-07 23:30:48,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144633476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:48,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:48,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:30:48,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578840670] [2025-02-07 23:30:48,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:30:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:48,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:30:48,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:48,493 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-07 23:30:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:48,775 INFO L93 Difference]: Finished difference Result 753 states and 1088 transitions. [2025-02-07 23:30:48,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:30:48,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-07 23:30:48,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:48,777 INFO L225 Difference]: With dead ends: 753 [2025-02-07 23:30:48,777 INFO L226 Difference]: Without dead ends: 469 [2025-02-07 23:30:48,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:30:48,778 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 675 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:48,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1913 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:30:48,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-07 23:30:48,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 395. [2025-02-07 23:30:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 1.4568527918781726) internal successors, (574), 394 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 23:30:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 574 transitions. [2025-02-07 23:30:48,785 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 574 transitions. Word has length 83 [2025-02-07 23:30:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:48,785 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 574 transitions. [2025-02-07 23:30:48,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-07 23:30:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 574 transitions. [2025-02-07 23:30:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-07 23:30:48,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:48,786 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:48,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 23:30:48,786 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:48,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 895048722, now seen corresponding path program 1 times [2025-02-07 23:30:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:48,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679908104] [2025-02-07 23:30:48,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:48,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-07 23:30:48,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-07 23:30:48,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:48,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:48,950 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-07 23:30:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679908104] [2025-02-07 23:30:48,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679908104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:48,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 23:30:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179953687] [2025-02-07 23:30:48,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:48,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 23:30:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:48,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 23:30:48,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:48,952 INFO L87 Difference]: Start difference. First operand 395 states and 574 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-07 23:30:49,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:49,258 INFO L93 Difference]: Finished difference Result 891 states and 1292 transitions. [2025-02-07 23:30:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:30:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-02-07 23:30:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:49,261 INFO L225 Difference]: With dead ends: 891 [2025-02-07 23:30:49,261 INFO L226 Difference]: Without dead ends: 602 [2025-02-07 23:30:49,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-07 23:30:49,262 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1069 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:49,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 1918 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:30:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-02-07 23:30:49,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 396. [2025-02-07 23:30:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4531645569620253) internal successors, (574), 395 states have internal predecessors, (574), 0 states have call successors, (0), 0 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-07 23:30:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 574 transitions. [2025-02-07 23:30:49,268 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 574 transitions. Word has length 84 [2025-02-07 23:30:49,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:49,268 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 574 transitions. [2025-02-07 23:30:49,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-07 23:30:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 574 transitions. [2025-02-07 23:30:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-07 23:30:49,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:49,269 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:49,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 23:30:49,269 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:49,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1524139341, now seen corresponding path program 1 times [2025-02-07 23:30:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:49,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598886656] [2025-02-07 23:30:49,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:49,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:49,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-07 23:30:49,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-07 23:30:49,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:49,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:49,369 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-07 23:30:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598886656] [2025-02-07 23:30:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598886656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:30:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811826586] [2025-02-07 23:30:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:30:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:49,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:30:49,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:30:49,371 INFO L87 Difference]: Start difference. First operand 396 states and 574 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-07 23:30:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:49,573 INFO L93 Difference]: Finished difference Result 858 states and 1247 transitions. [2025-02-07 23:30:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:30:49,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-02-07 23:30:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:49,575 INFO L225 Difference]: With dead ends: 858 [2025-02-07 23:30:49,575 INFO L226 Difference]: Without dead ends: 569 [2025-02-07 23:30:49,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:49,576 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 1014 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:49,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1161 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:30:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-07 23:30:49,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 383. [2025-02-07 23:30:49,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.455497382198953) internal successors, (556), 382 states have internal predecessors, (556), 0 states have call successors, (0), 0 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-07 23:30:49,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2025-02-07 23:30:49,582 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 85 [2025-02-07 23:30:49,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:49,582 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2025-02-07 23:30:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-07 23:30:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2025-02-07 23:30:49,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-07 23:30:49,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:49,584 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:49,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 23:30:49,584 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:49,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:49,584 INFO L85 PathProgramCache]: Analyzing trace with hash 767698913, now seen corresponding path program 1 times [2025-02-07 23:30:49,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:49,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570049334] [2025-02-07 23:30:49,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:49,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-07 23:30:49,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-07 23:30:49,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:49,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:50,069 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570049334] [2025-02-07 23:30:50,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570049334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:30:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406786074] [2025-02-07 23:30:50,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:50,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:30:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:30:50,072 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-07 23:30:50,075 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-07 23:30:50,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-07 23:30:50,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-07 23:30:50,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:50,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:50,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 23:30:50,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:30:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:50,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:30:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406786074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:30:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-07 23:30:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192289696] [2025-02-07 23:30:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:30:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:50,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:30:50,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 23:30:50,934 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-07 23:30:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:51,286 INFO L93 Difference]: Finished difference Result 650 states and 946 transitions. [2025-02-07 23:30:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:30:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-02-07 23:30:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:51,288 INFO L225 Difference]: With dead ends: 650 [2025-02-07 23:30:51,288 INFO L226 Difference]: Without dead ends: 382 [2025-02-07 23:30:51,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:30:51,289 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 365 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:51,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 500 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:30:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-07 23:30:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2025-02-07 23:30:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 1.4514435695538057) internal successors, (553), 381 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-07 23:30:51,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 553 transitions. [2025-02-07 23:30:51,296 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 553 transitions. Word has length 192 [2025-02-07 23:30:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:51,296 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 553 transitions. [2025-02-07 23:30:51,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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-07 23:30:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 553 transitions. [2025-02-07 23:30:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-07 23:30:51,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:51,297 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:51,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 23:30:51,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-07 23:30:51,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:51,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1117537289, now seen corresponding path program 1 times [2025-02-07 23:30:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:51,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818209837] [2025-02-07 23:30:51,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:51,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-07 23:30:51,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-07 23:30:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818209837] [2025-02-07 23:30:52,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818209837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:52,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:30:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433301989] [2025-02-07 23:30:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:52,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:30:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:30:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:30:52,314 INFO L87 Difference]: Start difference. First operand 382 states and 553 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-07 23:30:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:52,737 INFO L93 Difference]: Finished difference Result 774 states and 1121 transitions. [2025-02-07 23:30:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:30:52,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2025-02-07 23:30:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:52,739 INFO L225 Difference]: With dead ends: 774 [2025-02-07 23:30:52,740 INFO L226 Difference]: Without dead ends: 499 [2025-02-07 23:30:52,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:30:52,741 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 772 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:52,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1391 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:30:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-02-07 23:30:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 457. [2025-02-07 23:30:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 1.4473684210526316) internal successors, (660), 456 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-07 23:30:52,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 660 transitions. [2025-02-07 23:30:52,750 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 660 transitions. Word has length 193 [2025-02-07 23:30:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:52,750 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 660 transitions. [2025-02-07 23:30:52,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 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-07 23:30:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 660 transitions. [2025-02-07 23:30:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-07 23:30:52,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:52,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:52,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 23:30:52,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:52,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 848555152, now seen corresponding path program 1 times [2025-02-07 23:30:52,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:52,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069282544] [2025-02-07 23:30:52,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:52,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-07 23:30:53,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-07 23:30:53,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:53,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:53,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:53,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069282544] [2025-02-07 23:30:53,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069282544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:53,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:30:53,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:30:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326271632] [2025-02-07 23:30:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:53,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:30:53,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:53,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:30:53,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:30:53,535 INFO L87 Difference]: Start difference. First operand 457 states and 660 transitions. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-07 23:30:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:54,033 INFO L93 Difference]: Finished difference Result 912 states and 1316 transitions. [2025-02-07 23:30:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:30:54,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2025-02-07 23:30:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:54,038 INFO L225 Difference]: With dead ends: 912 [2025-02-07 23:30:54,038 INFO L226 Difference]: Without dead ends: 645 [2025-02-07 23:30:54,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:30:54,040 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 982 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:54,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1365 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:30:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-02-07 23:30:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 564. [2025-02-07 23:30:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.452930728241563) internal successors, (818), 563 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-07 23:30:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 818 transitions. [2025-02-07 23:30:54,052 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 818 transitions. Word has length 194 [2025-02-07 23:30:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:54,053 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 818 transitions. [2025-02-07 23:30:54,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 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-07 23:30:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 818 transitions. [2025-02-07 23:30:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-07 23:30:54,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:54,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:54,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 23:30:54,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:54,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1799268018, now seen corresponding path program 1 times [2025-02-07 23:30:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996885643] [2025-02-07 23:30:54,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-07 23:30:54,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-07 23:30:54,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:54,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996885643] [2025-02-07 23:30:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996885643] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:30:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836314025] [2025-02-07 23:30:55,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:30:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:30:55,364 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-07 23:30:55,366 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-07 23:30:55,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-07 23:30:55,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-07 23:30:55,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:55,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:55,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-07 23:30:55,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:30:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:56,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:30:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836314025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:56,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:30:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-02-07 23:30:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060791367] [2025-02-07 23:30:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:30:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:56,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:30:56,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:30:56,521 INFO L87 Difference]: Start difference. First operand 564 states and 818 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-07 23:30:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:30:56,965 INFO L93 Difference]: Finished difference Result 936 states and 1361 transitions. [2025-02-07 23:30:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:30:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-07 23:30:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:30:56,968 INFO L225 Difference]: With dead ends: 936 [2025-02-07 23:30:56,968 INFO L226 Difference]: Without dead ends: 564 [2025-02-07 23:30:56,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:30:56,969 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 745 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:30:56,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 722 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:30:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-07 23:30:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2025-02-07 23:30:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.4511545293072825) internal successors, (817), 563 states have internal predecessors, (817), 0 states have call successors, (0), 0 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-07 23:30:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 817 transitions. [2025-02-07 23:30:56,978 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 817 transitions. Word has length 195 [2025-02-07 23:30:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:30:56,978 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 817 transitions. [2025-02-07 23:30:56,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 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-07 23:30:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 817 transitions. [2025-02-07 23:30:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-07 23:30:56,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:30:56,979 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:30:56,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 23:30:57,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 23:30:57,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:30:57,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:30:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash 995589024, now seen corresponding path program 1 times [2025-02-07 23:30:57,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:30:57,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404844113] [2025-02-07 23:30:57,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:57,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:30:57,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-07 23:30:57,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-07 23:30:57,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:57,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:58,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:30:58,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404844113] [2025-02-07 23:30:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404844113] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:30:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905233840] [2025-02-07 23:30:58,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:30:58,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:30:58,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:30:58,403 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-07 23:30:58,407 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-07 23:30:58,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-07 23:30:59,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-07 23:30:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:30:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:30:59,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-07 23:30:59,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:30:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:30:59,632 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:30:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905233840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:30:59,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:30:59,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-02-07 23:30:59,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027081270] [2025-02-07 23:30:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:30:59,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:30:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:30:59,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:30:59,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:30:59,633 INFO L87 Difference]: Start difference. First operand 564 states and 817 transitions. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-07 23:31:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:00,112 INFO L93 Difference]: Finished difference Result 833 states and 1208 transitions. [2025-02-07 23:31:00,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:31:00,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2025-02-07 23:31:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:00,114 INFO L225 Difference]: With dead ends: 833 [2025-02-07 23:31:00,115 INFO L226 Difference]: Without dead ends: 566 [2025-02-07 23:31:00,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-02-07 23:31:00,115 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 883 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:00,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 718 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:31:00,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-07 23:31:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2025-02-07 23:31:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.450354609929078) internal successors, (818), 564 states have internal predecessors, (818), 0 states have call successors, (0), 0 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-07 23:31:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 818 transitions. [2025-02-07 23:31:00,123 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 818 transitions. Word has length 196 [2025-02-07 23:31:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 818 transitions. [2025-02-07 23:31:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 4 states have internal predecessors, (196), 0 states have call successors, (0), 0 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-07 23:31:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 818 transitions. [2025-02-07 23:31:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-07 23:31:00,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:00,126 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:00,144 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-07 23:31:00,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:00,328 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:00,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash 856451806, now seen corresponding path program 1 times [2025-02-07 23:31:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98586716] [2025-02-07 23:31:00,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:00,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-07 23:31:00,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-07 23:31:00,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:00,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:01,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98586716] [2025-02-07 23:31:01,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98586716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:01,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955962896] [2025-02-07 23:31:01,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:01,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:01,702 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-07 23:31:01,703 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-07 23:31:02,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-07 23:31:02,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-07 23:31:02,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:02,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:02,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 23:31:02,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:02,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:31:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:03,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955962896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:31:03,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:31:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-02-07 23:31:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784834141] [2025-02-07 23:31:03,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:31:03,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-07 23:31:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:03,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-07 23:31:03,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-02-07 23:31:03,607 INFO L87 Difference]: Start difference. First operand 565 states and 818 transitions. Second operand has 22 states, 22 states have (on average 24.818181818181817) internal successors, (546), 21 states have internal predecessors, (546), 0 states have call successors, (0), 0 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-07 23:31:05,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:05,079 INFO L93 Difference]: Finished difference Result 1035 states and 1494 transitions. [2025-02-07 23:31:05,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 23:31:05,080 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 24.818181818181817) internal successors, (546), 21 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-02-07 23:31:05,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:05,082 INFO L225 Difference]: With dead ends: 1035 [2025-02-07 23:31:05,082 INFO L226 Difference]: Without dead ends: 768 [2025-02-07 23:31:05,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1030, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 23:31:05,083 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 2212 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2212 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:05,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2212 Valid, 2974 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 23:31:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-07 23:31:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 573. [2025-02-07 23:31:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4475524475524475) internal successors, (828), 572 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-07 23:31:05,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 828 transitions. [2025-02-07 23:31:05,092 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 828 transitions. Word has length 197 [2025-02-07 23:31:05,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 828 transitions. [2025-02-07 23:31:05,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 24.818181818181817) internal successors, (546), 21 states have internal predecessors, (546), 0 states have call successors, (0), 0 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-07 23:31:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 828 transitions. [2025-02-07 23:31:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-07 23:31:05,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:05,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:05,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 23:31:05,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:05,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:05,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:05,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1319336062, now seen corresponding path program 1 times [2025-02-07 23:31:05,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762555228] [2025-02-07 23:31:05,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:05,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-07 23:31:05,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-07 23:31:05,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:05,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:07,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:07,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762555228] [2025-02-07 23:31:07,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762555228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:07,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:07,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:31:07,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267547662] [2025-02-07 23:31:07,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:07,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:31:07,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:07,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:31:07,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:31:07,137 INFO L87 Difference]: Start difference. First operand 573 states and 828 transitions. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-07 23:31:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:07,292 INFO L93 Difference]: Finished difference Result 935 states and 1355 transitions. [2025-02-07 23:31:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:31:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-07 23:31:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:07,294 INFO L225 Difference]: With dead ends: 935 [2025-02-07 23:31:07,294 INFO L226 Difference]: Without dead ends: 577 [2025-02-07 23:31:07,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:31:07,295 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 359 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:07,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1174 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-07 23:31:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-02-07 23:31:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.4444444444444444) internal successors, (832), 576 states have internal predecessors, (832), 0 states have call successors, (0), 0 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-07 23:31:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 832 transitions. [2025-02-07 23:31:07,306 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 832 transitions. Word has length 199 [2025-02-07 23:31:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:07,306 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 832 transitions. [2025-02-07 23:31:07,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-07 23:31:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 832 transitions. [2025-02-07 23:31:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-07 23:31:07,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:07,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:07,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 23:31:07,308 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:07,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:07,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1641075698, now seen corresponding path program 1 times [2025-02-07 23:31:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:07,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594417170] [2025-02-07 23:31:07,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:07,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-07 23:31:08,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-07 23:31:08,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:08,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594417170] [2025-02-07 23:31:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594417170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:31:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172327329] [2025-02-07 23:31:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:10,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:31:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:10,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:31:10,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:31:10,853 INFO L87 Difference]: Start difference. First operand 577 states and 832 transitions. Second operand has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 23:31:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:11,469 INFO L93 Difference]: Finished difference Result 1145 states and 1645 transitions. [2025-02-07 23:31:11,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 23:31:11,470 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-07 23:31:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:11,472 INFO L225 Difference]: With dead ends: 1145 [2025-02-07 23:31:11,472 INFO L226 Difference]: Without dead ends: 788 [2025-02-07 23:31:11,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-02-07 23:31:11,473 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 1375 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:11,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 2890 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:31:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-02-07 23:31:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 698. [2025-02-07 23:31:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.430416068866571) internal successors, (997), 697 states have internal predecessors, (997), 0 states have call successors, (0), 0 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-07 23:31:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 997 transitions. [2025-02-07 23:31:11,481 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 997 transitions. Word has length 200 [2025-02-07 23:31:11,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:11,482 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 997 transitions. [2025-02-07 23:31:11,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.384615384615385) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 23:31:11,482 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 997 transitions. [2025-02-07 23:31:11,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-07 23:31:11,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:11,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:11,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 23:31:11,483 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash 568956691, now seen corresponding path program 1 times [2025-02-07 23:31:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460685039] [2025-02-07 23:31:11,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:11,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-07 23:31:12,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-07 23:31:12,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:12,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:13,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:13,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460685039] [2025-02-07 23:31:13,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460685039] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:13,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:13,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:31:13,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976058909] [2025-02-07 23:31:13,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:13,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:31:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:13,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:31:13,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:31:13,104 INFO L87 Difference]: Start difference. First operand 698 states and 997 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 23:31:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:13,256 INFO L93 Difference]: Finished difference Result 1062 states and 1526 transitions. [2025-02-07 23:31:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:31:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-02-07 23:31:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:13,258 INFO L225 Difference]: With dead ends: 1062 [2025-02-07 23:31:13,258 INFO L226 Difference]: Without dead ends: 702 [2025-02-07 23:31:13,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:31:13,260 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 360 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:13,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1174 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:31:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-07 23:31:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 700. [2025-02-07 23:31:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.4291845493562232) internal successors, (999), 699 states have internal predecessors, (999), 0 states have call successors, (0), 0 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-07 23:31:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 999 transitions. [2025-02-07 23:31:13,268 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 999 transitions. Word has length 200 [2025-02-07 23:31:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:13,268 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 999 transitions. [2025-02-07 23:31:13,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 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-07 23:31:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 999 transitions. [2025-02-07 23:31:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-07 23:31:13,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:13,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:13,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 23:31:13,274 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:13,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 831681357, now seen corresponding path program 1 times [2025-02-07 23:31:13,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:13,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72773232] [2025-02-07 23:31:13,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:13,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:13,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-07 23:31:13,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-07 23:31:13,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:13,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:15,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72773232] [2025-02-07 23:31:15,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72773232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:15,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:15,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:31:15,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71418386] [2025-02-07 23:31:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:15,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 23:31:15,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 23:31:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:31:15,331 INFO L87 Difference]: Start difference. First operand 700 states and 999 transitions. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-07 23:31:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:15,516 INFO L93 Difference]: Finished difference Result 1072 states and 1538 transitions. [2025-02-07 23:31:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 23:31:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-07 23:31:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:15,518 INFO L225 Difference]: With dead ends: 1072 [2025-02-07 23:31:15,518 INFO L226 Difference]: Without dead ends: 706 [2025-02-07 23:31:15,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 23:31:15,519 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 356 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:15,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1515 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:31:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-02-07 23:31:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2025-02-07 23:31:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 705 states have (on average 1.425531914893617) internal successors, (1005), 705 states have internal predecessors, (1005), 0 states have call successors, (0), 0 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-07 23:31:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1005 transitions. [2025-02-07 23:31:15,527 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1005 transitions. Word has length 201 [2025-02-07 23:31:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:15,528 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 1005 transitions. [2025-02-07 23:31:15,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-07 23:31:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1005 transitions. [2025-02-07 23:31:15,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-07 23:31:15,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:15,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:15,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 23:31:15,529 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:15,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash -5084619, now seen corresponding path program 1 times [2025-02-07 23:31:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335760184] [2025-02-07 23:31:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-07 23:31:16,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-07 23:31:16,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:16,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335760184] [2025-02-07 23:31:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335760184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 23:31:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375242909] [2025-02-07 23:31:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 23:31:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 23:31:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-07 23:31:17,958 INFO L87 Difference]: Start difference. First operand 706 states and 1005 transitions. Second operand has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-07 23:31:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:18,383 INFO L93 Difference]: Finished difference Result 1154 states and 1650 transitions. [2025-02-07 23:31:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 23:31:18,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2025-02-07 23:31:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:18,385 INFO L225 Difference]: With dead ends: 1154 [2025-02-07 23:31:18,385 INFO L226 Difference]: Without dead ends: 799 [2025-02-07 23:31:18,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-02-07 23:31:18,386 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1587 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:18,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 2329 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 23:31:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-07 23:31:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 709. [2025-02-07 23:31:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.423728813559322) internal successors, (1008), 708 states have internal predecessors, (1008), 0 states have call successors, (0), 0 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-07 23:31:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1008 transitions. [2025-02-07 23:31:18,398 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1008 transitions. Word has length 201 [2025-02-07 23:31:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:18,406 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1008 transitions. [2025-02-07 23:31:18,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.333333333333332) internal successors, (201), 8 states have internal predecessors, (201), 0 states have call successors, (0), 0 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-07 23:31:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1008 transitions. [2025-02-07 23:31:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-07 23:31:18,407 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:18,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:18,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 23:31:18,407 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:18,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1387236073, now seen corresponding path program 1 times [2025-02-07 23:31:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:18,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278876183] [2025-02-07 23:31:18,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:18,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-07 23:31:19,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-07 23:31:19,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:19,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:20,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:20,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278876183] [2025-02-07 23:31:20,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278876183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:20,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679888496] [2025-02-07 23:31:20,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:20,523 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-07 23:31:20,524 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-07 23:31:21,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-07 23:31:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-07 23:31:21,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:21,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:21,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-07 23:31:21,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:21,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:31:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679888496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:21,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 23:31:21,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2025-02-07 23:31:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803770664] [2025-02-07 23:31:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:31:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:21,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:31:21,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:31:21,758 INFO L87 Difference]: Start difference. First operand 709 states and 1008 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 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-07 23:31:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:22,145 INFO L93 Difference]: Finished difference Result 1148 states and 1642 transitions. [2025-02-07 23:31:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:31:22,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 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 202 [2025-02-07 23:31:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:22,147 INFO L225 Difference]: With dead ends: 1148 [2025-02-07 23:31:22,148 INFO L226 Difference]: Without dead ends: 624 [2025-02-07 23:31:22,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-02-07 23:31:22,151 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 730 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:22,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 727 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:31:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-07 23:31:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 583. [2025-02-07 23:31:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.436426116838488) internal successors, (836), 582 states have internal predecessors, (836), 0 states have call successors, (0), 0 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-07 23:31:22,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 836 transitions. [2025-02-07 23:31:22,166 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 836 transitions. Word has length 202 [2025-02-07 23:31:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 836 transitions. [2025-02-07 23:31:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 4 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-07 23:31:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 836 transitions. [2025-02-07 23:31:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-07 23:31:22,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:22,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:22,183 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-07 23:31:22,371 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,SelfDestructingSolverStorable24 [2025-02-07 23:31:22,372 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:22,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 197993163, now seen corresponding path program 1 times [2025-02-07 23:31:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243960509] [2025-02-07 23:31:22,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:22,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-07 23:31:22,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-07 23:31:22,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:22,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243960509] [2025-02-07 23:31:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243960509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 23:31:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22440054] [2025-02-07 23:31:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:24,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:31:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:31:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-07 23:31:24,654 INFO L87 Difference]: Start difference. First operand 583 states and 836 transitions. Second operand has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-07 23:31:25,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:25,107 INFO L93 Difference]: Finished difference Result 1528 states and 2191 transitions. [2025-02-07 23:31:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 23:31:25,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-07 23:31:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:25,110 INFO L225 Difference]: With dead ends: 1528 [2025-02-07 23:31:25,110 INFO L226 Difference]: Without dead ends: 1168 [2025-02-07 23:31:25,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-07 23:31:25,111 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 921 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 2527 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:25,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 2527 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 23:31:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-02-07 23:31:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 881. [2025-02-07 23:31:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.4227272727272726) internal successors, (1252), 880 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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-07 23:31:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1252 transitions. [2025-02-07 23:31:25,121 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1252 transitions. Word has length 203 [2025-02-07 23:31:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1252 transitions. [2025-02-07 23:31:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.615384615384615) internal successors, (203), 12 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-07 23:31:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1252 transitions. [2025-02-07 23:31:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-07 23:31:25,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:25,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 23:31:25,123 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash 673105756, now seen corresponding path program 1 times [2025-02-07 23:31:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512258642] [2025-02-07 23:31:25,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:25,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:25,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-07 23:31:25,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-07 23:31:25,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:25,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:27,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:27,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512258642] [2025-02-07 23:31:27,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512258642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:31:27,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:31:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 23:31:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574556012] [2025-02-07 23:31:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:31:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:31:27,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:27,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:31:27,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-07 23:31:27,656 INFO L87 Difference]: Start difference. First operand 881 states and 1252 transitions. Second operand has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-07 23:31:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:28,279 INFO L93 Difference]: Finished difference Result 1724 states and 2469 transitions. [2025-02-07 23:31:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 23:31:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-07 23:31:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:28,282 INFO L225 Difference]: With dead ends: 1724 [2025-02-07 23:31:28,282 INFO L226 Difference]: Without dead ends: 1184 [2025-02-07 23:31:28,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2025-02-07 23:31:28,283 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1002 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:28,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 3100 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 23:31:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-02-07 23:31:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 893. [2025-02-07 23:31:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.4215246636771302) internal successors, (1268), 892 states have internal predecessors, (1268), 0 states have call successors, (0), 0 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-07 23:31:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1268 transitions. [2025-02-07 23:31:28,292 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1268 transitions. Word has length 203 [2025-02-07 23:31:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:28,292 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1268 transitions. [2025-02-07 23:31:28,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.916666666666668) internal successors, (203), 11 states have internal predecessors, (203), 0 states have call successors, (0), 0 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-07 23:31:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1268 transitions. [2025-02-07 23:31:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-07 23:31:28,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:28,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:28,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 23:31:28,293 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:28,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1677515790, now seen corresponding path program 1 times [2025-02-07 23:31:28,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:28,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100398303] [2025-02-07 23:31:28,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:28,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:28,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-07 23:31:28,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-07 23:31:28,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:28,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100398303] [2025-02-07 23:31:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100398303] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174660777] [2025-02-07 23:31:30,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:30,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:30,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:30,314 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-07 23:31:30,315 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-07 23:31:30,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-07 23:31:31,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-07 23:31:31,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:31,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:31,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-07 23:31:31,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:31,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:31:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174660777] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:31:33,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:31:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 35 [2025-02-07 23:31:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22289455] [2025-02-07 23:31:33,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:31:33,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-07 23:31:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:33,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-07 23:31:33,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2025-02-07 23:31:33,108 INFO L87 Difference]: Start difference. First operand 893 states and 1268 transitions. Second operand has 36 states, 36 states have (on average 14.777777777777779) internal successors, (532), 35 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-07 23:31:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:34,918 INFO L93 Difference]: Finished difference Result 2113 states and 3029 transitions. [2025-02-07 23:31:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-07 23:31:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 14.777777777777779) internal successors, (532), 35 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-02-07 23:31:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:34,923 INFO L225 Difference]: With dead ends: 2113 [2025-02-07 23:31:34,923 INFO L226 Difference]: Without dead ends: 1656 [2025-02-07 23:31:34,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=342, Invalid=1914, Unknown=0, NotChecked=0, Total=2256 [2025-02-07 23:31:34,924 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 2120 mSDsluCounter, 3531 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 3715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:34,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 3773 Invalid, 3715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-07 23:31:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-02-07 23:31:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1460. [2025-02-07 23:31:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 1.4276901987662782) internal successors, (2083), 1459 states have internal predecessors, (2083), 0 states have call successors, (0), 0 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-07 23:31:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2083 transitions. [2025-02-07 23:31:34,938 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2083 transitions. Word has length 203 [2025-02-07 23:31:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:34,938 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 2083 transitions. [2025-02-07 23:31:34,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 14.777777777777779) internal successors, (532), 35 states have internal predecessors, (532), 0 states have call successors, (0), 0 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-07 23:31:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2083 transitions. [2025-02-07 23:31:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-07 23:31:34,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:34,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:34,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 23:31:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-07 23:31:35,144 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1585658010, now seen corresponding path program 1 times [2025-02-07 23:31:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070142609] [2025-02-07 23:31:35,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:35,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-07 23:31:35,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-07 23:31:35,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:35,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:37,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070142609] [2025-02-07 23:31:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070142609] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4530770] [2025-02-07 23:31:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:37,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:37,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:31:37,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 23:31:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-07 23:31:38,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-07 23:31:38,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:38,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:38,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-07 23:31:38,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:39,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:31:40,622 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:40,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4530770] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:31:40,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:31:40,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 41 [2025-02-07 23:31:40,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415538178] [2025-02-07 23:31:40,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:31:40,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-07 23:31:40,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:40,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-07 23:31:40,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 23:31:40,625 INFO L87 Difference]: Start difference. First operand 1460 states and 2083 transitions. Second operand has 42 states, 42 states have (on average 14.214285714285714) internal successors, (597), 41 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-07 23:31:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:43,610 INFO L93 Difference]: Finished difference Result 2566 states and 3678 transitions. [2025-02-07 23:31:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-07 23:31:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 14.214285714285714) internal successors, (597), 41 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-07 23:31:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:43,620 INFO L225 Difference]: With dead ends: 2566 [2025-02-07 23:31:43,621 INFO L226 Difference]: Without dead ends: 2109 [2025-02-07 23:31:43,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=721, Invalid=4829, Unknown=0, NotChecked=0, Total=5550 [2025-02-07 23:31:43,627 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 4109 mSDsluCounter, 7853 mSDsCounter, 0 mSdLazyCounter, 6432 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4109 SdHoareTripleChecker+Valid, 8234 SdHoareTripleChecker+Invalid, 6449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:43,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4109 Valid, 8234 Invalid, 6449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 6432 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-07 23:31:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2025-02-07 23:31:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1477. [2025-02-07 23:31:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1476 states have (on average 1.4281842818428185) internal successors, (2108), 1476 states have internal predecessors, (2108), 0 states have call successors, (0), 0 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-07 23:31:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2108 transitions. [2025-02-07 23:31:43,657 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2108 transitions. Word has length 204 [2025-02-07 23:31:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:43,661 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2108 transitions. [2025-02-07 23:31:43,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 14.214285714285714) internal successors, (597), 41 states have internal predecessors, (597), 0 states have call successors, (0), 0 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-07 23:31:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2108 transitions. [2025-02-07 23:31:43,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-07 23:31:43,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:43,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:43,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 23:31:43,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:43,863 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:43,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1787160431, now seen corresponding path program 1 times [2025-02-07 23:31:43,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:43,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142383686] [2025-02-07 23:31:43,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:43,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:43,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-07 23:31:44,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-07 23:31:44,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:44,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142383686] [2025-02-07 23:31:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142383686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409632069] [2025-02-07 23:31:45,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:45,926 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:31:45,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 23:31:46,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-07 23:31:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-07 23:31:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:46,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-07 23:31:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:47,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:31:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:49,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409632069] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:31:49,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 23:31:49,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2025-02-07 23:31:49,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623069637] [2025-02-07 23:31:49,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 23:31:49,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-07 23:31:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:31:49,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-07 23:31:49,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1704, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 23:31:49,393 INFO L87 Difference]: Start difference. First operand 1477 states and 2108 transitions. Second operand has 45 states, 45 states have (on average 12.777777777777779) internal successors, (575), 44 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-07 23:31:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:31:52,672 INFO L93 Difference]: Finished difference Result 4132 states and 5946 transitions. [2025-02-07 23:31:52,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-07 23:31:52,672 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 12.777777777777779) internal successors, (575), 44 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2025-02-07 23:31:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:31:52,680 INFO L225 Difference]: With dead ends: 4132 [2025-02-07 23:31:52,680 INFO L226 Difference]: Without dead ends: 3281 [2025-02-07 23:31:52,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1142, Invalid=6340, Unknown=0, NotChecked=0, Total=7482 [2025-02-07 23:31:52,684 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 11288 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 6264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11288 SdHoareTripleChecker+Valid, 6610 SdHoareTripleChecker+Invalid, 6276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 6264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-07 23:31:52,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11288 Valid, 6610 Invalid, 6276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 6264 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-07 23:31:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2025-02-07 23:31:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 2044. [2025-02-07 23:31:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 2043 states have (on average 1.4243759177679882) internal successors, (2910), 2043 states have internal predecessors, (2910), 0 states have call successors, (0), 0 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-07 23:31:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2910 transitions. [2025-02-07 23:31:52,711 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2910 transitions. Word has length 204 [2025-02-07 23:31:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:31:52,712 INFO L471 AbstractCegarLoop]: Abstraction has 2044 states and 2910 transitions. [2025-02-07 23:31:52,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 12.777777777777779) internal successors, (575), 44 states have internal predecessors, (575), 0 states have call successors, (0), 0 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-07 23:31:52,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2910 transitions. [2025-02-07 23:31:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-07 23:31:52,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:31:52,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 23:31:52,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 23:31:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:52,918 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:31:52,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:31:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -339784315, now seen corresponding path program 1 times [2025-02-07 23:31:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:31:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303927348] [2025-02-07 23:31:52,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:31:52,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-07 23:31:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-07 23:31:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:31:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303927348] [2025-02-07 23:31:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303927348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 23:31:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117279690] [2025-02-07 23:31:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:31:56,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:31:56,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:31:56,800 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:31:56,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 23:31:57,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-07 23:31:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-07 23:31:58,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:31:58,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:31:58,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 154 conjuncts are in the unsatisfiable core [2025-02-07 23:31:58,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:31:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:31:59,358 INFO L312 TraceCheckSpWp]: Computing backward predicates...