./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.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 f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:48:54,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:48:55,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:48:55,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:48:55,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:48:55,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:48:55,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:48:55,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:48:55,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:48:55,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:48:55,083 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:48:55,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:48:55,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:48:55,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:48:55,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:48:55,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:48:55,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:48:55,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:48:55,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:48:55,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:48:55,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:48:55,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:48:55,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:48:55,087 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 -> f41a78d87834195eab5eb2e1b786d665ee0f261c86aa89f4e0ae15aff9e9d1ee [2025-02-06 08:48:55,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:48:55,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:48:55,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:48:55,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:48:55,375 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:48:55,376 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_SAX_test4-3.i [2025-02-06 08:48:56,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3976c56f/ba8ebd6731064eb99a62609d2b6fc2f4/FLAGb9994d2c0 [2025-02-06 08:48:57,193 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:48:57,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-3.i [2025-02-06 08:48:57,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3976c56f/ba8ebd6731064eb99a62609d2b6fc2f4/FLAGb9994d2c0 [2025-02-06 08:48:57,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e3976c56f/ba8ebd6731064eb99a62609d2b6fc2f4 [2025-02-06 08:48:57,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:48:57,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:48:57,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:48:57,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:48:57,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:48:57,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:57,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5421906c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57, skipping insertion in model container [2025-02-06 08:48:57,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:57,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:48:57,594 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_SAX_test4-3.i[33021,33034] [2025-02-06 08:48:57,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:48:57,746 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:48:57,798 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_SAX_test4-3.i[33021,33034] [2025-02-06 08:48:57,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:48:57,900 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:48:57,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57 WrapperNode [2025-02-06 08:48:57,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:48:57,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:48:57,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:48:57,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:48:57,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:57,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,033 INFO L138 Inliner]: procedures = 176, calls = 434, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1844 [2025-02-06 08:48:58,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:48:58,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:48:58,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:48:58,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:48:58,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,151 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-02-06 08:48:58,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:48:58,257 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:48:58,258 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:48:58,258 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:48:58,259 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (1/1) ... [2025-02-06 08:48:58,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:48:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:48:58,283 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-06 08:48:58,287 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-06 08:48:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:48:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:48:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:48:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:48:58,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:48:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:48:58,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:48:58,508 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:48:58,510 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:48:59,976 INFO L? ?]: Removed 427 outVars from TransFormulas that were not future-live. [2025-02-06 08:48:59,976 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:49:00,032 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:49:00,032 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 08:49:00,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:00 BoogieIcfgContainer [2025-02-06 08:49:00,033 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:49:00,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:49:00,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:49:00,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:49:00,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:48:57" (1/3) ... [2025-02-06 08:49:00,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e56818e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:00, skipping insertion in model container [2025-02-06 08:49:00,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:48:57" (2/3) ... [2025-02-06 08:49:00,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e56818e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:00, skipping insertion in model container [2025-02-06 08:49:00,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:00" (3/3) ... [2025-02-06 08:49:00,043 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-3.i [2025-02-06 08:49:00,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:49:00,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test4-3.i that has 4 procedures, 482 locations, 1 initial locations, 45 loop locations, and 1 error locations. [2025-02-06 08:49:00,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:49:00,128 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;@375d34e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:49:00,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 08:49:00,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 458 states have (on average 1.6179039301310043) internal successors, (741), 469 states have internal predecessors, (741), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:49:00,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:00,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:00,141 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:00,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -157634859, now seen corresponding path program 1 times [2025-02-06 08:49:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368962318] [2025-02-06 08:49:00,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:49:00,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:49:00,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:00,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:00,342 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-06 08:49:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368962318] [2025-02-06 08:49:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368962318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:49:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691660795] [2025-02-06 08:49:00,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:00,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:49:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:00,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:49:00,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:49:00,369 INFO L87 Difference]: Start difference. First operand has 478 states, 458 states have (on average 1.6179039301310043) internal successors, (741), 469 states have internal predecessors, (741), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:00,564 INFO L93 Difference]: Finished difference Result 1334 states and 2170 transitions. [2025-02-06 08:49:00,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:49:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 08:49:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:00,588 INFO L225 Difference]: With dead ends: 1334 [2025-02-06 08:49:00,589 INFO L226 Difference]: Without dead ends: 795 [2025-02-06 08:49:00,596 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-06 08:49:00,599 INFO L435 NwaCegarLoop]: 646 mSDtfsCounter, 541 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:00,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1289 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-02-06 08:49:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 416. [2025-02-06 08:49:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 397 states have (on average 1.455919395465995) internal successors, (578), 407 states have internal predecessors, (578), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 610 transitions. [2025-02-06 08:49:00,665 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 610 transitions. Word has length 9 [2025-02-06 08:49:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:00,666 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 610 transitions. [2025-02-06 08:49:00,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 610 transitions. [2025-02-06 08:49:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:49:00,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:00,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 08:49:00,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:49:00,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1199444187, now seen corresponding path program 1 times [2025-02-06 08:49:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715746162] [2025-02-06 08:49:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:00,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:49:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:49:00,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:00,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715746162] [2025-02-06 08:49:01,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715746162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:01,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:01,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:01,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213623666] [2025-02-06 08:49:01,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:01,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:01,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:01,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:01,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:01,345 INFO L87 Difference]: Start difference. First operand 416 states and 610 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:01,487 INFO L93 Difference]: Finished difference Result 832 states and 1220 transitions. [2025-02-06 08:49:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-02-06 08:49:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:01,489 INFO L225 Difference]: With dead ends: 832 [2025-02-06 08:49:01,489 INFO L226 Difference]: Without dead ends: 419 [2025-02-06 08:49:01,490 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-06 08:49:01,491 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1530 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-06 08:49:01,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1530 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-06 08:49:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2025-02-06 08:49:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 397 states have (on average 1.438287153652393) internal successors, (571), 407 states have internal predecessors, (571), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:01,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 603 transitions. [2025-02-06 08:49:01,507 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 603 transitions. Word has length 153 [2025-02-06 08:49:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 603 transitions. [2025-02-06 08:49:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 603 transitions. [2025-02-06 08:49:01,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:49:01,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:01,511 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 08:49:01,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:49:01,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:01,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1467505183, now seen corresponding path program 1 times [2025-02-06 08:49:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061713237] [2025-02-06 08:49:01,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:49:01,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:49:01,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:01,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:01,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061713237] [2025-02-06 08:49:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061713237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:01,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:01,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:49:01,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201523667] [2025-02-06 08:49:01,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:01,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:49:01,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:01,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:49:01,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:49:01,858 INFO L87 Difference]: Start difference. First operand 416 states and 603 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:02,003 INFO L93 Difference]: Finished difference Result 957 states and 1391 transitions. [2025-02-06 08:49:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:49:02,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2025-02-06 08:49:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:02,007 INFO L225 Difference]: With dead ends: 957 [2025-02-06 08:49:02,007 INFO L226 Difference]: Without dead ends: 544 [2025-02-06 08:49:02,008 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-06 08:49:02,008 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 134 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1107 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-06 08:49:02,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1107 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-06 08:49:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-02-06 08:49:02,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 525 states have (on average 1.4438095238095239) internal successors, (758), 535 states have internal predecessors, (758), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 790 transitions. [2025-02-06 08:49:02,057 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 790 transitions. Word has length 153 [2025-02-06 08:49:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 790 transitions. [2025-02-06 08:49:02,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 790 transitions. [2025-02-06 08:49:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:49:02,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:02,064 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, 1] [2025-02-06 08:49:02,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:49:02,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:02,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:02,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1666662019, now seen corresponding path program 1 times [2025-02-06 08:49:02,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:02,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893932179] [2025-02-06 08:49:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:02,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:02,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:49:02,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:49:02,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:02,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:02,427 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-06 08:49:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893932179] [2025-02-06 08:49:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893932179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729724196] [2025-02-06 08:49:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:02,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:02,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:02,429 INFO L87 Difference]: Start difference. First operand 544 states and 790 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:49:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:02,571 INFO L93 Difference]: Finished difference Result 915 states and 1324 transitions. [2025-02-06 08:49:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:49:02,572 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-06 08:49:02,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:02,574 INFO L225 Difference]: With dead ends: 915 [2025-02-06 08:49:02,574 INFO L226 Difference]: Without dead ends: 502 [2025-02-06 08:49:02,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 08:49:02,579 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 30 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:02,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1379 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-02-06 08:49:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-02-06 08:49:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 483 states have (on average 1.4099378881987579) internal successors, (681), 493 states have internal predecessors, (681), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-06 08:49:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 713 transitions. [2025-02-06 08:49:02,603 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 713 transitions. Word has length 168 [2025-02-06 08:49:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:02,604 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 713 transitions. [2025-02-06 08:49:02,605 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:49:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 713 transitions. [2025-02-06 08:49:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 08:49:02,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:02,606 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, 1] [2025-02-06 08:49:02,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:49:02,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:02,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1386309495, now seen corresponding path program 1 times [2025-02-06 08:49:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825963172] [2025-02-06 08:49:02,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-06 08:49:02,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 08:49:02,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:02,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:02,932 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-06 08:49:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825963172] [2025-02-06 08:49:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825963172] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:02,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:49:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704093465] [2025-02-06 08:49:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:02,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:49:02,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:02,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:49:02,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:49:02,935 INFO L87 Difference]: Start difference. First operand 502 states and 713 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:49:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:03,113 INFO L93 Difference]: Finished difference Result 1017 states and 1432 transitions. [2025-02-06 08:49:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:49:03,114 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 168 [2025-02-06 08:49:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:03,121 INFO L225 Difference]: With dead ends: 1017 [2025-02-06 08:49:03,124 INFO L226 Difference]: Without dead ends: 646 [2025-02-06 08:49:03,125 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-06 08:49:03,128 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 242 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:03,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 958 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:49:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-06 08:49:03,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2025-02-06 08:49:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 624 states have (on average 1.3942307692307692) internal successors, (870), 634 states have internal predecessors, (870), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-06 08:49:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 908 transitions. [2025-02-06 08:49:03,177 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 908 transitions. Word has length 168 [2025-02-06 08:49:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:03,178 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 908 transitions. [2025-02-06 08:49:03,178 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:49:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 908 transitions. [2025-02-06 08:49:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-06 08:49:03,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:03,179 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-06 08:49:03,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:49:03,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:03,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 2107470941, now seen corresponding path program 1 times [2025-02-06 08:49:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365826222] [2025-02-06 08:49:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:03,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 08:49:03,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 08:49:03,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:03,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:03,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365826222] [2025-02-06 08:49:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365826222] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:49:03,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201278085] [2025-02-06 08:49:03,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:49:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:49:03,589 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-06 08:49:03,590 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-06 08:49:03,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 08:49:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 08:49:04,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:04,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:04,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 08:49:04,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:49:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:04,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:49:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201278085] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:49:04,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:49:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 08:49:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763491778] [2025-02-06 08:49:04,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:49:04,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:04,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:04,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:04,402 INFO L87 Difference]: Start difference. First operand 646 states and 908 transitions. Second operand has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:04,651 INFO L93 Difference]: Finished difference Result 1413 states and 1981 transitions. [2025-02-06 08:49:04,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:49:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-02-06 08:49:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:04,657 INFO L225 Difference]: With dead ends: 1413 [2025-02-06 08:49:04,657 INFO L226 Difference]: Without dead ends: 1384 [2025-02-06 08:49:04,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:04,659 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2292 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 2294 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:04,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2308 Valid, 2294 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:49:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-02-06 08:49:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2025-02-06 08:49:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1347 states have (on average 1.382331106161841) internal successors, (1862), 1357 states have internal predecessors, (1862), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 08:49:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1930 transitions. [2025-02-06 08:49:04,693 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1930 transitions. Word has length 183 [2025-02-06 08:49:04,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:04,694 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1930 transitions. [2025-02-06 08:49:04,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.0) internal successors, (476), 7 states have internal predecessors, (476), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1930 transitions. [2025-02-06 08:49:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-02-06 08:49:04,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:04,702 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 08:49:04,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 08:49:04,903 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-06 08:49:04,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:04,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:04,904 INFO L85 PathProgramCache]: Analyzing trace with hash 12116009, now seen corresponding path program 1 times [2025-02-06 08:49:04,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:04,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-02-06 08:49:04,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:04,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:05,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-02-06 08:49:05,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-02-06 08:49:05,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:05,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:06,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604044767] [2025-02-06 08:49:06,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604044767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:49:06,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516278213] [2025-02-06 08:49:06,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:06,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:49:06,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:49:06,324 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-06 08:49:06,325 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-06 08:49:06,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-02-06 08:49:07,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-02-06 08:49:07,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:07,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:07,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 3112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:49:07,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:49:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:08,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:49:08,688 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 856 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 08:49:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516278213] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:49:08,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:49:08,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 08:49:08,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721376633] [2025-02-06 08:49:08,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:49:08,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 08:49:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:08,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 08:49:08,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:49:08,697 INFO L87 Difference]: Start difference. First operand 1384 states and 1930 transitions. Second operand has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:09,616 INFO L93 Difference]: Finished difference Result 3441 states and 4804 transitions. [2025-02-06 08:49:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 08:49:09,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 615 [2025-02-06 08:49:09,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:09,629 INFO L225 Difference]: With dead ends: 3441 [2025-02-06 08:49:09,629 INFO L226 Difference]: Without dead ends: 3412 [2025-02-06 08:49:09,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1224 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 08:49:09,631 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 6368 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6420 SdHoareTripleChecker+Valid, 4737 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:09,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6420 Valid, 4737 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3412 states. [2025-02-06 08:49:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3412. [2025-02-06 08:49:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3412 states, 3339 states have (on average 1.3806528900868524) internal successors, (4610), 3349 states have internal predecessors, (4610), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 61 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 08:49:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3412 states to 3412 states and 4750 transitions. [2025-02-06 08:49:09,700 INFO L78 Accepts]: Start accepts. Automaton has 3412 states and 4750 transitions. Word has length 615 [2025-02-06 08:49:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:09,702 INFO L471 AbstractCegarLoop]: Abstraction has 3412 states and 4750 transitions. [2025-02-06 08:49:09,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.07692307692308) internal successors, (1340), 13 states have internal predecessors, (1340), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 08:49:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3412 states and 4750 transitions. [2025-02-06 08:49:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1480 [2025-02-06 08:49:09,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:09,777 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 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] [2025-02-06 08:49:09,790 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-06 08:49:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:49:09,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:49:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash 274669505, now seen corresponding path program 2 times [2025-02-06 08:49:09,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:09,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28048417] [2025-02-06 08:49:09,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:49:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:10,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1479 statements into 2 equivalence classes.