./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i --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/uthash-2.0.2/uthash_JEN_nondet_test4-2.i -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 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:52:55,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:52:55,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 04:52:55,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:52:55,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:52:55,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:52:55,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:52:55,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:52:55,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:52:55,855 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:52:55,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:52:55,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:52:55,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:52:55,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:52:55,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:52:55,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:52:55,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:52:55,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:52:55,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:52:55,858 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 -> 6c763f0e5b490114d32e3c1ec14f736caee058b985a7ee61f4d14ad6758e2996 [2025-02-08 04:52:56,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:52:56,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:52:56,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:52:56,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:52:56,068 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:52:56,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i [2025-02-08 04:52:57,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065793e48/e74e5c2906ea4a558fabf1774e11604d/FLAG2aa7792bc [2025-02-08 04:52:57,583 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:52:57,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test4-2.i [2025-02-08 04:52:57,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065793e48/e74e5c2906ea4a558fabf1774e11604d/FLAG2aa7792bc [2025-02-08 04:52:57,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/065793e48/e74e5c2906ea4a558fabf1774e11604d [2025-02-08 04:52:57,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:52:57,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:52:57,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:52:57,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:52:57,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:52:57,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:52:57" (1/1) ... [2025-02-08 04:52:57,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d44721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:57, skipping insertion in model container [2025-02-08 04:52:57,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:52:57" (1/1) ... [2025-02-08 04:52:57,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:52:58,078 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/uthash-2.0.2/uthash_JEN_nondet_test4-2.i[33519,33532] [2025-02-08 04:52:58,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:52:58,183 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:52:58,203 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/uthash-2.0.2/uthash_JEN_nondet_test4-2.i[33519,33532] [2025-02-08 04:52:58,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:52:58,290 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:52:58,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58 WrapperNode [2025-02-08 04:52:58,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:52:58,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:52:58,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:52:58,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:52:58,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,362 INFO L138 Inliner]: procedures = 176, calls = 376, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1662 [2025-02-08 04:52:58,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:52:58,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:52:58,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:52:58,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:52:58,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,454 INFO L175 MemorySlicer]: Split 357 memory accesses to 2 slices as follows [2, 355]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 90 writes are split as follows [0, 90]. [2025-02-08 04:52:58,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,489 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:52:58,513 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:52:58,513 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:52:58,513 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:52:58,513 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (1/1) ... [2025-02-08 04:52:58,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:52:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:52:58,557 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-08 04:52:58,567 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-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:52:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:52:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:52:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:52:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:52:58,752 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:52:58,753 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:53:00,073 INFO L? ?]: Removed 400 outVars from TransFormulas that were not future-live. [2025-02-08 04:53:00,073 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:53:00,122 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:53:00,122 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:53:00,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:53:00 BoogieIcfgContainer [2025-02-08 04:53:00,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:53:00,124 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:53:00,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:53:00,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:53:00,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:52:57" (1/3) ... [2025-02-08 04:53:00,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34473286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:53:00, skipping insertion in model container [2025-02-08 04:53:00,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:52:58" (2/3) ... [2025-02-08 04:53:00,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34473286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:53:00, skipping insertion in model container [2025-02-08 04:53:00,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:53:00" (3/3) ... [2025-02-08 04:53:00,129 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test4-2.i [2025-02-08 04:53:00,138 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:53:00,139 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test4-2.i that has 3 procedures, 433 locations, 1 initial locations, 41 loop locations, and 1 error locations. [2025-02-08 04:53:00,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:53:00,185 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;@79085477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:53:00,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:53:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 419 states have (on average 1.6133651551312649) internal successors, (676), 421 states have internal predecessors, (676), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 04:53:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:53:00,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:00,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:53:00,193 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1655517507, now seen corresponding path program 1 times [2025-02-08 04:53:00,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:00,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821247899] [2025-02-08 04:53:00,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:00,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:00,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:53:00,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:53:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:00,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:00,464 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-08 04:53:00,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:00,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821247899] [2025-02-08 04:53:00,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821247899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:00,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:00,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:53:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161613737] [2025-02-08 04:53:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:53:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:00,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:53:00,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:53:00,484 INFO L87 Difference]: Start difference. First operand has 429 states, 419 states have (on average 1.6133651551312649) internal successors, (676), 421 states have internal predecessors, (676), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:53:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:00,973 INFO L93 Difference]: Finished difference Result 1173 states and 1888 transitions. [2025-02-08 04:53:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:53:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-08 04:53:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:00,983 INFO L225 Difference]: With dead ends: 1173 [2025-02-08 04:53:00,983 INFO L226 Difference]: Without dead ends: 710 [2025-02-08 04:53:00,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:53:00,987 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 464 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:00,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1634 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:53:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-02-08 04:53:01,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-02-08 04:53:01,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 699 states have (on average 1.4606580829756795) internal successors, (1021), 699 states have internal predecessors, (1021), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1039 transitions. [2025-02-08 04:53:01,039 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1039 transitions. Word has length 8 [2025-02-08 04:53:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:01,039 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1039 transitions. [2025-02-08 04:53:01,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 04:53:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1039 transitions. [2025-02-08 04:53:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:53:01,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:01,044 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:53:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:53:01,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -718794914, now seen corresponding path program 1 times [2025-02-08 04:53:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457983389] [2025-02-08 04:53:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:01,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:53:01,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:53:01,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:01,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:53:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:01,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457983389] [2025-02-08 04:53:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457983389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:01,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:01,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:53:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141576214] [2025-02-08 04:53:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:01,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:53:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:01,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:53:01,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:53:01,558 INFO L87 Difference]: Start difference. First operand 710 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:01,714 INFO L93 Difference]: Finished difference Result 1368 states and 1997 transitions. [2025-02-08 04:53:01,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:53:01,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 04:53:01,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:01,717 INFO L225 Difference]: With dead ends: 1368 [2025-02-08 04:53:01,717 INFO L226 Difference]: Without dead ends: 716 [2025-02-08 04:53:01,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 04:53:01,723 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 106 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:01,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1410 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:53:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-08 04:53:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 710. [2025-02-08 04:53:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 699 states have (on average 1.4406294706723892) internal successors, (1007), 699 states have internal predecessors, (1007), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1025 transitions. [2025-02-08 04:53:01,776 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1025 transitions. Word has length 167 [2025-02-08 04:53:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:01,776 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1025 transitions. [2025-02-08 04:53:01,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1025 transitions. [2025-02-08 04:53:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:53:01,783 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:01,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:53:01,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:53:01,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:01,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash 207587191, now seen corresponding path program 1 times [2025-02-08 04:53:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:01,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947222181] [2025-02-08 04:53:01,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:01,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:53:01,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:53:01,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:01,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:53:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947222181] [2025-02-08 04:53:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947222181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:53:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336993059] [2025-02-08 04:53:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:02,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:53:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:02,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:53:02,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:53:02,065 INFO L87 Difference]: Start difference. First operand 710 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:02,172 INFO L93 Difference]: Finished difference Result 1358 states and 1964 transitions. [2025-02-08 04:53:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:53:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 04:53:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:02,175 INFO L225 Difference]: With dead ends: 1358 [2025-02-08 04:53:02,177 INFO L226 Difference]: Without dead ends: 722 [2025-02-08 04:53:02,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:53:02,178 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:02,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1002 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:53:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-02-08 04:53:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2025-02-08 04:53:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 711 states have (on average 1.4331926863572433) internal successors, (1019), 711 states have internal predecessors, (1019), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1037 transitions. [2025-02-08 04:53:02,198 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1037 transitions. Word has length 167 [2025-02-08 04:53:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:02,199 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1037 transitions. [2025-02-08 04:53:02,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1037 transitions. [2025-02-08 04:53:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:53:02,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:02,203 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:53:02,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:53:02,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:02,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1669681704, now seen corresponding path program 1 times [2025-02-08 04:53:02,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:02,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000460640] [2025-02-08 04:53:02,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:02,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:53:02,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:53:02,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:02,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 04:53:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:02,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000460640] [2025-02-08 04:53:02,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000460640] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:02,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:02,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:53:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394557652] [2025-02-08 04:53:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:02,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:53:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:02,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:53:02,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:53:02,402 INFO L87 Difference]: Start difference. First operand 722 states and 1037 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:02,521 INFO L93 Difference]: Finished difference Result 1296 states and 1864 transitions. [2025-02-08 04:53:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:53:02,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2025-02-08 04:53:02,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:02,524 INFO L225 Difference]: With dead ends: 1296 [2025-02-08 04:53:02,524 INFO L226 Difference]: Without dead ends: 720 [2025-02-08 04:53:02,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:53:02,525 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 134 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:02,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1026 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:53:02,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-02-08 04:53:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-02-08 04:53:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4330042313117066) internal successors, (1016), 709 states have internal predecessors, (1016), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1034 transitions. [2025-02-08 04:53:02,546 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1034 transitions. Word has length 167 [2025-02-08 04:53:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:02,546 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1034 transitions. [2025-02-08 04:53:02,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 04:53:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1034 transitions. [2025-02-08 04:53:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:53:02,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:02,548 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:02,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:53:02,548 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:02,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1517880038, now seen corresponding path program 1 times [2025-02-08 04:53:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:02,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678036775] [2025-02-08 04:53:02,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:53:02,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:53:02,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:02,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:53:02,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:02,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678036775] [2025-02-08 04:53:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678036775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:02,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:53:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192099008] [2025-02-08 04:53:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:02,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:53:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:02,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:53:02,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:53:02,865 INFO L87 Difference]: Start difference. First operand 720 states and 1034 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:53:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:03,000 INFO L93 Difference]: Finished difference Result 1156 states and 1657 transitions. [2025-02-08 04:53:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:53:03,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 182 [2025-02-08 04:53:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:03,004 INFO L225 Difference]: With dead ends: 1156 [2025-02-08 04:53:03,004 INFO L226 Difference]: Without dead ends: 636 [2025-02-08 04:53:03,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 04:53:03,007 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 30 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:03,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1259 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:53:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-02-08 04:53:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2025-02-08 04:53:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 625 states have (on average 1.3792) internal successors, (862), 625 states have internal predecessors, (862), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 880 transitions. [2025-02-08 04:53:03,020 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 880 transitions. Word has length 182 [2025-02-08 04:53:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 880 transitions. [2025-02-08 04:53:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:53:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 880 transitions. [2025-02-08 04:53:03,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:53:03,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:03,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:53:03,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:03,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1154951532, now seen corresponding path program 1 times [2025-02-08 04:53:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:03,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338829976] [2025-02-08 04:53:03,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:03,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:53:03,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:53:03,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:03,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 04:53:03,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:03,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338829976] [2025-02-08 04:53:03,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338829976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:03,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605793253] [2025-02-08 04:53:03,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:03,746 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-08 04:53:03,749 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-08 04:53:03,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:53:04,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:53:04,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:04,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:04,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 04:53:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:04,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-02-08 04:53:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 04:53:04,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:53:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605793253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:53:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 04:53:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204973709] [2025-02-08 04:53:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:53:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:04,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:53:04,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:53:04,991 INFO L87 Difference]: Start difference. First operand 636 states and 880 transitions. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:07,278 INFO L93 Difference]: Finished difference Result 1279 states and 1760 transitions. [2025-02-08 04:53:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:53:07,279 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-02-08 04:53:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:07,281 INFO L225 Difference]: With dead ends: 1279 [2025-02-08 04:53:07,281 INFO L226 Difference]: Without dead ends: 733 [2025-02-08 04:53:07,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:53:07,283 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 712 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:07,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 2779 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 04:53:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-02-08 04:53:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 667. [2025-02-08 04:53:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 656 states have (on average 1.3689024390243902) internal successors, (898), 656 states have internal predecessors, (898), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-08 04:53:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 916 transitions. [2025-02-08 04:53:07,297 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 916 transitions. Word has length 182 [2025-02-08 04:53:07,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:07,297 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 916 transitions. [2025-02-08 04:53:07,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 916 transitions. [2025-02-08 04:53:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 04:53:07,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:07,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:07,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 04:53:07,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:07,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:07,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1001761332, now seen corresponding path program 1 times [2025-02-08 04:53:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:07,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697532579] [2025-02-08 04:53:07,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:07,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:53:07,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:53:07,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:07,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-08 04:53:08,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697532579] [2025-02-08 04:53:08,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697532579] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:08,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868632807] [2025-02-08 04:53:08,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:08,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:08,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:08,057 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-08 04:53:08,057 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-08 04:53:08,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:53:08,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:53:08,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:08,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:08,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 04:53:08,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:08,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 04:53:08,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:53:08,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868632807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:08,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:53:08,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-02-08 04:53:08,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855205142] [2025-02-08 04:53:08,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:08,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:53:08,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:08,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:53:08,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:53:08,653 INFO L87 Difference]: Start difference. First operand 667 states and 916 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:53:08,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:08,817 INFO L93 Difference]: Finished difference Result 1227 states and 1692 transitions. [2025-02-08 04:53:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:53:08,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 183 [2025-02-08 04:53:08,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:08,821 INFO L225 Difference]: With dead ends: 1227 [2025-02-08 04:53:08,821 INFO L226 Difference]: Without dead ends: 731 [2025-02-08 04:53:08,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:53:08,822 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 445 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:08,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1738 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:53:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-02-08 04:53:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 670. [2025-02-08 04:53:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 658 states have (on average 1.3693009118541033) internal successors, (901), 659 states have internal predecessors, (901), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 922 transitions. [2025-02-08 04:53:08,839 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 922 transitions. Word has length 183 [2025-02-08 04:53:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:08,839 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 922 transitions. [2025-02-08 04:53:08,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:53:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 922 transitions. [2025-02-08 04:53:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-08 04:53:08,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:08,842 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:08,854 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-08 04:53:09,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:09,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:09,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:09,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2000653428, now seen corresponding path program 1 times [2025-02-08 04:53:09,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:09,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94947389] [2025-02-08 04:53:09,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:09,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:09,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 04:53:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 04:53:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 04:53:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94947389] [2025-02-08 04:53:09,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94947389] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:09,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272944796] [2025-02-08 04:53:09,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:09,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:09,899 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-08 04:53:09,901 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-08 04:53:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 04:53:10,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 04:53:10,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:10,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:10,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 04:53:10,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 04:53:10,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:53:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272944796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:53:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-02-08 04:53:10,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921319628] [2025-02-08 04:53:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:10,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:53:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:10,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:53:10,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:53:10,372 INFO L87 Difference]: Start difference. First operand 670 states and 922 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:10,583 INFO L93 Difference]: Finished difference Result 1268 states and 1748 transitions. [2025-02-08 04:53:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:53:10,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-02-08 04:53:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:10,586 INFO L225 Difference]: With dead ends: 1268 [2025-02-08 04:53:10,586 INFO L226 Difference]: Without dead ends: 719 [2025-02-08 04:53:10,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:53:10,589 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 17 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:10,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1142 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:53:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2025-02-08 04:53:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 703. [2025-02-08 04:53:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 691 states have (on average 1.3603473227206946) internal successors, (940), 692 states have internal predecessors, (940), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 961 transitions. [2025-02-08 04:53:10,606 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 961 transitions. Word has length 187 [2025-02-08 04:53:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:10,606 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 961 transitions. [2025-02-08 04:53:10,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 961 transitions. [2025-02-08 04:53:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-08 04:53:10,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:10,607 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:10,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 04:53:10,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:10,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:10,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:10,813 INFO L85 PathProgramCache]: Analyzing trace with hash -452567439, now seen corresponding path program 1 times [2025-02-08 04:53:10,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:10,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387036970] [2025-02-08 04:53:10,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:10,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-08 04:53:10,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-08 04:53:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:10,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 04:53:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:11,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387036970] [2025-02-08 04:53:11,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387036970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:11,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:11,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:53:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554114644] [2025-02-08 04:53:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:53:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:11,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:53:11,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:53:11,163 INFO L87 Difference]: Start difference. First operand 703 states and 961 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:11,580 INFO L93 Difference]: Finished difference Result 1293 states and 1773 transitions. [2025-02-08 04:53:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:53:11,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-02-08 04:53:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:11,583 INFO L225 Difference]: With dead ends: 1293 [2025-02-08 04:53:11,583 INFO L226 Difference]: Without dead ends: 715 [2025-02-08 04:53:11,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:53:11,585 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 8 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:11,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1703 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:53:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-02-08 04:53:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 711. [2025-02-08 04:53:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 699 states have (on average 1.3590844062947067) internal successors, (950), 700 states have internal predecessors, (950), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 971 transitions. [2025-02-08 04:53:11,603 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 971 transitions. Word has length 188 [2025-02-08 04:53:11,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:11,603 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 971 transitions. [2025-02-08 04:53:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 971 transitions. [2025-02-08 04:53:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 04:53:11,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:11,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:11,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 04:53:11,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:11,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:11,607 INFO L85 PathProgramCache]: Analyzing trace with hash -792592176, now seen corresponding path program 1 times [2025-02-08 04:53:11,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:11,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423994957] [2025-02-08 04:53:11,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:11,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 04:53:11,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 04:53:11,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-08 04:53:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423994957] [2025-02-08 04:53:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423994957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:11,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:11,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:53:11,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171085354] [2025-02-08 04:53:11,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:11,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:53:11,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:11,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:53:11,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:53:11,941 INFO L87 Difference]: Start difference. First operand 711 states and 971 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:12,417 INFO L93 Difference]: Finished difference Result 1308 states and 1793 transitions. [2025-02-08 04:53:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:53:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-02-08 04:53:12,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:12,420 INFO L225 Difference]: With dead ends: 1308 [2025-02-08 04:53:12,420 INFO L226 Difference]: Without dead ends: 733 [2025-02-08 04:53:12,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:53:12,421 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 12 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2015 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:12,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2015 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 04:53:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-02-08 04:53:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 727. [2025-02-08 04:53:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 715 states have (on average 1.3594405594405594) internal successors, (972), 716 states have internal predecessors, (972), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 993 transitions. [2025-02-08 04:53:12,434 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 993 transitions. Word has length 189 [2025-02-08 04:53:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:12,434 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 993 transitions. [2025-02-08 04:53:12,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 993 transitions. [2025-02-08 04:53:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 04:53:12,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:12,436 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:12,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:53:12,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:12,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash 18764545, now seen corresponding path program 1 times [2025-02-08 04:53:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:12,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83829774] [2025-02-08 04:53:12,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:12,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:12,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 04:53:12,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 04:53:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 04:53:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83829774] [2025-02-08 04:53:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83829774] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551886219] [2025-02-08 04:53:13,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:13,094 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-08 04:53:13,095 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-08 04:53:13,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 04:53:13,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 04:53:13,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:13,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:13,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 04:53:13,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 04:53:13,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:53:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-08 04:53:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551886219] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:53:13,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:53:13,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 11 [2025-02-08 04:53:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327075235] [2025-02-08 04:53:13,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:53:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:53:13,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:53:13,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 04:53:13,911 INFO L87 Difference]: Start difference. First operand 727 states and 993 transitions. Second operand has 11 states, 11 states have (on average 35.90909090909091) internal successors, (395), 11 states have internal predecessors, (395), 3 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-08 04:53:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:14,173 INFO L93 Difference]: Finished difference Result 1342 states and 1846 transitions. [2025-02-08 04:53:14,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:53:14,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 35.90909090909091) internal successors, (395), 11 states have internal predecessors, (395), 3 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 189 [2025-02-08 04:53:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:14,178 INFO L225 Difference]: With dead ends: 1342 [2025-02-08 04:53:14,178 INFO L226 Difference]: Without dead ends: 797 [2025-02-08 04:53:14,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-08 04:53:14,180 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 316 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:14,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1852 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:53:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-02-08 04:53:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 736. [2025-02-08 04:53:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 723 states have (on average 1.3609958506224067) internal successors, (984), 724 states have internal predecessors, (984), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1005 transitions. [2025-02-08 04:53:14,194 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1005 transitions. Word has length 189 [2025-02-08 04:53:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1005 transitions. [2025-02-08 04:53:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.90909090909091) internal successors, (395), 11 states have internal predecessors, (395), 3 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-08 04:53:14,194 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1005 transitions. [2025-02-08 04:53:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-08 04:53:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:14,196 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:14,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 04:53:14,396 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,SelfDestructingSolverStorable10 [2025-02-08 04:53:14,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:14,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1571029503, now seen corresponding path program 2 times [2025-02-08 04:53:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410613126] [2025-02-08 04:53:14,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:53:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:14,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-02-08 04:53:14,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 04:53:14,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 04:53:14,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 04:53:14,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410613126] [2025-02-08 04:53:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410613126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:14,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862612653] [2025-02-08 04:53:14,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 04:53:14,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:14,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:14,992 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-08 04:53:14,994 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-08 04:53:15,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 197 statements into 2 equivalence classes. [2025-02-08 04:53:15,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 197 of 197 statements. [2025-02-08 04:53:15,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 04:53:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:15,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 04:53:15,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-08 04:53:15,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 04:53:20,299 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 70 refuted. 1 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-08 04:53:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862612653] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 04:53:20,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 04:53:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 23 [2025-02-08 04:53:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755013000] [2025-02-08 04:53:20,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 04:53:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 04:53:20,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:20,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 04:53:20,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=382, Unknown=1, NotChecked=0, Total=506 [2025-02-08 04:53:20,301 INFO L87 Difference]: Start difference. First operand 736 states and 1005 transitions. Second operand has 23 states, 23 states have (on average 15.26086956521739) internal successors, (351), 23 states have internal predecessors, (351), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 04:53:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:21,191 INFO L93 Difference]: Finished difference Result 1411 states and 1946 transitions. [2025-02-08 04:53:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 04:53:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 15.26086956521739) internal successors, (351), 23 states have internal predecessors, (351), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 197 [2025-02-08 04:53:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:21,194 INFO L225 Difference]: With dead ends: 1411 [2025-02-08 04:53:21,194 INFO L226 Difference]: Without dead ends: 721 [2025-02-08 04:53:21,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=280, Invalid=711, Unknown=1, NotChecked=0, Total=992 [2025-02-08 04:53:21,196 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 1099 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:21,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 4552 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 04:53:21,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-08 04:53:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 660. [2025-02-08 04:53:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3446676970633693) internal successors, (870), 648 states have internal predecessors, (870), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 891 transitions. [2025-02-08 04:53:21,208 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 891 transitions. Word has length 197 [2025-02-08 04:53:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:21,208 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 891 transitions. [2025-02-08 04:53:21,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.26086956521739) internal successors, (351), 23 states have internal predecessors, (351), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-08 04:53:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 891 transitions. [2025-02-08 04:53:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-02-08 04:53:21,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:21,210 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:21,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 04:53:21,410 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,SelfDestructingSolverStorable11 [2025-02-08 04:53:21,411 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:21,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash -480969535, now seen corresponding path program 3 times [2025-02-08 04:53:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:21,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716857132] [2025-02-08 04:53:21,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 04:53:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:21,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 209 statements into 16 equivalence classes. [2025-02-08 04:53:21,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 93 of 209 statements. [2025-02-08 04:53:21,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 04:53:21,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 04:53:21,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716857132] [2025-02-08 04:53:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716857132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:21,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:53:21,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783564023] [2025-02-08 04:53:21,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:53:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:21,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:53:21,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:53:21,642 INFO L87 Difference]: Start difference. First operand 660 states and 891 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:22,275 INFO L93 Difference]: Finished difference Result 1273 states and 1730 transitions. [2025-02-08 04:53:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:53:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 209 [2025-02-08 04:53:22,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:22,277 INFO L225 Difference]: With dead ends: 1273 [2025-02-08 04:53:22,277 INFO L226 Difference]: Without dead ends: 672 [2025-02-08 04:53:22,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 04:53:22,281 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 12 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:22,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2020 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:53:22,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-02-08 04:53:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-02-08 04:53:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 647 states have (on average 1.3446676970633693) internal successors, (870), 648 states have internal predecessors, (870), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 891 transitions. [2025-02-08 04:53:22,297 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 891 transitions. Word has length 209 [2025-02-08 04:53:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 891 transitions. [2025-02-08 04:53:22,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 891 transitions. [2025-02-08 04:53:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-08 04:53:22,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:22,300 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 04:53:22,300 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:22,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 123182634, now seen corresponding path program 1 times [2025-02-08 04:53:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201576724] [2025-02-08 04:53:22,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:22,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 04:53:22,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 04:53:22,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:22,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 04:53:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201576724] [2025-02-08 04:53:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201576724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 04:53:22,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479514913] [2025-02-08 04:53:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:22,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 04:53:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:22,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 04:53:22,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:53:22,758 INFO L87 Difference]: Start difference. First operand 660 states and 891 transitions. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:23,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:23,349 INFO L93 Difference]: Finished difference Result 1279 states and 1735 transitions. [2025-02-08 04:53:23,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:53:23,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 210 [2025-02-08 04:53:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:23,352 INFO L225 Difference]: With dead ends: 1279 [2025-02-08 04:53:23,352 INFO L226 Difference]: Without dead ends: 683 [2025-02-08 04:53:23,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 04:53:23,354 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 20 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:23,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2441 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:53:23,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-02-08 04:53:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 674. [2025-02-08 04:53:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 661 states have (on average 1.3434190620272315) internal successors, (888), 662 states have internal predecessors, (888), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 909 transitions. [2025-02-08 04:53:23,369 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 909 transitions. Word has length 210 [2025-02-08 04:53:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:23,369 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 909 transitions. [2025-02-08 04:53:23,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 909 transitions. [2025-02-08 04:53:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-08 04:53:23,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:23,371 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:23,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 04:53:23,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2111521945, now seen corresponding path program 1 times [2025-02-08 04:53:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643972031] [2025-02-08 04:53:23,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 04:53:23,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 04:53:23,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 248 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 04:53:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:24,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643972031] [2025-02-08 04:53:24,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643972031] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488211546] [2025-02-08 04:53:24,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:24,432 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-08 04:53:24,433 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-08 04:53:24,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 04:53:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 04:53:25,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:25,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1376 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 04:53:25,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 04:53:25,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:53:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488211546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:25,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:53:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2025-02-08 04:53:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153872483] [2025-02-08 04:53:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 04:53:25,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:25,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 04:53:25,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-02-08 04:53:25,196 INFO L87 Difference]: Start difference. First operand 674 states and 909 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:25,893 INFO L93 Difference]: Finished difference Result 1304 states and 1766 transitions. [2025-02-08 04:53:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 04:53:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 210 [2025-02-08 04:53:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:25,895 INFO L225 Difference]: With dead ends: 1304 [2025-02-08 04:53:25,895 INFO L226 Difference]: Without dead ends: 701 [2025-02-08 04:53:25,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2025-02-08 04:53:25,897 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 40 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:25,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2428 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:53:25,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-02-08 04:53:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 684. [2025-02-08 04:53:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 671 states have (on average 1.3412816691505216) internal successors, (900), 672 states have internal predecessors, (900), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 921 transitions. [2025-02-08 04:53:25,909 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 921 transitions. Word has length 210 [2025-02-08 04:53:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:25,909 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 921 transitions. [2025-02-08 04:53:25,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 921 transitions. [2025-02-08 04:53:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-08 04:53:25,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:25,911 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:25,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 04:53:26,111 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,SelfDestructingSolverStorable14 [2025-02-08 04:53:26,112 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:26,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1791519575, now seen corresponding path program 1 times [2025-02-08 04:53:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803694613] [2025-02-08 04:53:26,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:26,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-08 04:53:26,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-08 04:53:26,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:26,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-02-08 04:53:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803694613] [2025-02-08 04:53:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803694613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:53:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:53:26,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 04:53:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055690707] [2025-02-08 04:53:26,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:53:26,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 04:53:26,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:53:26,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 04:53:26,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 04:53:26,605 INFO L87 Difference]: Start difference. First operand 684 states and 921 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:27,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:53:27,282 INFO L93 Difference]: Finished difference Result 1315 states and 1782 transitions. [2025-02-08 04:53:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 04:53:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 211 [2025-02-08 04:53:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:53:27,307 INFO L225 Difference]: With dead ends: 1315 [2025-02-08 04:53:27,307 INFO L226 Difference]: Without dead ends: 702 [2025-02-08 04:53:27,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 04:53:27,311 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 26 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 04:53:27,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2420 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 04:53:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-08 04:53:27,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 690. [2025-02-08 04:53:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 677 states have (on average 1.3382570162481535) internal successors, (906), 678 states have internal predecessors, (906), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-08 04:53:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 927 transitions. [2025-02-08 04:53:27,332 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 927 transitions. Word has length 211 [2025-02-08 04:53:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:53:27,332 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 927 transitions. [2025-02-08 04:53:27,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-08 04:53:27,332 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 927 transitions. [2025-02-08 04:53:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-02-08 04:53:27,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:53:27,333 INFO L218 NwaCegarLoop]: trace histogram [24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 04:53:27,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 04:53:27,334 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:53:27,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:53:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash -282543078, now seen corresponding path program 1 times [2025-02-08 04:53:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:53:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395829179] [2025-02-08 04:53:27,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:53:27,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-08 04:53:27,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-08 04:53:27,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:27,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 1 proven. 248 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-02-08 04:53:28,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:53:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395829179] [2025-02-08 04:53:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395829179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:53:28,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052076081] [2025-02-08 04:53:28,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:53:28,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:53:28,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:53:28,453 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-08 04:53:28,454 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-08 04:53:28,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-02-08 04:53:29,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-02-08 04:53:29,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:53:29,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:53:29,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1377 conjuncts, 357 conjuncts are in the unsatisfiable core [2025-02-08 04:53:29,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:53:29,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 04:53:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-02-08 04:53:30,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2025-02-08 04:53:30,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-02-08 04:53:30,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2025-02-08 04:53:30,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 04:53:30,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 04:53:30,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-02-08 04:53:30,189 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 04:53:30,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-02-08 04:53:30,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-02-08 04:53:30,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 04:53:30,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 04:53:30,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 04:53:30,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-02-08 04:53:30,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 04:53:30,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 21