./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.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_BER_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 04:45:20,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 04:45:20,084 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:45:20,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 04:45:20,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 04:45:20,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 04:45:20,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 04:45:20,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 04:45:20,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 04:45:20,135 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 04:45:20,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 04:45:20,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 04:45:20,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 04:45:20,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 04:45:20,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 04:45:20,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:45:20,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 04:45:20,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 04:45:20,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 04:45:20,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 04:45:20,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 04:45:20,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 04:45:20,139 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2025-02-08 04:45:20,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 04:45:20,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 04:45:20,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 04:45:20,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 04:45:20,376 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 04:45:20,377 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_BER_nondet_test4-1.i [2025-02-08 04:45:21,805 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7835afc4/466bf9763a574b6195e3cf82b2209fac/FLAGaf748688b [2025-02-08 04:45:22,182 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 04:45:22,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test4-1.i [2025-02-08 04:45:22,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7835afc4/466bf9763a574b6195e3cf82b2209fac/FLAGaf748688b [2025-02-08 04:45:22,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7835afc4/466bf9763a574b6195e3cf82b2209fac [2025-02-08 04:45:22,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 04:45:22,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 04:45:22,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 04:45:22,346 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 04:45:22,355 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 04:45:22,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:22,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22, skipping insertion in model container [2025-02-08 04:45:22,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:22,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 04:45:22,726 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_BER_nondet_test4-1.i[33519,33532] [2025-02-08 04:45:22,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:45:22,831 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 04:45:22,856 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_BER_nondet_test4-1.i[33519,33532] [2025-02-08 04:45:22,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 04:45:22,949 INFO L204 MainTranslator]: Completed translation [2025-02-08 04:45:22,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22 WrapperNode [2025-02-08 04:45:22,950 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 04:45:22,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 04:45:22,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 04:45:22,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 04:45:22,954 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:45:22" (1/1) ... [2025-02-08 04:45:22,977 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:45:22" (1/1) ... [2025-02-08 04:45:23,033 INFO L138 Inliner]: procedures = 176, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1503 [2025-02-08 04:45:23,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 04:45:23,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 04:45:23,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 04:45:23,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 04:45:23,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,119 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-02-08 04:45:23,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 04:45:23,177 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 04:45:23,177 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 04:45:23,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 04:45:23,178 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (1/1) ... [2025-02-08 04:45:23,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 04:45:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:23,205 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:45:23,209 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:45:23,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 04:45:23,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 04:45:23,228 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 04:45:23,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 04:45:23,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 04:45:23,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 04:45:23,409 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 04:45:23,410 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 04:45:24,732 INFO L? ?]: Removed 376 outVars from TransFormulas that were not future-live. [2025-02-08 04:45:24,732 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 04:45:24,795 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 04:45:24,795 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 04:45:24,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:24 BoogieIcfgContainer [2025-02-08 04:45:24,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 04:45:24,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 04:45:24,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 04:45:24,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 04:45:24,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:45:22" (1/3) ... [2025-02-08 04:45:24,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652a765a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:24, skipping insertion in model container [2025-02-08 04:45:24,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:45:22" (2/3) ... [2025-02-08 04:45:24,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652a765a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:45:24, skipping insertion in model container [2025-02-08 04:45:24,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:45:24" (3/3) ... [2025-02-08 04:45:24,806 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test4-1.i [2025-02-08 04:45:24,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 04:45:24,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test4-1.i that has 3 procedures, 400 locations, 1 initial locations, 36 loop locations, and 1 error locations. [2025-02-08 04:45:24,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 04:45:24,886 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;@65179e71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 04:45:24,886 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 04:45:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 386 states have (on average 1.61139896373057) internal successors, (622), 388 states have internal predecessors, (622), 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:45:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 04:45:24,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:24,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 04:45:24,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:24,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1920960612, now seen corresponding path program 1 times [2025-02-08 04:45:24,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:24,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226161311] [2025-02-08 04:45:24,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:24,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:24,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 04:45:24,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 04:45:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:25,135 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:45:25,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:25,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226161311] [2025-02-08 04:45:25,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226161311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161679211] [2025-02-08 04:45:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:25,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:25,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:25,157 INFO L87 Difference]: Start difference. First operand has 396 states, 386 states have (on average 1.61139896373057) internal successors, (622), 388 states have internal predecessors, (622), 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:45:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:25,621 INFO L93 Difference]: Finished difference Result 1107 states and 1780 transitions. [2025-02-08 04:45:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:25,628 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:45:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:25,636 INFO L225 Difference]: With dead ends: 1107 [2025-02-08 04:45:25,636 INFO L226 Difference]: Without dead ends: 710 [2025-02-08 04:45:25,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:45:25,641 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 464 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:25,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1504 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:45:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-02-08 04:45:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-02-08 04:45:25,705 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:45:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1039 transitions. [2025-02-08 04:45:25,713 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1039 transitions. Word has length 8 [2025-02-08 04:45:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:25,714 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1039 transitions. [2025-02-08 04:45:25,714 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:45:25,714 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1039 transitions. [2025-02-08 04:45:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:45:25,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:25,721 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:45:25,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 04:45:25,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:25,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1769975304, now seen corresponding path program 1 times [2025-02-08 04:45:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427935428] [2025-02-08 04:45:25,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:25,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:45:25,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:45:25,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:25,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:26,326 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:45:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427935428] [2025-02-08 04:45:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427935428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:26,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:26,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339933765] [2025-02-08 04:45:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:26,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:26,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:26,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:26,331 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:45:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:26,477 INFO L93 Difference]: Finished difference Result 1368 states and 1997 transitions. [2025-02-08 04:45:26,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:26,478 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:45:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:26,481 INFO L225 Difference]: With dead ends: 1368 [2025-02-08 04:45:26,481 INFO L226 Difference]: Without dead ends: 716 [2025-02-08 04:45:26,483 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:45:26,484 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 105 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:26,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1410 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-02-08 04:45:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 710. [2025-02-08 04:45:26,508 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:45:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1025 transitions. [2025-02-08 04:45:26,510 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1025 transitions. Word has length 167 [2025-02-08 04:45:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:26,510 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1025 transitions. [2025-02-08 04:45:26,510 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:45:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1025 transitions. [2025-02-08 04:45:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 04:45:26,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:26,513 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:45:26,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 04:45:26,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:26,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1598609887, now seen corresponding path program 1 times [2025-02-08 04:45:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599390699] [2025-02-08 04:45:26,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:26,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 04:45:26,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 04:45:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:26,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:26,741 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:45:26,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599390699] [2025-02-08 04:45:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599390699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:26,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499348173] [2025-02-08 04:45:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:26,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:26,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:26,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:26,743 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:45:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:26,858 INFO L93 Difference]: Finished difference Result 1278 states and 1846 transitions. [2025-02-08 04:45:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:26,859 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:45:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:26,862 INFO L225 Difference]: With dead ends: 1278 [2025-02-08 04:45:26,863 INFO L226 Difference]: Without dead ends: 708 [2025-02-08 04:45:26,864 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:45:26,866 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:45:26,867 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:45:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-02-08 04:45:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2025-02-08 04:45:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 697 states have (on average 1.4404591104734576) internal successors, (1004), 697 states have internal predecessors, (1004), 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:45:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1022 transitions. [2025-02-08 04:45:26,897 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1022 transitions. Word has length 167 [2025-02-08 04:45:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:26,898 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1022 transitions. [2025-02-08 04:45:26,898 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:45:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1022 transitions. [2025-02-08 04:45:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:45:26,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:26,902 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:45:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 04:45:26,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 667316538, now seen corresponding path program 1 times [2025-02-08 04:45:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356938163] [2025-02-08 04:45:26,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:26,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:27,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:27,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:27,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:27,304 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:45:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356938163] [2025-02-08 04:45:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356938163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843431062] [2025-02-08 04:45:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:27,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:27,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:27,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:27,305 INFO L87 Difference]: Start difference. First operand 708 states and 1022 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:45:27,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:27,437 INFO L93 Difference]: Finished difference Result 1178 states and 1698 transitions. [2025-02-08 04:45:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:27,437 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:45:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:27,440 INFO L225 Difference]: With dead ends: 1178 [2025-02-08 04:45:27,440 INFO L226 Difference]: Without dead ends: 714 [2025-02-08 04:45:27,441 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:45:27,441 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 105 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:27,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1389 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:27,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-02-08 04:45:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 708. [2025-02-08 04:45:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 697 states have (on average 1.4203730272596844) internal successors, (990), 697 states have internal predecessors, (990), 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:45:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1008 transitions. [2025-02-08 04:45:27,457 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1008 transitions. Word has length 182 [2025-02-08 04:45:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:27,458 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1008 transitions. [2025-02-08 04:45:27,458 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:45:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1008 transitions. [2025-02-08 04:45:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:45:27,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:27,460 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:45:27,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 04:45:27,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:27,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:27,461 INFO L85 PathProgramCache]: Analyzing trace with hash 2139060243, now seen corresponding path program 1 times [2025-02-08 04:45:27,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:27,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736758030] [2025-02-08 04:45:27,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:27,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:27,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:27,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:27,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:27,726 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:45:27,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:27,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736758030] [2025-02-08 04:45:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736758030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603576408] [2025-02-08 04:45:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:27,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:27,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:27,728 INFO L87 Difference]: Start difference. First operand 708 states and 1008 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:27,833 INFO L93 Difference]: Finished difference Result 1168 states and 1665 transitions. [2025-02-08 04:45:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:27,837 INFO L225 Difference]: With dead ends: 1168 [2025-02-08 04:45:27,837 INFO L226 Difference]: Without dead ends: 720 [2025-02-08 04:45:27,837 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:45:27,838 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 1 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 988 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:45:27,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 988 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-02-08 04:45:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2025-02-08 04:45:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 709 states have (on average 1.4132581100141044) internal successors, (1002), 709 states have internal predecessors, (1002), 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:45:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1020 transitions. [2025-02-08 04:45:27,856 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1020 transitions. Word has length 182 [2025-02-08 04:45:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:27,856 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 1020 transitions. [2025-02-08 04:45:27,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1020 transitions. [2025-02-08 04:45:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:45:27,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:27,858 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:45:27,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 04:45:27,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:27,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1184831348, now seen corresponding path program 1 times [2025-02-08 04:45:27,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067476508] [2025-02-08 04:45:27,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:27,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:28,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:28,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:28,625 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:45:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067476508] [2025-02-08 04:45:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067476508] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875593100] [2025-02-08 04:45:28,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:28,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:28,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:28,629 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:45:28,638 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:45:28,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:29,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:29,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:29,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 04:45:29,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:29,122 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 22 treesize of output 7 [2025-02-08 04:45:29,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 04:45:29,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 55 [2025-02-08 04:45:29,655 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:45:29,655 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:29,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875593100] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:29,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:29,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-08 04:45:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765536198] [2025-02-08 04:45:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 04:45:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:29,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 04:45:29,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-02-08 04:45:29,658 INFO L87 Difference]: Start difference. First operand 720 states and 1020 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:45:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:31,686 INFO L93 Difference]: Finished difference Result 1467 states and 2067 transitions. [2025-02-08 04:45:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 04:45:31,687 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:45:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:31,690 INFO L225 Difference]: With dead ends: 1467 [2025-02-08 04:45:31,690 INFO L226 Difference]: Without dead ends: 831 [2025-02-08 04:45:31,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-02-08 04:45:31,691 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 810 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:31,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 3186 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 04:45:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-02-08 04:45:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749. [2025-02-08 04:45:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 738 states have (on average 1.4065040650406504) internal successors, (1038), 738 states have internal predecessors, (1038), 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:45:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1056 transitions. [2025-02-08 04:45:31,709 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1056 transitions. Word has length 182 [2025-02-08 04:45:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:31,709 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1056 transitions. [2025-02-08 04:45:31,709 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:45:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1056 transitions. [2025-02-08 04:45:31,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:45:31,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:31,711 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:45:31,720 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:45:31,911 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:45:31,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:31,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1357245429, now seen corresponding path program 1 times [2025-02-08 04:45:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533491710] [2025-02-08 04:45:31,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:31,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:31,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:32,100 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:45:32,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:32,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533491710] [2025-02-08 04:45:32,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533491710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:32,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:32,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 04:45:32,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971939256] [2025-02-08 04:45:32,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:32,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 04:45:32,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:32,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 04:45:32,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 04:45:32,102 INFO L87 Difference]: Start difference. First operand 749 states and 1056 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:32,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:32,198 INFO L93 Difference]: Finished difference Result 1420 states and 2008 transitions. [2025-02-08 04:45:32,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 04:45:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:32,201 INFO L225 Difference]: With dead ends: 1420 [2025-02-08 04:45:32,202 INFO L226 Difference]: Without dead ends: 765 [2025-02-08 04:45:32,204 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:45:32,205 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 2 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 988 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:45:32,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 988 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:32,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-02-08 04:45:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 763. [2025-02-08 04:45:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 752 states have (on average 1.3962765957446808) internal successors, (1050), 752 states have internal predecessors, (1050), 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:45:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1068 transitions. [2025-02-08 04:45:32,225 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1068 transitions. Word has length 182 [2025-02-08 04:45:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:32,225 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1068 transitions. [2025-02-08 04:45:32,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 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:45:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1068 transitions. [2025-02-08 04:45:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-08 04:45:32,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:32,228 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:45:32,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 04:45:32,228 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -456547274, now seen corresponding path program 1 times [2025-02-08 04:45:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134481272] [2025-02-08 04:45:32,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:32,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:32,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-08 04:45:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-08 04:45:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:32,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:32,417 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:45:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134481272] [2025-02-08 04:45:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134481272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:32,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:32,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 04:45:32,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466340688] [2025-02-08 04:45:32,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:32,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:32,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:32,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:32,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 04:45:32,419 INFO L87 Difference]: Start difference. First operand 763 states and 1068 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 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:45:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:32,524 INFO L93 Difference]: Finished difference Result 1361 states and 1903 transitions. [2025-02-08 04:45:32,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:32,524 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), 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:45:32,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:32,527 INFO L225 Difference]: With dead ends: 1361 [2025-02-08 04:45:32,527 INFO L226 Difference]: Without dead ends: 624 [2025-02-08 04:45:32,528 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:45:32,528 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 9 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:32,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1256 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:32,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-08 04:45:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-02-08 04:45:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 613 states have (on average 1.3719412724306688) internal successors, (841), 613 states have internal predecessors, (841), 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:45:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 859 transitions. [2025-02-08 04:45:32,544 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 859 transitions. Word has length 182 [2025-02-08 04:45:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 859 transitions. [2025-02-08 04:45:32,545 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), 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:45:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 859 transitions. [2025-02-08 04:45:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-08 04:45:32,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:32,546 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:45:32,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 04:45:32,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:32,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:32,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1574177309, now seen corresponding path program 1 times [2025-02-08 04:45:32,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:32,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854195422] [2025-02-08 04:45:32,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:32,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:45:32,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:45:32,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:32,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:33,166 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:45:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:33,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854195422] [2025-02-08 04:45:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854195422] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407366529] [2025-02-08 04:45:33,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:33,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:33,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:33,169 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:45:33,170 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:45:33,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-08 04:45:33,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-08 04:45:33,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:33,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:33,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 04:45:33,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:33,685 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:45:33,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407366529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:33,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 04:45:33,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124212904] [2025-02-08 04:45:33,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:33,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 04:45:33,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:33,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 04:45:33,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:33,687 INFO L87 Difference]: Start difference. First operand 624 states and 859 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:45:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:33,823 INFO L93 Difference]: Finished difference Result 1212 states and 1680 transitions. [2025-02-08 04:45:33,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 04:45:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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 183 [2025-02-08 04:45:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:33,826 INFO L225 Difference]: With dead ends: 1212 [2025-02-08 04:45:33,827 INFO L226 Difference]: Without dead ends: 624 [2025-02-08 04:45:33,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:33,829 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 13 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:33,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1182 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-08 04:45:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2025-02-08 04:45:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 613 states have (on average 1.3686786296900488) internal successors, (839), 613 states have internal predecessors, (839), 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:45:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 857 transitions. [2025-02-08 04:45:33,844 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 857 transitions. Word has length 183 [2025-02-08 04:45:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:33,845 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 857 transitions. [2025-02-08 04:45:33,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 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:45:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 857 transitions. [2025-02-08 04:45:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-08 04:45:33,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:33,847 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, 1] [2025-02-08 04:45:33,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 04:45:34,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:34,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:34,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 998319281, now seen corresponding path program 1 times [2025-02-08 04:45:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177765627] [2025-02-08 04:45:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:34,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 04:45:34,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 04:45:34,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:34,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:34,779 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:45:34,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:34,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177765627] [2025-02-08 04:45:34,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177765627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:34,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 04:45:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413390487] [2025-02-08 04:45:34,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:34,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 04:45:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:34,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 04:45:34,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:34,781 INFO L87 Difference]: Start difference. First operand 624 states and 857 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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:45:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:35,029 INFO L93 Difference]: Finished difference Result 1215 states and 1682 transitions. [2025-02-08 04:45:35,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 04:45:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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 184 [2025-02-08 04:45:35,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:35,032 INFO L225 Difference]: With dead ends: 1215 [2025-02-08 04:45:35,032 INFO L226 Difference]: Without dead ends: 630 [2025-02-08 04:45:35,033 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:45:35,033 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 4 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:35,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1894 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 04:45:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-02-08 04:45:35,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-02-08 04:45:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 619 states have (on average 1.3651050080775444) internal successors, (845), 619 states have internal predecessors, (845), 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:45:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 863 transitions. [2025-02-08 04:45:35,049 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 863 transitions. Word has length 184 [2025-02-08 04:45:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:35,049 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 863 transitions. [2025-02-08 04:45:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 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:45:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 863 transitions. [2025-02-08 04:45:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 04:45:35,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:35,050 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, 1, 1] [2025-02-08 04:45:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 04:45:35,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:35,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:35,051 INFO L85 PathProgramCache]: Analyzing trace with hash -82882727, now seen corresponding path program 1 times [2025-02-08 04:45:35,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:35,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129108092] [2025-02-08 04:45:35,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:35,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 04:45:35,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 04:45:35,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:35,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:35,486 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:45:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:35,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129108092] [2025-02-08 04:45:35,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129108092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:35,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 04:45:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 04:45:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141850771] [2025-02-08 04:45:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:35,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 04:45:35,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:35,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 04:45:35,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 04:45:35,488 INFO L87 Difference]: Start difference. First operand 630 states and 863 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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:45:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:35,951 INFO L93 Difference]: Finished difference Result 1221 states and 1686 transitions. [2025-02-08 04:45:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 04:45:35,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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 185 [2025-02-08 04:45:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:35,954 INFO L225 Difference]: With dead ends: 1221 [2025-02-08 04:45:35,954 INFO L226 Difference]: Without dead ends: 640 [2025-02-08 04:45:35,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:45:35,957 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 8 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 04:45:35,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2250 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 04:45:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-02-08 04:45:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 638. [2025-02-08 04:45:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 627 states have (on average 1.3636363636363635) internal successors, (855), 627 states have internal predecessors, (855), 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:45:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 873 transitions. [2025-02-08 04:45:35,975 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 873 transitions. Word has length 185 [2025-02-08 04:45:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:35,975 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 873 transitions. [2025-02-08 04:45:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 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:45:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 873 transitions. [2025-02-08 04:45:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-08 04:45:35,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:35,978 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, 1, 1] [2025-02-08 04:45:35,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 04:45:35,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:35,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash 931553802, now seen corresponding path program 1 times [2025-02-08 04:45:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157476440] [2025-02-08 04:45:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 04:45:36,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 04:45:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:36,614 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:45:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157476440] [2025-02-08 04:45:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157476440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95827501] [2025-02-08 04:45:36,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:36,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:36,617 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:45:36,619 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:45:36,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-08 04:45:37,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-08 04:45:37,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:37,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:37,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 04:45:37,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 04:45:37,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 04:45:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95827501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 04:45:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 04:45:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-02-08 04:45:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133126764] [2025-02-08 04:45:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 04:45:37,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 04:45:37,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 04:45:37,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 04:45:37,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 04:45:37,197 INFO L87 Difference]: Start difference. First operand 638 states and 873 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:45:37,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 04:45:37,366 INFO L93 Difference]: Finished difference Result 1247 states and 1722 transitions. [2025-02-08 04:45:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 04:45:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 185 [2025-02-08 04:45:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 04:45:37,370 INFO L225 Difference]: With dead ends: 1247 [2025-02-08 04:45:37,371 INFO L226 Difference]: Without dead ends: 702 [2025-02-08 04:45:37,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 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:45:37,372 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 439 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1718 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:45:37,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1718 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 04:45:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-02-08 04:45:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 641. [2025-02-08 04:45:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 629 states have (on average 1.3640699523052464) internal successors, (858), 630 states have internal predecessors, (858), 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:45:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 879 transitions. [2025-02-08 04:45:37,389 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 879 transitions. Word has length 185 [2025-02-08 04:45:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 04:45:37,390 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 879 transitions. [2025-02-08 04:45:37,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 04:45:37,390 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 879 transitions. [2025-02-08 04:45:37,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-08 04:45:37,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 04:45:37,391 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:45:37,404 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:45:37,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:37,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 04:45:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 04:45:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash 888180618, now seen corresponding path program 1 times [2025-02-08 04:45:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 04:45:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452015916] [2025-02-08 04:45:37,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 04:45:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 04:45:37,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 04:45:37,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:37,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:38,279 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:45:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 04:45:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452015916] [2025-02-08 04:45:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452015916] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 04:45:38,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002515978] [2025-02-08 04:45:38,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 04:45:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 04:45:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 04:45:38,283 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:45:38,284 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:45:38,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-08 04:45:38,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-08 04:45:38,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 04:45:38,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 04:45:38,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 157 conjuncts are in the unsatisfiable core [2025-02-08 04:45:38,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 04:45:38,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-08 04:45:38,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:45:39,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-02-08 04:45:39,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-02-08 04:45:39,365 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 11 treesize of output 7 [2025-02-08 04:45:39,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 04:45:39,388 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-02-08 04:45:39,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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:45:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:45:39,471 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 18 treesize of output 10 [2025-02-08 04:45:39,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:39,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2025-02-08 04:45:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:39,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:45:45,031 INFO L190 IndexEqualityManager]: detected not equals via solver