./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-07 17:09:03,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:09:03,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:09:03,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:09:03,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:09:03,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:09:03,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:09:03,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:09:03,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:09:03,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:09:03,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:09:03,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:09:03,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:09:03,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:09:03,275 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:09:03,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:09:03,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:09:03,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:09:03,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:09:03,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:09:03,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:09:03,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:09:03,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:09:03,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:09:03,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:03,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:09:03,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:09:03,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:09:03,279 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-07 17:09:03,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:09:03,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:09:03,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:09:03,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:09:03,561 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:09:03,562 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-07 17:09:04,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b49d9287/abe8cdd8cf954f9a8bf4f7384cd441c2/FLAG98f651773 [2025-02-07 17:09:05,003 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:09:05,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2025-02-07 17:09:05,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b49d9287/abe8cdd8cf954f9a8bf4f7384cd441c2/FLAG98f651773 [2025-02-07 17:09:05,066 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9b49d9287/abe8cdd8cf954f9a8bf4f7384cd441c2 [2025-02-07 17:09:05,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:09:05,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:09:05,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:05,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:09:05,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:09:05,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697dc5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05, skipping insertion in model container [2025-02-07 17:09:05,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:09:05,233 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-07 17:09:05,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:05,269 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:09:05,277 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-07 17:09:05,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:09:05,313 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:09:05,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05 WrapperNode [2025-02-07 17:09:05,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:09:05,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:05,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:09:05,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:09:05,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,345 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2025-02-07 17:09:05,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:09:05,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:09:05,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:09:05,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:09:05,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,373 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-07 17:09:05,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:09:05,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:09:05,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:09:05,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:09:05,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (1/1) ... [2025-02-07 17:09:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:09:05,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:05,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:09:05,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:09:05,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:09:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:09:05,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:09:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:09:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:09:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:09:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:09:05,504 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:09:05,506 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:09:05,696 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1;main_~k~0#1 := 1 + main_~k~0#1; [2025-02-07 17:09:05,697 INFO L1324 $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-07 17:09:05,707 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-02-07 17:09:05,707 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:09:05,717 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:09:05,717 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:09:05,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:05 BoogieIcfgContainer [2025-02-07 17:09:05,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:09:05,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:09:05,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:09:05,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:09:05,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:09:05" (1/3) ... [2025-02-07 17:09:05,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c606d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:05, skipping insertion in model container [2025-02-07 17:09:05,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:09:05" (2/3) ... [2025-02-07 17:09:05,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2c606d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:09:05, skipping insertion in model container [2025-02-07 17:09:05,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:09:05" (3/3) ... [2025-02-07 17:09:05,726 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u.c [2025-02-07 17:09:05,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:09:05,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-3-u.c that has 1 procedures, 22 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-02-07 17:09:05,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:09:05,806 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;@21ff90d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:09:05,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:09:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 21 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-07 17:09:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:09:05,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:05,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:05,814 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:05,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -327891175, now seen corresponding path program 1 times [2025-02-07 17:09:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746196919] [2025-02-07 17:09:05,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:05,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:09:05,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:09:05,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:05,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746196919] [2025-02-07 17:09:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746196919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:05,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:05,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:09:05,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446556986] [2025-02-07 17:09:05,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:05,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:09:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:09:06,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:09:06,012 INFO L87 Difference]: Start difference. First operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 21 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:06,026 INFO L93 Difference]: Finished difference Result 42 states and 65 transitions. [2025-02-07 17:09:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:09:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:09:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:06,031 INFO L225 Difference]: With dead ends: 42 [2025-02-07 17:09:06,031 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 17:09:06,033 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-07 17:09:06,036 INFO L435 NwaCegarLoop]: 32 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, 32 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-07 17:09:06,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 17:09:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 17:09:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2025-02-07 17:09:06,063 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 11 [2025-02-07 17:09:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:06,063 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2025-02-07 17:09:06,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2025-02-07 17:09:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:09:06,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:06,064 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:06,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:09:06,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash -524404680, now seen corresponding path program 1 times [2025-02-07 17:09:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-02-07 17:09:06,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:09:06,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:09:06,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:06,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:09:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:06,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235198179] [2025-02-07 17:09:06,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235198179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:06,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743489238] [2025-02-07 17:09:06,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:06,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:06,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:06,230 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:06,316 INFO L93 Difference]: Finished difference Result 39 states and 64 transitions. [2025-02-07 17:09:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:09:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:06,317 INFO L225 Difference]: With dead ends: 39 [2025-02-07 17:09:06,317 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 17:09:06,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:06,318 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:06,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 14 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:09:06,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 17:09:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2025-02-07 17:09:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2025-02-07 17:09:06,329 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 11 [2025-02-07 17:09:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:06,330 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 29 transitions. [2025-02-07 17:09:06,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2025-02-07 17:09:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 17:09:06,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:06,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:06,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:09:06,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:06,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -775926796, now seen corresponding path program 1 times [2025-02-07 17:09:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90541645] [2025-02-07 17:09:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:06,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 17:09:06,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 17:09:06,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:06,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:06,446 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-07 17:09:06,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90541645] [2025-02-07 17:09:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90541645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460728276] [2025-02-07 17:09:06,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:06,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:06,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:06,450 INFO L87 Difference]: Start difference. First operand 19 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:06,527 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2025-02-07 17:09:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-07 17:09:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:06,529 INFO L225 Difference]: With dead ends: 40 [2025-02-07 17:09:06,529 INFO L226 Difference]: Without dead ends: 25 [2025-02-07 17:09:06,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:06,530 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:06,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 14 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:09:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-02-07 17:09:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-02-07 17:09:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 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-07 17:09:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2025-02-07 17:09:06,541 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 13 [2025-02-07 17:09:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:06,541 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2025-02-07 17:09:06,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2025-02-07 17:09:06,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:09:06,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:06,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:06,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:09:06,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:06,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1818109334, now seen corresponding path program 1 times [2025-02-07 17:09:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937469537] [2025-02-07 17:09:06,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:06,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:06,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:09:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:09:06,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:06,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:06,654 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-07 17:09:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937469537] [2025-02-07 17:09:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937469537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375519112] [2025-02-07 17:09:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:06,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:06,656 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:06,701 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. [2025-02-07 17:09:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 17:09:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:06,702 INFO L225 Difference]: With dead ends: 39 [2025-02-07 17:09:06,702 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 17:09:06,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:06,703 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:06,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 18 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 17:09:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2025-02-07 17:09:06,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2025-02-07 17:09:06,708 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 15 [2025-02-07 17:09:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:06,708 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2025-02-07 17:09:06,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2025-02-07 17:09:06,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 17:09:06,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:06,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:06,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 17:09:06,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:06,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash -347538188, now seen corresponding path program 1 times [2025-02-07 17:09:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:06,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575879163] [2025-02-07 17:09:06,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:06,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:06,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-07 17:09:06,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:09:06,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:06,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:06,798 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-07 17:09:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575879163] [2025-02-07 17:09:06,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575879163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:06,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:06,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:06,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273561749] [2025-02-07 17:09:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:06,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:06,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:06,801 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-07 17:09:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:06,845 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2025-02-07 17:09:06,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-07 17:09:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:06,846 INFO L225 Difference]: With dead ends: 37 [2025-02-07 17:09:06,846 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 17:09:06,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:06,848 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:06,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 17:09:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2025-02-07 17:09:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2025-02-07 17:09:06,857 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 16 [2025-02-07 17:09:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:06,858 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2025-02-07 17:09:06,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-07 17:09:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2025-02-07 17:09:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-07 17:09:06,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:06,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:06,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 17:09:06,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:06,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1867439544, now seen corresponding path program 1 times [2025-02-07 17:09:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-02-07 17:09:06,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:06,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:06,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-07 17:09:06,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-07 17:09:06,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:06,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:06,952 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-07 17:09:06,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:06,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582703946] [2025-02-07 17:09:06,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582703946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:06,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:06,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906689065] [2025-02-07 17:09:06,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:06,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:06,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:06,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:06,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:06,955 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:07,011 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2025-02-07 17:09:07,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:07,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-07 17:09:07,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:07,013 INFO L225 Difference]: With dead ends: 38 [2025-02-07 17:09:07,013 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 17:09:07,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:07,014 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:07,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:07,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 17:09:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2025-02-07 17:09:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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-07 17:09:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-07 17:09:07,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 18 [2025-02-07 17:09:07,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:07,023 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-07 17:09:07,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-07 17:09:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 17:09:07,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:07,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:07,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 17:09:07,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 695116758, now seen corresponding path program 1 times [2025-02-07 17:09:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:07,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121045596] [2025-02-07 17:09:07,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:07,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 17:09:07,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 17:09:07,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,098 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-07 17:09:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121045596] [2025-02-07 17:09:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121045596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:07,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:07,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:07,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354244986] [2025-02-07 17:09:07,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:07,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:07,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:07,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:07,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:07,100 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:07,140 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-02-07 17:09:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:07,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-07 17:09:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:07,141 INFO L225 Difference]: With dead ends: 37 [2025-02-07 17:09:07,142 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 17:09:07,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-07 17:09:07,142 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:07,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 17:09:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 17:09:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 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-07 17:09:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-02-07 17:09:07,151 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 20 [2025-02-07 17:09:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:07,152 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-02-07 17:09:07,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-02-07 17:09:07,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 17:09:07,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:07,153 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-07 17:09:07,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 17:09:07,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:07,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:07,153 INFO L85 PathProgramCache]: Analyzing trace with hash 872264600, now seen corresponding path program 1 times [2025-02-07 17:09:07,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:07,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-02-07 17:09:07,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-07 17:09:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 17:09:07,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,259 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-07 17:09:07,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:07,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252283608] [2025-02-07 17:09:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252283608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:07,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:07,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667712765] [2025-02-07 17:09:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:07,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:07,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:07,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:07,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:07,261 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-07 17:09:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:07,324 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-02-07 17:09:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-07 17:09:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:07,325 INFO L225 Difference]: With dead ends: 33 [2025-02-07 17:09:07,325 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 17:09:07,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 17:09:07,326 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:07,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:07,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 17:09:07,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-02-07 17:09:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-02-07 17:09:07,337 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 21 [2025-02-07 17:09:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-07 17:09:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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-07 17:09:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-02-07 17:09:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 17:09:07,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:07,339 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] [2025-02-07 17:09:07,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 17:09:07,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:07,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:07,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1608987052, now seen corresponding path program 1 times [2025-02-07 17:09:07,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:07,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-02-07 17:09:07,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:07,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 17:09:07,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:09:07,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,415 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-07 17:09:07,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:07,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054419301] [2025-02-07 17:09:07,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054419301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:07,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:07,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807394889] [2025-02-07 17:09:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:07,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:07,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:07,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:07,417 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:07,478 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2025-02-07 17:09:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 17:09:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:07,479 INFO L225 Difference]: With dead ends: 36 [2025-02-07 17:09:07,479 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 17:09:07,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 17:09:07,480 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:07,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:07,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 17:09:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-07 17:09:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 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-07 17:09:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-02-07 17:09:07,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 23 [2025-02-07 17:09:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:07,488 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-02-07 17:09:07,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-02-07 17:09:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 17:09:07,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:07,489 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] [2025-02-07 17:09:07,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 17:09:07,489 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -150867850, now seen corresponding path program 1 times [2025-02-07 17:09:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-02-07 17:09:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 17:09:07,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:09:07,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,570 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-07 17:09:07,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:07,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730985960] [2025-02-07 17:09:07,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730985960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:09:07,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:09:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 17:09:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296928748] [2025-02-07 17:09:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:09:07,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:09:07,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:07,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:09:07,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:09:07,572 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:07,631 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-02-07 17:09:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:09:07,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 17:09:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:07,632 INFO L225 Difference]: With dead ends: 37 [2025-02-07 17:09:07,632 INFO L226 Difference]: Without dead ends: 27 [2025-02-07 17:09:07,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-07 17:09:07,633 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 11 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.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:07,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 11 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:09:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-07 17:09:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-02-07 17:09:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-02-07 17:09:07,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 25 [2025-02-07 17:09:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-02-07 17:09:07,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-02-07 17:09:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 17:09:07,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:07,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:09:07,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 17:09:07,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:07,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 470507924, now seen corresponding path program 1 times [2025-02-07 17:09:07,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:07,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850071291] [2025-02-07 17:09:07,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 17:09:07,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:09:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,724 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-07 17:09:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850071291] [2025-02-07 17:09:07,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850071291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958656738] [2025-02-07 17:09:07,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:09:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:07,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:07,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:07,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:09:07,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-07 17:09:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:09:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:09:07,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:07,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:09:07,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:07,894 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-07 17:09:07,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:07,935 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-07 17:09:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958656738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:07,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:09:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026324952] [2025-02-07 17:09:07,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:09:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:07,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:09:07,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:09:07,936 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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-07 17:09:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:08,023 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2025-02-07 17:09:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:09:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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) Word has length 26 [2025-02-07 17:09:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:08,025 INFO L225 Difference]: With dead ends: 56 [2025-02-07 17:09:08,025 INFO L226 Difference]: Without dead ends: 33 [2025-02-07 17:09:08,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 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-07 17:09:08,026 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:08,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 25 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:09:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-07 17:09:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-02-07 17:09:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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-07 17:09:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-02-07 17:09:08,035 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 26 [2025-02-07 17:09:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:08,035 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-02-07 17:09:08,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 9 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-07 17:09:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-02-07 17:09:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 17:09:08,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:08,036 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] [2025-02-07 17:09:08,044 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-07 17:09:08,236 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-07 17:09:08,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:08,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:08,237 INFO L85 PathProgramCache]: Analyzing trace with hash -610914506, now seen corresponding path program 2 times [2025-02-07 17:09:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:08,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-02-07 17:09:08,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:08,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:08,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 17:09:08,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 17:09:08,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:08,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:08,347 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-07 17:09:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834907270] [2025-02-07 17:09:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834907270] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:08,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899638121] [2025-02-07 17:09:08,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:09:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:08,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:08,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:09:08,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-02-07 17:09:08,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 17:09:08,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:09:08,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:08,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 17:09:08,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:08,534 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-07 17:09:08,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:08,639 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-07 17:09:08,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899638121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:08,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:08,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2025-02-07 17:09:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237998813] [2025-02-07 17:09:08,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:08,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:09:08,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:08,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:09:08,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:09:08,643 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:09,253 INFO L93 Difference]: Finished difference Result 130 states and 203 transitions. [2025-02-07 17:09:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:09:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-07 17:09:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:09,254 INFO L225 Difference]: With dead ends: 130 [2025-02-07 17:09:09,254 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 17:09:09,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 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-07 17:09:09,256 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 216 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:09,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 24 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:09:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 17:09:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 50. [2025-02-07 17:09:09,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 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-07 17:09:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2025-02-07 17:09:09,276 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 29 [2025-02-07 17:09:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:09,278 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2025-02-07 17:09:09,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:09,278 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2025-02-07 17:09:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 17:09:09,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:09,279 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] [2025-02-07 17:09:09,288 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-07 17:09:09,480 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-07 17:09:09,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:09,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1449959572, now seen corresponding path program 3 times [2025-02-07 17:09:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-02-07 17:09:09,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:09,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 15 equivalence classes. [2025-02-07 17:09:09,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 49 statements. [2025-02-07 17:09:09,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:09:09,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:09,551 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-07 17:09:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702634327] [2025-02-07 17:09:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702634327] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041930900] [2025-02-07 17:09:09,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:09:09,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:09,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:09,555 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:09,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:09:09,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 49 statements into 15 equivalence classes. [2025-02-07 17:09:09,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 49 statements. [2025-02-07 17:09:09,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:09:09,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:09,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:09:09,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:09,743 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-07 17:09:09,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:09,818 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-07 17:09:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041930900] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:09,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:09:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958849674] [2025-02-07 17:09:09,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:09,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:09:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:09,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:09:09,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:09:09,819 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:09,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:09,970 INFO L93 Difference]: Finished difference Result 118 states and 147 transitions. [2025-02-07 17:09:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:09:09,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-02-07 17:09:09,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:09,972 INFO L225 Difference]: With dead ends: 118 [2025-02-07 17:09:09,972 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 17:09:09,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 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-07 17:09:09,973 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:09,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 38 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:09:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 17:09:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 65. [2025-02-07 17:09:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-02-07 17:09:10,002 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 49 [2025-02-07 17:09:10,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:10,002 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-02-07 17:09:10,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:09:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-02-07 17:09:10,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-07 17:09:10,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:10,005 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] [2025-02-07 17:09:10,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 17:09:10,209 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-07 17:09:10,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:10,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 799385016, now seen corresponding path program 4 times [2025-02-07 17:09:10,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:10,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220801193] [2025-02-07 17:09:10,210 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:09:10,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:10,234 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-02-07 17:09:10,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 64 statements. [2025-02-07 17:09:10,248 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:09:10,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:10,329 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-07 17:09:10,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220801193] [2025-02-07 17:09:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220801193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182367783] [2025-02-07 17:09:10,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:09:10,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:10,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:09:10,416 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 64 statements into 2 equivalence classes. [2025-02-07 17:09:10,441 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 64 statements. [2025-02-07 17:09:10,442 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:09:10,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:10,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:09:10,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:10,524 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-07 17:09:10,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:10,559 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-07 17:09:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182367783] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:10,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-07 17:09:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124148257] [2025-02-07 17:09:10,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:10,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 17:09:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 17:09:10,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-07 17:09:10,561 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-07 17:09:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:09:10,690 INFO L93 Difference]: Finished difference Result 180 states and 229 transitions. [2025-02-07 17:09:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:09:10,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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 64 [2025-02-07 17:09:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:09:10,691 INFO L225 Difference]: With dead ends: 180 [2025-02-07 17:09:10,691 INFO L226 Difference]: Without dead ends: 132 [2025-02-07 17:09:10,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 122 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-07 17:09:10,692 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:09:10,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:09:10,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-07 17:09:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 90. [2025-02-07 17:09:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 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-07 17:09:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2025-02-07 17:09:10,721 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 64 [2025-02-07 17:09:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:09:10,721 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2025-02-07 17:09:10,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-07 17:09:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2025-02-07 17:09:10,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 17:09:10,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:09:10,724 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] [2025-02-07 17:09:10,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 17:09:10,924 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-07 17:09:10,925 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:09:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:09:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash -532993514, now seen corresponding path program 5 times [2025-02-07 17:09:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:09:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-02-07 17:09:10,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:09:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:09:10,951 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 20 equivalence classes. [2025-02-07 17:09:11,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 76 statements. [2025-02-07 17:09:11,086 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-07 17:09:11,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:11,554 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-07 17:09:11,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:09:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707353140] [2025-02-07 17:09:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707353140] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:09:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522976143] [2025-02-07 17:09:11,554 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:09:11,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:09:11,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:09:11,557 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:09:11,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:09:11,659 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 76 statements into 20 equivalence classes. [2025-02-07 17:09:59,114 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 76 statements. [2025-02-07 17:09:59,114 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-02-07 17:09:59,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:09:59,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 17:09:59,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:09:59,332 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-07 17:09:59,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:09:59,520 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-07 17:09:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522976143] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:09:59,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:09:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 32 [2025-02-07 17:09:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212792145] [2025-02-07 17:09:59,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:09:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 17:09:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:09:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 17:09:59,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-02-07 17:09:59,522 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:02,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:02,349 INFO L93 Difference]: Finished difference Result 409 states and 614 transitions. [2025-02-07 17:10:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-02-07 17:10:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-07 17:10:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:02,351 INFO L225 Difference]: With dead ends: 409 [2025-02-07 17:10:02,351 INFO L226 Difference]: Without dead ends: 348 [2025-02-07 17:10:02,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9231 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4862, Invalid=19944, Unknown=0, NotChecked=0, Total=24806 [2025-02-07 17:10:02,361 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 388 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:02,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 47 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 17:10:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-07 17:10:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 180. [2025-02-07 17:10:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.2067039106145252) internal successors, (216), 179 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2025-02-07 17:10:02,410 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 76 [2025-02-07 17:10:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:02,411 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2025-02-07 17:10:02,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.375) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2025-02-07 17:10:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-07 17:10:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:02,412 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] [2025-02-07 17:10:02,481 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-07 17:10:02,613 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-07 17:10:02,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:02,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 519132130, now seen corresponding path program 6 times [2025-02-07 17:10:02,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:02,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4485315] [2025-02-07 17:10:02,614 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:10:02,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:02,662 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 51 equivalence classes. [2025-02-07 17:10:02,671 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 151 statements. [2025-02-07 17:10:02,672 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:10:02,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:02,713 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-07 17:10:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4485315] [2025-02-07 17:10:02,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4485315] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:02,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188849635] [2025-02-07 17:10:02,714 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:10:02,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:02,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:02,717 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:02,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:10:02,869 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 51 equivalence classes. [2025-02-07 17:10:02,890 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 151 statements. [2025-02-07 17:10:02,890 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:10:02,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:02,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 17:10:02,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:03,266 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-07 17:10:03,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:03,423 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-07 17:10:03,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188849635] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:03,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:03,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-07 17:10:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-02-07 17:10:03,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:03,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:10:03,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:03,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:10:03,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:10:03,424 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 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-07 17:10:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:03,576 INFO L93 Difference]: Finished difference Result 416 states and 504 transitions. [2025-02-07 17:10:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:10:03,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 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 151 [2025-02-07 17:10:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:03,578 INFO L225 Difference]: With dead ends: 416 [2025-02-07 17:10:03,578 INFO L226 Difference]: Without dead ends: 340 [2025-02-07 17:10:03,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 295 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-07 17:10:03,579 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:03,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 15 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-02-07 17:10:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-02-07 17:10:03,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.1740412979351031) internal successors, (398), 339 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 398 transitions. [2025-02-07 17:10:03,657 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 398 transitions. Word has length 151 [2025-02-07 17:10:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:03,657 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 398 transitions. [2025-02-07 17:10:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 10 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-07 17:10:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 398 transitions. [2025-02-07 17:10:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-07 17:10:03,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:03,660 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] [2025-02-07 17:10:03,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 17:10:03,860 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-07 17:10:03,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:03,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash -196790064, now seen corresponding path program 7 times [2025-02-07 17:10:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:03,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-02-07 17:10:03,861 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:10:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-07 17:10:04,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-07 17:10:04,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:04,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:05,135 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-07 17:10:05,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100286460] [2025-02-07 17:10:05,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100286460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:05,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397572251] [2025-02-07 17:10:05,136 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:10:05,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:05,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:05,138 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:05,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 17:10:05,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-07 17:10:05,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-07 17:10:05,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:10:05,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:05,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 2179 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-07 17:10:05,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:05,768 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-07 17:10:05,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:05,971 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-07 17:10:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397572251] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-02-07 17:10:05,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634049886] [2025-02-07 17:10:05,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:05,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-07 17:10:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:05,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-07 17:10:05,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-02-07 17:10:05,974 INFO L87 Difference]: Start difference. First operand 340 states and 398 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:06,498 INFO L93 Difference]: Finished difference Result 1024 states and 1499 transitions. [2025-02-07 17:10:06,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-07 17:10:06,499 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 311 [2025-02-07 17:10:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:06,502 INFO L225 Difference]: With dead ends: 1024 [2025-02-07 17:10:06,502 INFO L226 Difference]: Without dead ends: 700 [2025-02-07 17:10:06,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 598 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-07 17:10:06,504 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:06,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-07 17:10:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 532. [2025-02-07 17:10:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.1111111111111112) internal successors, (590), 531 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 590 transitions. [2025-02-07 17:10:06,612 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 590 transitions. Word has length 311 [2025-02-07 17:10:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 590 transitions. [2025-02-07 17:10:06,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 590 transitions. [2025-02-07 17:10:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-07 17:10:06,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:06,618 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] [2025-02-07 17:10:06,629 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-07 17:10:06,819 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-07 17:10:06,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1634219824, now seen corresponding path program 8 times [2025-02-07 17:10:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-02-07 17:10:06,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:10:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:06,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 503 statements into 2 equivalence classes. [2025-02-07 17:10:07,112 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 503 of 503 statements. [2025-02-07 17:10:07,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:10:07,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:09,927 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-07 17:10:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759411991] [2025-02-07 17:10:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759411991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006745591] [2025-02-07 17:10:09,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:10:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:09,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:09,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:10:10,370 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 503 statements into 2 equivalence classes. [2025-02-07 17:10:10,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 503 of 503 statements. [2025-02-07 17:10:10,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:10:10,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:10,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 3907 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-07 17:10:10,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:11,146 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-07 17:10:11,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:11,953 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-07 17:10:11,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006745591] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:11,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:11,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-02-07 17:10:11,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087553160] [2025-02-07 17:10:11,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:11,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-02-07 17:10:11,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:11,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-02-07 17:10:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-02-07 17:10:11,957 INFO L87 Difference]: Start difference. First operand 532 states and 590 transitions. Second operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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-07 17:10:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:13,216 INFO L93 Difference]: Finished difference Result 1780 states and 2639 transitions. [2025-02-07 17:10:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-07 17:10:13,217 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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) Word has length 503 [2025-02-07 17:10:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:13,222 INFO L225 Difference]: With dead ends: 1780 [2025-02-07 17:10:13,222 INFO L226 Difference]: Without dead ends: 1276 [2025-02-07 17:10:13,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1052 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-02-07 17:10:13,225 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 133 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:13,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 46 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:10:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-02-07 17:10:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 916. [2025-02-07 17:10:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 1.0644808743169398) internal successors, (974), 915 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 974 transitions. [2025-02-07 17:10:13,423 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 974 transitions. Word has length 503 [2025-02-07 17:10:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 974 transitions. [2025-02-07 17:10:13,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 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-07 17:10:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 974 transitions. [2025-02-07 17:10:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2025-02-07 17:10:13,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:13,444 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] [2025-02-07 17:10:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 17:10:13,645 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-07 17:10:13,645 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1803491120, now seen corresponding path program 9 times [2025-02-07 17:10:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095057676] [2025-02-07 17:10:13,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:10:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:13,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 887 statements into 389 equivalence classes. [2025-02-07 17:10:13,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 887 statements. [2025-02-07 17:10:13,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 17:10:13,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:14,028 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-07 17:10:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095057676] [2025-02-07 17:10:14,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095057676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:14,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095708850] [2025-02-07 17:10:14,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:10:14,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:14,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:14,031 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:10:14,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:10:14,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 887 statements into 389 equivalence classes. [2025-02-07 17:10:15,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 35 of 887 statements. [2025-02-07 17:10:15,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-02-07 17:10:15,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:15,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 17:10:15,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:15,764 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-07 17:10:15,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:16,439 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-07 17:10:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095708850] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:16,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-07 17:10:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606340896] [2025-02-07 17:10:16,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:16,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:10:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:16,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:10:16,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:10:16,441 INFO L87 Difference]: Start difference. First operand 916 states and 974 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:16,790 INFO L93 Difference]: Finished difference Result 1069 states and 1184 transitions. [2025-02-07 17:10:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 17:10:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 887 [2025-02-07 17:10:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:16,798 INFO L225 Difference]: With dead ends: 1069 [2025-02-07 17:10:16,798 INFO L226 Difference]: Without dead ends: 925 [2025-02-07 17:10:16,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1778 GetRequests, 1768 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-07 17:10:16,799 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:16,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:10:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-02-07 17:10:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 925. [2025-02-07 17:10:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.0562770562770563) internal successors, (976), 924 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 976 transitions. [2025-02-07 17:10:17,045 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 976 transitions. Word has length 887 [2025-02-07 17:10:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:17,045 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 976 transitions. [2025-02-07 17:10:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 976 transitions. [2025-02-07 17:10:17,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2025-02-07 17:10:17,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:17,052 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] [2025-02-07 17:10:17,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 17:10:17,252 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-07 17:10:17,252 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:17,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1203503794, now seen corresponding path program 10 times [2025-02-07 17:10:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:17,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489206066] [2025-02-07 17:10:17,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:10:17,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:17,482 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 917 statements into 2 equivalence classes. [2025-02-07 17:10:17,540 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 917 statements. [2025-02-07 17:10:17,540 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:10:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:17,733 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-07 17:10:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:10:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489206066] [2025-02-07 17:10:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489206066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:10:17,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438898715] [2025-02-07 17:10:17,734 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:10:17,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:10:17,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:10:17,736 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-07 17:10:17,738 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-07 17:10:18,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 917 statements into 2 equivalence classes. [2025-02-07 17:10:18,878 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 917 statements. [2025-02-07 17:10:18,878 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-07 17:10:18,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:10:18,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-07 17:10:18,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:10:19,021 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-07 17:10:19,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:10:19,100 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-07 17:10:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438898715] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:10:19,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:10:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-02-07 17:10:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104022793] [2025-02-07 17:10:19,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:10:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 17:10:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:10:19,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 17:10:19,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-02-07 17:10:19,102 INFO L87 Difference]: Start difference. First operand 925 states and 976 transitions. Second operand has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:10:19,688 INFO L93 Difference]: Finished difference Result 1103 states and 1197 transitions. [2025-02-07 17:10:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 17:10:19,688 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 917 [2025-02-07 17:10:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:10:19,694 INFO L225 Difference]: With dead ends: 1103 [2025-02-07 17:10:19,694 INFO L226 Difference]: Without dead ends: 972 [2025-02-07 17:10:19,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1864 GetRequests, 1823 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-07 17:10:19,696 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:10:19,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 63 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:10:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-02-07 17:10:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2025-02-07 17:10:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.0607621009268795) internal successors, (1030), 971 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1030 transitions. [2025-02-07 17:10:20,028 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1030 transitions. Word has length 917 [2025-02-07 17:10:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:10:20,029 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1030 transitions. [2025-02-07 17:10:20,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:10:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1030 transitions. [2025-02-07 17:10:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2025-02-07 17:10:20,035 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:10:20,035 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] [2025-02-07 17:10:20,044 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-07 17:10:20,235 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-07 17:10:20,236 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:10:20,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:10:20,236 INFO L85 PathProgramCache]: Analyzing trace with hash 537831616, now seen corresponding path program 11 times [2025-02-07 17:10:20,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:10:20,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328842575] [2025-02-07 17:10:20,237 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:10:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:10:20,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 971 statements into 389 equivalence classes.