./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:18:12,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:18:12,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:18:12,117 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:18:12,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:18:12,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:18:12,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:18:12,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:18:12,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:18:12,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:18:12,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:18:12,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:18:12,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:18:12,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:18:12,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:18:12,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:18:12,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:18:12,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:18:12,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:18:12,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:18:12,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:18:12,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b [2025-02-05 10:18:12,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:18:12,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:18:12,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:18:12,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:18:12,464 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:18:12,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2025-02-05 10:18:13,736 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11fa86a3c/c2c2a31be0dd4a40807a69cbfc2742c9/FLAG8baf8d5ac [2025-02-05 10:18:13,997 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:18:14,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2025-02-05 10:18:14,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11fa86a3c/c2c2a31be0dd4a40807a69cbfc2742c9/FLAG8baf8d5ac [2025-02-05 10:18:14,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11fa86a3c/c2c2a31be0dd4a40807a69cbfc2742c9 [2025-02-05 10:18:14,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:18:14,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:18:14,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:18:14,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:18:14,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:18:14,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300c189d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14, skipping insertion in model container [2025-02-05 10:18:14,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:18:14,239 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/array-multidimensional/copy-partial-3-u.c[414,427] [2025-02-05 10:18:14,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:18:14,275 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:18:14,283 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/array-multidimensional/copy-partial-3-u.c[414,427] [2025-02-05 10:18:14,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:18:14,307 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:18:14,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14 WrapperNode [2025-02-05 10:18:14,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:18:14,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:18:14,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:18:14,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:18:14,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,351 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2025-02-05 10:18:14,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:18:14,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:18:14,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:18:14,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:18:14,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,379 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 1, 2]. [2025-02-05 10:18:14,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:18:14,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:18:14,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:18:14,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:18:14,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (1/1) ... [2025-02-05 10:18:14,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:18:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:14,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:18:14,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:18:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:18:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:18:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:18:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:18:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 10:18:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:18:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:18:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:18:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:18:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:18:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:18:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:18:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:18:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 10:18:14,543 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:18:14,544 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:18:14,765 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-02-05 10:18:14,779 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-05 10:18:14,779 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:18:14,790 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:18:14,790 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:18:14,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:14 BoogieIcfgContainer [2025-02-05 10:18:14,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:18:14,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:18:14,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:18:14,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:18:14,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:18:14" (1/3) ... [2025-02-05 10:18:14,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514ebf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:14, skipping insertion in model container [2025-02-05 10:18:14,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:18:14" (2/3) ... [2025-02-05 10:18:14,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514ebf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:18:14, skipping insertion in model container [2025-02-05 10:18:14,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:18:14" (3/3) ... [2025-02-05 10:18:14,800 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u.c [2025-02-05 10:18:14,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:18:14,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-3-u.c that has 1 procedures, 23 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-02-05 10:18:14,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:18:14,871 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;@4e6c409e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:18:14,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:18:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:14,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:18:14,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:14,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:14,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash -269283594, now seen corresponding path program 1 times [2025-02-05 10:18:14,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:14,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765249090] [2025-02-05 10:18:14,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:14,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:14,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:18:14,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:18:14,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:14,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765249090] [2025-02-05 10:18:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765249090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:18:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140988033] [2025-02-05 10:18:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:15,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:18:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:15,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:18:15,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:18:15,056 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:15,065 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2025-02-05 10:18:15,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:18:15,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 10:18:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:15,071 INFO L225 Difference]: With dead ends: 43 [2025-02-05 10:18:15,071 INFO L226 Difference]: Without dead ends: 20 [2025-02-05 10:18:15,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:18:15,075 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:15,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-05 10:18:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-05 10:18:15,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2025-02-05 10:18:15,105 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 12 [2025-02-05 10:18:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-02-05 10:18:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2025-02-05 10:18:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 10:18:15,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:15,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:15,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:18:15,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:15,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -465797099, now seen corresponding path program 1 times [2025-02-05 10:18:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:15,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439648160] [2025-02-05 10:18:15,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:15,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 10:18:15,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 10:18:15,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:15,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:15,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:15,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439648160] [2025-02-05 10:18:15,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439648160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:15,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:15,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:15,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866380406] [2025-02-05 10:18:15,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:15,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:15,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:15,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:15,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,288 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:15,383 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. [2025-02-05 10:18:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:15,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-05 10:18:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:15,385 INFO L225 Difference]: With dead ends: 46 [2025-02-05 10:18:15,385 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 10:18:15,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,386 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:15,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 19 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 10:18:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2025-02-05 10:18:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2025-02-05 10:18:15,395 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 12 [2025-02-05 10:18:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:15,396 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-02-05 10:18:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2025-02-05 10:18:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:18:15,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:15,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:15,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:18:15,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:15,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash -288616303, now seen corresponding path program 1 times [2025-02-05 10:18:15,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:15,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252260368] [2025-02-05 10:18:15,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:15,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:18:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:18:15,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:15,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:15,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252260368] [2025-02-05 10:18:15,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252260368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:15,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:15,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583070393] [2025-02-05 10:18:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:15,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:15,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:15,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,502 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:15,579 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2025-02-05 10:18:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-05 10:18:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:15,580 INFO L225 Difference]: With dead ends: 47 [2025-02-05 10:18:15,580 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:18:15,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,581 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:18:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-02-05 10:18:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-02-05 10:18:15,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 14 [2025-02-05 10:18:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:15,591 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-02-05 10:18:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2025-02-05 10:18:15,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:18:15,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:15,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:15,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:18:15,592 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1972057843, now seen corresponding path program 1 times [2025-02-05 10:18:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031556119] [2025-02-05 10:18:15,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:15,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 10:18:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:18:15,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:18:15,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:15,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031556119] [2025-02-05 10:18:15,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031556119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:15,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:15,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:15,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821523656] [2025-02-05 10:18:15,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:15,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:15,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:15,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:15,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,714 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:15,787 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2025-02-05 10:18:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 10:18:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:15,788 INFO L225 Difference]: With dead ends: 48 [2025-02-05 10:18:15,790 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 10:18:15,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,791 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:15,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 10:18:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-02-05 10:18:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2025-02-05 10:18:15,797 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 16 [2025-02-05 10:18:15,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:15,797 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2025-02-05 10:18:15,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2025-02-05 10:18:15,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 10:18:15,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:15,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:15,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:18:15,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:15,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash 129898295, now seen corresponding path program 1 times [2025-02-05 10:18:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144463880] [2025-02-05 10:18:15,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:15,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 10:18:15,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 10:18:15,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:18:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144463880] [2025-02-05 10:18:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144463880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603384525] [2025-02-05 10:18:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:15,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:15,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:15,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,905 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:15,983 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2025-02-05 10:18:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 10:18:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:15,984 INFO L225 Difference]: With dead ends: 53 [2025-02-05 10:18:15,984 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 10:18:15,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:15,985 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 10:18:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2025-02-05 10:18:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-02-05 10:18:15,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2025-02-05 10:18:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:15,996 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-02-05 10:18:15,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2025-02-05 10:18:15,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-05 10:18:15,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:15,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:15,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:18:15,997 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:15,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1122399035, now seen corresponding path program 1 times [2025-02-05 10:18:15,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:15,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21004878] [2025-02-05 10:18:15,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-05 10:18:16,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-05 10:18:16,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:18:16,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21004878] [2025-02-05 10:18:16,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21004878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:16,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:16,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:16,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122960943] [2025-02-05 10:18:16,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:16,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:16,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:16,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:16,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,090 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:16,165 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2025-02-05 10:18:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-05 10:18:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:16,166 INFO L225 Difference]: With dead ends: 51 [2025-02-05 10:18:16,166 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 10:18:16,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,167 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:16,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 10:18:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2025-02-05 10:18:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-02-05 10:18:16,179 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 19 [2025-02-05 10:18:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:16,180 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-02-05 10:18:16,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2025-02-05 10:18:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:18:16,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:16,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:16,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:18:16,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:16,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:16,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1970726041, now seen corresponding path program 1 times [2025-02-05 10:18:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:16,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466276616] [2025-02-05 10:18:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-05 10:18:16,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:18:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:18:16,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466276616] [2025-02-05 10:18:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466276616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:16,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:16,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:16,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240682422] [2025-02-05 10:18:16,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:16,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:16,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:16,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:16,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,261 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:16,303 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2025-02-05 10:18:16,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-05 10:18:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:16,304 INFO L225 Difference]: With dead ends: 48 [2025-02-05 10:18:16,304 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:18:16,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,305 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:16,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:18:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-02-05 10:18:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-02-05 10:18:16,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 21 [2025-02-05 10:18:16,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:16,317 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-02-05 10:18:16,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,318 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-02-05 10:18:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:18:16,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:16,318 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] [2025-02-05 10:18:16,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:18:16,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:16,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1761446709, now seen corresponding path program 1 times [2025-02-05 10:18:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:16,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550809569] [2025-02-05 10:18:16,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-05 10:18:16,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:18:16,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550809569] [2025-02-05 10:18:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550809569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:16,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:16,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000491048] [2025-02-05 10:18:16,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:16,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:16,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:16,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,424 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:16,493 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2025-02-05 10:18:16,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:16,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-05 10:18:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:16,496 INFO L225 Difference]: With dead ends: 40 [2025-02-05 10:18:16,496 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:18:16,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:18:16,497 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:16,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:18:16,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-02-05 10:18:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-02-05 10:18:16,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 22 [2025-02-05 10:18:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:16,511 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-02-05 10:18:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2025-02-05 10:18:16,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:18:16,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:16,514 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] [2025-02-05 10:18:16,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:18:16,514 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:16,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:16,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1803472207, now seen corresponding path program 1 times [2025-02-05 10:18:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-02-05 10:18:16,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:18:16,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:18:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:16,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877588113] [2025-02-05 10:18:16,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877588113] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:16,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:16,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63928244] [2025-02-05 10:18:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:16,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:16,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:16,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:16,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,577 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:16,644 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-02-05 10:18:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:18:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:16,645 INFO L225 Difference]: With dead ends: 43 [2025-02-05 10:18:16,645 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:18:16,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:18:16,646 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:16,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:18:16,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-02-05 10:18:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-02-05 10:18:16,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 24 [2025-02-05 10:18:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:16,659 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-02-05 10:18:16,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-02-05 10:18:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 10:18:16,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:16,661 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] [2025-02-05 10:18:16,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:18:16,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:16,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:16,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1927459219, now seen corresponding path program 1 times [2025-02-05 10:18:16,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:16,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159012271] [2025-02-05 10:18:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 10:18:16,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 10:18:16,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:16,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159012271] [2025-02-05 10:18:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159012271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:18:16,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:18:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:18:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331042042] [2025-02-05 10:18:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:18:16,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:18:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:16,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:18:16,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:18:16,741 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:16,808 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2025-02-05 10:18:16,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:18:16,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-05 10:18:16,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:16,809 INFO L225 Difference]: With dead ends: 44 [2025-02-05 10:18:16,809 INFO L226 Difference]: Without dead ends: 31 [2025-02-05 10:18:16,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:18:16,810 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:16,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:18:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-05 10:18:16,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-02-05 10:18:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-02-05 10:18:16,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 26 [2025-02-05 10:18:16,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:16,824 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-02-05 10:18:16,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:16,825 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2025-02-05 10:18:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-05 10:18:16,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:16,826 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] [2025-02-05 10:18:16,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:18:16,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:16,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:16,827 INFO L85 PathProgramCache]: Analyzing trace with hash 474137623, now seen corresponding path program 1 times [2025-02-05 10:18:16,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:16,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976794593] [2025-02-05 10:18:16,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:16,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:18:16,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:18:16,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:16,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:16,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:16,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:16,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976794593] [2025-02-05 10:18:16,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976794593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876423579] [2025-02-05 10:18:16,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:18:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:16,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:18:16,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:18:17,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-05 10:18:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-05 10:18:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:18:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:17,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:18:17,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:17,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876423579] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:17,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:17,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:18:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582088277] [2025-02-05 10:18:17,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:17,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:18:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:17,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:18:17,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:18:17,126 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:17,233 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2025-02-05 10:18:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:18:17,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-05 10:18:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:17,235 INFO L225 Difference]: With dead ends: 78 [2025-02-05 10:18:17,235 INFO L226 Difference]: Without dead ends: 52 [2025-02-05 10:18:17,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:18:17,236 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:17,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 34 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-05 10:18:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-02-05 10:18:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-02-05 10:18:17,249 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 27 [2025-02-05 10:18:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:17,251 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-02-05 10:18:17,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-02-05 10:18:17,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 10:18:17,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:17,252 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:17,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:18:17,452 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,SelfDestructingSolverStorable10 [2025-02-05 10:18:17,453 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 147266003, now seen corresponding path program 2 times [2025-02-05 10:18:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93394165] [2025-02-05 10:18:17,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:18:17,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:17,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 10:18:17,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:18:17,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:18:17,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 10:18:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93394165] [2025-02-05 10:18:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93394165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216014434] [2025-02-05 10:18:17,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:18:17,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:17,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:18:17,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:18:17,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-05 10:18:17,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 10:18:17,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:18:17,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:17,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:18:17,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:17,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:17,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:18:17,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216014434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:17,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2025-02-05 10:18:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128309177] [2025-02-05 10:18:17,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:17,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:18:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:17,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:18:17,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:18:17,850 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:18,637 INFO L93 Difference]: Finished difference Result 299 states and 403 transitions. [2025-02-05 10:18:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-05 10:18:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-05 10:18:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:18,639 INFO L225 Difference]: With dead ends: 299 [2025-02-05 10:18:18,639 INFO L226 Difference]: Without dead ends: 261 [2025-02-05 10:18:18,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 10:18:18,641 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 843 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:18,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 56 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:18:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-05 10:18:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 81. [2025-02-05 10:18:18,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:18,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-02-05 10:18:18,663 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 30 [2025-02-05 10:18:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:18,663 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-02-05 10:18:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-02-05 10:18:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:18:18,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:18,665 INFO L218 NwaCegarLoop]: trace histogram [20, 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] [2025-02-05 10:18:18,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:18:18,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:18,866 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:18,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1781327183, now seen corresponding path program 3 times [2025-02-05 10:18:18,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:18,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723183966] [2025-02-05 10:18:18,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:18:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:18,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 15 equivalence classes. [2025-02-05 10:18:18,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 50 statements. [2025-02-05 10:18:18,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 10:18:18,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 10:18:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:18,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723183966] [2025-02-05 10:18:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723183966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593980382] [2025-02-05 10:18:18,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:18:18,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:18,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:18:18,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:18:19,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 15 equivalence classes. [2025-02-05 10:18:19,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 50 statements. [2025-02-05 10:18:19,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 10:18:19,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:19,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:18:19,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 10:18:19,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-05 10:18:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593980382] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:19,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:19,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:18:19,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74917099] [2025-02-05 10:18:19,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:19,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:18:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:19,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:18:19,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:18:19,242 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:19,407 INFO L93 Difference]: Finished difference Result 323 states and 420 transitions. [2025-02-05 10:18:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:18:19,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-02-05 10:18:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:19,409 INFO L225 Difference]: With dead ends: 323 [2025-02-05 10:18:19,409 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 10:18:19,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:18:19,410 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:19,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 73 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 10:18:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 96. [2025-02-05 10:18:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2025-02-05 10:18:19,438 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 50 [2025-02-05 10:18:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:19,439 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2025-02-05 10:18:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2025-02-05 10:18:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 10:18:19,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:19,443 INFO L218 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:19,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:18:19,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:19,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2000548357, now seen corresponding path program 4 times [2025-02-05 10:18:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614139776] [2025-02-05 10:18:19,644 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:18:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:19,664 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-02-05 10:18:19,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 65 statements. [2025-02-05 10:18:19,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:18:19,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 10:18:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614139776] [2025-02-05 10:18:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614139776] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395296448] [2025-02-05 10:18:19,764 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:18:19,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:19,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:18:19,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:18:19,846 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-02-05 10:18:19,869 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 65 statements. [2025-02-05 10:18:19,870 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:18:19,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:19,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:18:19,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:18:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 10:18:19,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:18:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-05 10:18:19,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395296448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:18:19,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:18:19,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-05 10:18:19,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267939215] [2025-02-05 10:18:19,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:18:19,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:18:19,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:18:19,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:18:19,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:18:19,987 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:18:20,135 INFO L93 Difference]: Finished difference Result 309 states and 403 transitions. [2025-02-05 10:18:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:18:20,135 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 10:18:20,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:18:20,137 INFO L225 Difference]: With dead ends: 309 [2025-02-05 10:18:20,137 INFO L226 Difference]: Without dead ends: 230 [2025-02-05 10:18:20,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:18:20,137 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:18:20,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:18:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-05 10:18:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 153. [2025-02-05 10:18:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 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-05 10:18:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2025-02-05 10:18:20,184 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 65 [2025-02-05 10:18:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:18:20,185 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2025-02-05 10:18:20,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:18:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2025-02-05 10:18:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-05 10:18:20,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:18:20,187 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:18:20,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:18:20,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 10:18:20,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:18:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:18:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 373704153, now seen corresponding path program 5 times [2025-02-05 10:18:20,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:18:20,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693862423] [2025-02-05 10:18:20,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:18:20,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:18:20,415 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 20 equivalence classes. [2025-02-05 10:18:20,566 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 77 statements. [2025-02-05 10:18:20,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 10:18:20,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:18:21,036 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 297 proven. 168 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-05 10:18:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:18:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693862423] [2025-02-05 10:18:21,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693862423] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:18:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289821919] [2025-02-05 10:18:21,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:18:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:18:21,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:18:21,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:18:21,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:18:21,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 20 equivalence classes. [2025-02-05 10:19:10,350 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 77 statements. [2025-02-05 10:19:10,350 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-05 10:19:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:10,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:19:10,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 292 proven. 103 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-02-05 10:19:10,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 262 proven. 133 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-02-05 10:19:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289821919] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:10,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:10,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 32 [2025-02-05 10:19:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306028574] [2025-02-05 10:19:10,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:19:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:10,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:19:10,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:19:10,800 INFO L87 Difference]: Start difference. First operand 153 states and 195 transitions. Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:16,133 INFO L93 Difference]: Finished difference Result 985 states and 1230 transitions. [2025-02-05 10:19:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2025-02-05 10:19:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-02-05 10:19:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:16,137 INFO L225 Difference]: With dead ends: 985 [2025-02-05 10:19:16,137 INFO L226 Difference]: Without dead ends: 862 [2025-02-05 10:19:16,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29168 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=11246, Invalid=59776, Unknown=0, NotChecked=0, Total=71022 [2025-02-05 10:19:16,157 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 2513 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:16,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 399 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:19:16,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-02-05 10:19:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 307. [2025-02-05 10:19:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.2679738562091503) internal successors, (388), 306 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:16,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 388 transitions. [2025-02-05 10:19:16,223 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 388 transitions. Word has length 77 [2025-02-05 10:19:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:16,223 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 388 transitions. [2025-02-05 10:19:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 388 transitions. [2025-02-05 10:19:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 10:19:16,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:16,224 INFO L218 NwaCegarLoop]: trace histogram [80, 12, 8, 8, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:16,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:19:16,424 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,SelfDestructingSolverStorable14 [2025-02-05 10:19:16,425 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -445192129, now seen corresponding path program 6 times [2025-02-05 10:19:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978063195] [2025-02-05 10:19:16,425 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:19:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:16,469 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 51 equivalence classes. [2025-02-05 10:19:16,478 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 152 statements. [2025-02-05 10:19:16,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-05 10:19:16,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-02-05 10:19:16,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:19:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978063195] [2025-02-05 10:19:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978063195] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:19:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109776338] [2025-02-05 10:19:16,526 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:19:16,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:16,528 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:19:16,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:19:16,700 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 51 equivalence classes. [2025-02-05 10:19:16,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 152 statements. [2025-02-05 10:19:16,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-05 10:19:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:16,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:19:16,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-02-05 10:19:17,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-02-05 10:19:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109776338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:17,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-05 10:19:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816026426] [2025-02-05 10:19:17,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 10:19:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:17,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 10:19:17,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:19:17,338 INFO L87 Difference]: Start difference. First operand 307 states and 388 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:17,580 INFO L93 Difference]: Finished difference Result 1066 states and 1376 transitions. [2025-02-05 10:19:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:19:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-02-05 10:19:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:17,585 INFO L225 Difference]: With dead ends: 1066 [2025-02-05 10:19:17,585 INFO L226 Difference]: Without dead ends: 864 [2025-02-05 10:19:17,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:19:17,586 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 318 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:17,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 25 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:19:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-02-05 10:19:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 467. [2025-02-05 10:19:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.2231759656652361) internal successors, (570), 466 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:17,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 570 transitions. [2025-02-05 10:19:17,686 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 570 transitions. Word has length 152 [2025-02-05 10:19:17,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:17,686 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 570 transitions. [2025-02-05 10:19:17,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 570 transitions. [2025-02-05 10:19:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 10:19:17,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:17,689 INFO L218 NwaCegarLoop]: trace histogram [160, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:17,696 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-05 10:19:17,890 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,SelfDestructingSolverStorable15 [2025-02-05 10:19:17,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1698122029, now seen corresponding path program 7 times [2025-02-05 10:19:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078975474] [2025-02-05 10:19:17,891 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:19:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:17,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 10:19:18,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 10:19:18,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:19:18,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-02-05 10:19:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:19:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078975474] [2025-02-05 10:19:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078975474] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:19:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027166631] [2025-02-05 10:19:19,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:19:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:19,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:19,230 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-05 10:19:19,233 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-05 10:19:19,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 10:19:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 10:19:19,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:19:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:19,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 2179 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:19:19,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-02-05 10:19:19,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-02-05 10:19:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027166631] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:20,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-02-05 10:19:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965704907] [2025-02-05 10:19:20,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 10:19:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:20,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 10:19:20,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 10:19:20,125 INFO L87 Difference]: Start difference. First operand 467 states and 570 transitions. Second operand has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:20,756 INFO L93 Difference]: Finished difference Result 1463 states and 2103 transitions. [2025-02-05 10:19:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 10:19:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2025-02-05 10:19:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:20,762 INFO L225 Difference]: With dead ends: 1463 [2025-02-05 10:19:20,762 INFO L226 Difference]: Without dead ends: 1013 [2025-02-05 10:19:20,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 10:19:20,764 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 456 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:20,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 132 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:19:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-02-05 10:19:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 803. [2025-02-05 10:19:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.1895261845386533) internal successors, (954), 802 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 954 transitions. [2025-02-05 10:19:21,003 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 954 transitions. Word has length 312 [2025-02-05 10:19:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:21,003 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 954 transitions. [2025-02-05 10:19:21,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 954 transitions. [2025-02-05 10:19:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 10:19:21,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:21,010 INFO L218 NwaCegarLoop]: trace histogram [352, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:21,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:19:21,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:21,211 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:21,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1082810067, now seen corresponding path program 8 times [2025-02-05 10:19:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998826428] [2025-02-05 10:19:21,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:19:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:21,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 504 statements into 2 equivalence classes. [2025-02-05 10:19:21,546 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 10:19:21,546 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:19:21,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-02-05 10:19:24,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:19:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998826428] [2025-02-05 10:19:24,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998826428] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:19:24,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454689788] [2025-02-05 10:19:24,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:19:24,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:24,483 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-05 10:19:24,485 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-05 10:19:24,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 504 statements into 2 equivalence classes. [2025-02-05 10:19:25,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 10:19:25,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:19:25,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:25,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 3907 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 10:19:25,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-02-05 10:19:25,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-02-05 10:19:26,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454689788] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:26,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:26,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 73 [2025-02-05 10:19:26,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298006955] [2025-02-05 10:19:26,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:26,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-05 10:19:26,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:26,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-05 10:19:26,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-02-05 10:19:26,484 INFO L87 Difference]: Start difference. First operand 803 states and 954 transitions. Second operand has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:28,172 INFO L93 Difference]: Finished difference Result 2699 states and 3891 transitions. [2025-02-05 10:19:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-05 10:19:28,172 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 504 [2025-02-05 10:19:28,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:28,181 INFO L225 Difference]: With dead ends: 2699 [2025-02-05 10:19:28,181 INFO L226 Difference]: Without dead ends: 1925 [2025-02-05 10:19:28,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-02-05 10:19:28,183 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1140 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:28,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 225 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:19:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-02-05 10:19:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1475. [2025-02-05 10:19:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.1682496607869741) internal successors, (1722), 1474 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1722 transitions. [2025-02-05 10:19:28,512 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1722 transitions. Word has length 504 [2025-02-05 10:19:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:28,512 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1722 transitions. [2025-02-05 10:19:28,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:28,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1722 transitions. [2025-02-05 10:19:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2025-02-05 10:19:28,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:28,534 INFO L218 NwaCegarLoop]: trace histogram [736, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:28,549 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-05 10:19:28,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:19:28,735 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:28,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1057599187, now seen corresponding path program 9 times [2025-02-05 10:19:28,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:28,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437750626] [2025-02-05 10:19:28,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:19:28,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:29,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 888 statements into 389 equivalence classes. [2025-02-05 10:19:29,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 888 statements. [2025-02-05 10:19:29,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 10:19:29,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:29,067 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-02-05 10:19:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:19:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437750626] [2025-02-05 10:19:29,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437750626] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:19:29,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595270205] [2025-02-05 10:19:29,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:19:29,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:29,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:29,070 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-05 10:19:29,072 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-05 10:19:29,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 888 statements into 389 equivalence classes. [2025-02-05 10:19:29,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 888 statements. [2025-02-05 10:19:29,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-05 10:19:29,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:30,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:19:30,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-02-05 10:19:30,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-02-05 10:19:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595270205] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:31,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 10:19:31,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107550465] [2025-02-05 10:19:31,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:31,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:19:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:31,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:19:31,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:19:31,444 INFO L87 Difference]: Start difference. First operand 1475 states and 1722 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:31,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:31,745 INFO L93 Difference]: Finished difference Result 2194 states and 2683 transitions. [2025-02-05 10:19:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:19:31,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 888 [2025-02-05 10:19:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:31,752 INFO L225 Difference]: With dead ends: 2194 [2025-02-05 10:19:31,753 INFO L226 Difference]: Without dead ends: 1492 [2025-02-05 10:19:31,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1771 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:19:31,754 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:31,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 76 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:19:31,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-02-05 10:19:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1484. [2025-02-05 10:19:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.1625084288604182) internal successors, (1724), 1483 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1724 transitions. [2025-02-05 10:19:32,030 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1724 transitions. Word has length 888 [2025-02-05 10:19:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:32,033 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1724 transitions. [2025-02-05 10:19:32,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1724 transitions. [2025-02-05 10:19:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2025-02-05 10:19:32,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:32,039 INFO L218 NwaCegarLoop]: trace histogram [736, 48, 28, 16, 16, 12, 12, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:32,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 10:19:32,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:32,240 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:32,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:32,241 INFO L85 PathProgramCache]: Analyzing trace with hash 593242703, now seen corresponding path program 10 times [2025-02-05 10:19:32,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:32,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804068737] [2025-02-05 10:19:32,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:19:32,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:32,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 918 statements into 2 equivalence classes. [2025-02-05 10:19:32,531 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 918 statements. [2025-02-05 10:19:32,531 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:19:32,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 8 proven. 308 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-02-05 10:19:32,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:19:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804068737] [2025-02-05 10:19:32,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804068737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:19:32,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570875685] [2025-02-05 10:19:32,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:19:32,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:32,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:19:32,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:19:32,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:19:33,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 918 statements into 2 equivalence classes. [2025-02-05 10:19:33,822 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 918 statements. [2025-02-05 10:19:33,822 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:19:33,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:19:33,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:19:33,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:19:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 284 proven. 32 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-02-05 10:19:33,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:19:34,046 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 284 proven. 32 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-02-05 10:19:34,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570875685] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:19:34,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:19:34,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-02-05 10:19:34,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535105165] [2025-02-05 10:19:34,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:19:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:19:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:19:34,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:19:34,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:19:34,049 INFO L87 Difference]: Start difference. First operand 1484 states and 1724 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:19:34,727 INFO L93 Difference]: Finished difference Result 2236 states and 2700 transitions. [2025-02-05 10:19:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 10:19:34,727 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 918 [2025-02-05 10:19:34,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:19:34,734 INFO L225 Difference]: With dead ends: 2236 [2025-02-05 10:19:34,734 INFO L226 Difference]: Without dead ends: 1547 [2025-02-05 10:19:34,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1872 GetRequests, 1831 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2025-02-05 10:19:34,737 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 175 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:19:34,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 244 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:19:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-02-05 10:19:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1531. [2025-02-05 10:19:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.162091503267974) internal successors, (1778), 1530 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1778 transitions. [2025-02-05 10:19:35,279 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1778 transitions. Word has length 918 [2025-02-05 10:19:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:19:35,280 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1778 transitions. [2025-02-05 10:19:35,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:19:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1778 transitions. [2025-02-05 10:19:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2025-02-05 10:19:35,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:19:35,287 INFO L218 NwaCegarLoop]: trace histogram [736, 64, 48, 16, 16, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:19:35,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:19:35,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:19:35,488 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:19:35,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:19:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 895735965, now seen corresponding path program 11 times [2025-02-05 10:19:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:19:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309194214] [2025-02-05 10:19:35,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:19:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:19:35,756 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 972 statements into 389 equivalence classes.