./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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_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 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-08 04:46:46,946 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-08 04:46:47,010 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:46:47,018 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-08 04:46:47,018 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-08 04:46:47,049 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-08 04:46:47,049 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-08 04:46:47,050 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-08 04:46:47,050 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-08 04:46:47,050 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-08 04:46:47,050 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-08 04:46:47,050 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-08 04:46:47,051 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 04:46:47,051 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-08 04:46:47,051 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-08 04:46:47,052 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-08 04:46:47,052 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 -> 08dbe1d8baf218c90d79c7aa96b8d857526ff0e474f0acb076b8cd9ca4d11ff2
[2025-02-08 04:46:47,266 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-08 04:46:47,272 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-08 04:46:47,274 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-08 04:46:47,275 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-08 04:46:47,275 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-08 04:46:47,276 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_test4-1.i
[2025-02-08 04:46:48,531 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35519c62f/9b5aa953079446c2b902f40a9c31732f/FLAGf23c4014e
[2025-02-08 04:46:48,930 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-08 04:46:48,931 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-1.i
[2025-02-08 04:46:48,949 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35519c62f/9b5aa953079446c2b902f40a9c31732f/FLAGf23c4014e
[2025-02-08 04:46:49,117 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35519c62f/9b5aa953079446c2b902f40a9c31732f
[2025-02-08 04:46:49,119 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-08 04:46:49,121 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-08 04:46:49,122 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-08 04:46:49,122 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-08 04:46:49,126 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-08 04:46:49,126 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,127 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d107968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49, skipping insertion in model container
[2025-02-08 04:46:49,128 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,166 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-08 04:46:49,469 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_test4-1.i[33021,33034]
[2025-02-08 04:46:49,610 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 04:46:49,622 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-08 04:46:49,660 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_test4-1.i[33021,33034]
[2025-02-08 04:46:49,737 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-08 04:46:49,770 INFO  L204         MainTranslator]: Completed translation
[2025-02-08 04:46:49,771 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49 WrapperNode
[2025-02-08 04:46:49,771 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-08 04:46:49,772 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-08 04:46:49,772 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-08 04:46:49,773 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-08 04:46:49,777 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:46:49" (1/1) ...
[2025-02-08 04:46:49,807 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:46:49" (1/1) ...
[2025-02-08 04:46:49,873 INFO  L138                Inliner]: procedures = 176, calls = 335, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1540
[2025-02-08 04:46:49,877 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-08 04:46:49,878 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-08 04:46:49,878 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-08 04:46:49,878 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-08 04:46:49,886 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,886 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,905 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,971 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:46:49,971 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,971 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,996 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:49,999 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:50,008 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:50,012 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:50,022 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-08 04:46:50,023 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-08 04:46:50,023 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-08 04:46:50,024 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-08 04:46:50,026 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (1/1) ...
[2025-02-08 04:46:50,030 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-08 04:46:50,040 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 04:46:50,053 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:46:50,056 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:46:50,075 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-02-08 04:46:50,075 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-02-08 04:46:50,075 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2025-02-08 04:46:50,076 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2025-02-08 04:46:50,076 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-02-08 04:46:50,076 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-02-08 04:46:50,076 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0
[2025-02-08 04:46:50,076 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1
[2025-02-08 04:46:50,076 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0
[2025-02-08 04:46:50,076 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1
[2025-02-08 04:46:50,076 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-02-08 04:46:50,077 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-08 04:46:50,077 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-08 04:46:50,246 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-08 04:46:50,248 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-08 04:46:51,536 INFO  L?                        ?]: Removed 384 outVars from TransFormulas that were not future-live.
[2025-02-08 04:46:51,536 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-08 04:46:51,586 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-08 04:46:51,586 INFO  L337             CfgBuilder]: Removed 2 assume(true) statements.
[2025-02-08 04:46:51,587 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:51 BoogieIcfgContainer
[2025-02-08 04:46:51,587 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-08 04:46:51,588 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-08 04:46:51,588 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-08 04:46:51,592 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-08 04:46:51,592 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 04:46:49" (1/3) ...
[2025-02-08 04:46:51,592 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22c558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:51, skipping insertion in model container
[2025-02-08 04:46:51,592 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 04:46:49" (2/3) ...
[2025-02-08 04:46:51,593 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b22c558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 04:46:51, skipping insertion in model container
[2025-02-08 04:46:51,593 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 04:46:51" (3/3) ...
[2025-02-08 04:46:51,594 INFO  L128   eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-1.i
[2025-02-08 04:46:51,608 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-08 04:46:51,609 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test4-1.i that has 4 procedures, 419 locations, 1 initial locations, 36 loop locations, and 1 error locations.
[2025-02-08 04:46:51,651 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-08 04:46:51,659 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;@52c208ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-08 04:46:51,660 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-08 04:46:51,664 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 415 states, 394 states have (on average 1.619289340101523) internal successors, (638), 405 states have internal predecessors, (638), 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-08 04:46:51,668 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2025-02-08 04:46:51,668 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:51,669 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-08 04:46:51,669 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:51,672 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:51,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -296579657, now seen corresponding path program 1 times
[2025-02-08 04:46:51,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:51,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385475089]
[2025-02-08 04:46:51,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:51,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:51,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes.
[2025-02-08 04:46:51,744 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements.
[2025-02-08 04:46:51,744 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:51,745 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:51,804 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:46:51,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:51,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385475089]
[2025-02-08 04:46:51,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385475089] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:51,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:51,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 04:46:51,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052842708]
[2025-02-08 04:46:51,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:51,810 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 04:46:51,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:51,823 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 04:46:51,823 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 04:46:51,825 INFO  L87              Difference]: Start difference. First operand  has 415 states, 394 states have (on average 1.619289340101523) internal successors, (638), 405 states have internal predecessors, (638), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 04:46:52,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:52,057 INFO  L93              Difference]: Finished difference Result 1209 states and 1965 transitions.
[2025-02-08 04:46:52,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 04:46:52,060 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 8
[2025-02-08 04:46:52,060 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:52,069 INFO  L225             Difference]: With dead ends: 1209
[2025-02-08 04:46:52,070 INFO  L226             Difference]: Without dead ends: 790
[2025-02-08 04:46:52,073 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:46:52,075 INFO  L435           NwaCegarLoop]: 608 mSDtfsCounter, 541 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:52,075 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1167 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:52,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 790 states.
[2025-02-08 04:46:52,123 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 411.
[2025-02-08 04:46:52,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 411 states, 393 states have (on average 1.4580152671755726) internal successors, (573), 402 states have internal predecessors, (573), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-08 04:46:52,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 595 transitions.
[2025-02-08 04:46:52,130 INFO  L78                 Accepts]: Start accepts. Automaton has 411 states and 595 transitions. Word has length 8
[2025-02-08 04:46:52,130 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:52,130 INFO  L471      AbstractCegarLoop]: Abstraction has 411 states and 595 transitions.
[2025-02-08 04:46:52,130 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 04:46:52,130 INFO  L276                IsEmpty]: Start isEmpty. Operand 411 states and 595 transitions.
[2025-02-08 04:46:52,135 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-02-08 04:46:52,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:52,135 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]
[2025-02-08 04:46:52,135 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-08 04:46:52,135 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:52,136 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:52,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 278561608, now seen corresponding path program 1 times
[2025-02-08 04:46:52,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:52,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198107216]
[2025-02-08 04:46:52,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:52,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:52,199 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-02-08 04:46:52,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-02-08 04:46:52,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:52,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:52,710 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-08 04:46:52,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:52,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198107216]
[2025-02-08 04:46:52,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198107216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:52,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:52,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 04:46:52,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482775497]
[2025-02-08 04:46:52,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:52,711 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 04:46:52,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:52,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 04:46:52,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 04:46:52,713 INFO  L87              Difference]: Start difference. First operand 411 states and 595 transitions. Second operand  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-08 04:46:52,880 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:52,880 INFO  L93              Difference]: Finished difference Result 823 states and 1191 transitions.
[2025-02-08 04:46:52,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-08 04:46:52,881 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 152
[2025-02-08 04:46:52,881 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:52,883 INFO  L225             Difference]: With dead ends: 823
[2025-02-08 04:46:52,884 INFO  L226             Difference]: Without dead ends: 414
[2025-02-08 04:46:52,885 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:46:52,885 INFO  L435           NwaCegarLoop]: 523 mSDtfsCounter, 106 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:52,886 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1485 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:52,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 414 states.
[2025-02-08 04:46:52,912 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411.
[2025-02-08 04:46:52,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 411 states, 393 states have (on average 1.440203562340967) internal successors, (566), 402 states have internal predecessors, (566), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-08 04:46:52,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions.
[2025-02-08 04:46:52,917 INFO  L78                 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 152
[2025-02-08 04:46:52,917 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:52,917 INFO  L471      AbstractCegarLoop]: Abstraction has 411 states and 588 transitions.
[2025-02-08 04:46:52,918 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-08 04:46:52,918 INFO  L276                IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions.
[2025-02-08 04:46:52,925 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-02-08 04:46:52,925 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:52,925 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]
[2025-02-08 04:46:52,926 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-08 04:46:52,927 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:52,927 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:52,927 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006971681, now seen corresponding path program 1 times
[2025-02-08 04:46:52,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:52,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654380261]
[2025-02-08 04:46:52,928 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:52,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:53,020 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-02-08 04:46:53,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-02-08 04:46:53,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:53,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:53,215 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-08 04:46:53,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:53,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654380261]
[2025-02-08 04:46:53,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654380261] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:53,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:53,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 04:46:53,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257155858]
[2025-02-08 04:46:53,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:53,216 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 04:46:53,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:53,217 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 04:46:53,217 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 04:46:53,217 INFO  L87              Difference]: Start difference. First operand 411 states and 588 transitions. Second operand  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-08 04:46:53,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:53,355 INFO  L93              Difference]: Finished difference Result 772 states and 1099 transitions.
[2025-02-08 04:46:53,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 04:46:53,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 152
[2025-02-08 04:46:53,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:53,358 INFO  L225             Difference]: With dead ends: 772
[2025-02-08 04:46:53,359 INFO  L226             Difference]: Without dead ends: 363
[2025-02-08 04:46:53,360 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:46:53,360 INFO  L435           NwaCegarLoop]: 457 mSDtfsCounter, 9 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:53,361 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1352 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:53,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 363 states.
[2025-02-08 04:46:53,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363.
[2025-02-08 04:46:53,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 363 states, 345 states have (on average 1.4086956521739131) internal successors, (486), 354 states have internal predecessors, (486), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-08 04:46:53,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 508 transitions.
[2025-02-08 04:46:53,377 INFO  L78                 Accepts]: Start accepts. Automaton has 363 states and 508 transitions. Word has length 152
[2025-02-08 04:46:53,379 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:53,379 INFO  L471      AbstractCegarLoop]: Abstraction has 363 states and 508 transitions.
[2025-02-08 04:46:53,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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-08 04:46:53,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 363 states and 508 transitions.
[2025-02-08 04:46:53,383 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2025-02-08 04:46:53,383 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:53,383 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]
[2025-02-08 04:46:53,383 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-08 04:46:53,383 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:53,385 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:53,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478092030, now seen corresponding path program 1 times
[2025-02-08 04:46:53,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:53,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259311687]
[2025-02-08 04:46:53,385 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:53,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:53,498 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes.
[2025-02-08 04:46:53,519 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements.
[2025-02-08 04:46:53,520 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:53,520 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:53,676 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-08 04:46:53,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:53,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259311687]
[2025-02-08 04:46:53,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259311687] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:53,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:53,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-08 04:46:53,677 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176420889]
[2025-02-08 04:46:53,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:53,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 04:46:53,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:53,679 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 04:46:53,679 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 04:46:53,679 INFO  L87              Difference]: Start difference. First operand 363 states and 508 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-08 04:46:53,788 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:53,788 INFO  L93              Difference]: Finished difference Result 804 states and 1122 transitions.
[2025-02-08 04:46:53,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 04:46:53,789 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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 152
[2025-02-08 04:46:53,789 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:53,791 INFO  L225             Difference]: With dead ends: 804
[2025-02-08 04:46:53,791 INFO  L226             Difference]: Without dead ends: 443
[2025-02-08 04:46:53,793 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:46:53,793 INFO  L435           NwaCegarLoop]: 471 mSDtfsCounter, 54 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:53,795 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 935 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:53,796 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 443 states.
[2025-02-08 04:46:53,804 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443.
[2025-02-08 04:46:53,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 443 states, 425 states have (on average 1.3952941176470588) internal successors, (593), 434 states have internal predecessors, (593), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-08 04:46:53,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 615 transitions.
[2025-02-08 04:46:53,808 INFO  L78                 Accepts]: Start accepts. Automaton has 443 states and 615 transitions. Word has length 152
[2025-02-08 04:46:53,809 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:53,809 INFO  L471      AbstractCegarLoop]: Abstraction has 443 states and 615 transitions.
[2025-02-08 04:46:53,809 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 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-08 04:46:53,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 443 states and 615 transitions.
[2025-02-08 04:46:53,810 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-02-08 04:46:53,810 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:53,810 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:46:53,811 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-08 04:46:53,811 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:53,812 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:53,812 INFO  L85        PathProgramCache]: Analyzing trace with hash 390371253, now seen corresponding path program 1 times
[2025-02-08 04:46:53,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:53,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980381627]
[2025-02-08 04:46:53,812 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:53,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:53,865 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-02-08 04:46:53,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-02-08 04:46:53,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:53,894 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:54,132 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:46:54,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:54,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980381627]
[2025-02-08 04:46:54,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980381627] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:54,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:54,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-08 04:46:54,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971392813]
[2025-02-08 04:46:54,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:54,134 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-08 04:46:54,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:54,135 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-08 04:46:54,135 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-08 04:46:54,136 INFO  L87              Difference]: Start difference. First operand 443 states and 615 transitions. Second operand  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-08 04:46:54,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:54,289 INFO  L93              Difference]: Finished difference Result 762 states and 1055 transitions.
[2025-02-08 04:46:54,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-08 04:46:54,290 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 167
[2025-02-08 04:46:54,290 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:54,292 INFO  L225             Difference]: With dead ends: 762
[2025-02-08 04:46:54,293 INFO  L226             Difference]: Without dead ends: 401
[2025-02-08 04:46:54,294 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-08 04:46:54,295 INFO  L435           NwaCegarLoop]: 380 mSDtfsCounter, 30 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:54,295 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1121 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:54,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 401 states.
[2025-02-08 04:46:54,306 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401.
[2025-02-08 04:46:54,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 401 states, 383 states have (on average 1.3472584856396868) internal successors, (516), 392 states have internal predecessors, (516), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-02-08 04:46:54,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 538 transitions.
[2025-02-08 04:46:54,309 INFO  L78                 Accepts]: Start accepts. Automaton has 401 states and 538 transitions. Word has length 167
[2025-02-08 04:46:54,309 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:54,311 INFO  L471      AbstractCegarLoop]: Abstraction has 401 states and 538 transitions.
[2025-02-08 04:46:54,312 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-08 04:46:54,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 401 states and 538 transitions.
[2025-02-08 04:46:54,314 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 168
[2025-02-08 04:46:54,314 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:54,314 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:46:54,315 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-08 04:46:54,315 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:54,315 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:54,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -2017682833, now seen corresponding path program 1 times
[2025-02-08 04:46:54,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:54,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994295234]
[2025-02-08 04:46:54,318 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:54,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:54,373 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes.
[2025-02-08 04:46:54,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements.
[2025-02-08 04:46:54,405 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:54,405 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:54,526 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:46:54,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:54,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994295234]
[2025-02-08 04:46:54,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994295234] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-08 04:46:54,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-08 04:46:54,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-08 04:46:54,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562548298]
[2025-02-08 04:46:54,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-08 04:46:54,527 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-08 04:46:54,527 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:54,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-08 04:46:54,528 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-08 04:46:54,528 INFO  L87              Difference]: Start difference. First operand 401 states and 538 transitions. Second operand  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 04:46:54,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:54,620 INFO  L93              Difference]: Finished difference Result 864 states and 1163 transitions.
[2025-02-08 04:46:54,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-08 04:46:54,620 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 167
[2025-02-08 04:46:54,621 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:54,623 INFO  L225             Difference]: With dead ends: 864
[2025-02-08 04:46:54,623 INFO  L226             Difference]: Without dead ends: 545
[2025-02-08 04:46:54,624 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:46:54,624 INFO  L435           NwaCegarLoop]: 397 mSDtfsCounter, 162 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:54,627 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 786 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-08 04:46:54,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 545 states.
[2025-02-08 04:46:54,643 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545.
[2025-02-08 04:46:54,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 545 states, 524 states have (on average 1.3454198473282444) internal successors, (705), 533 states have internal predecessors, (705), 19 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9)
[2025-02-08 04:46:54,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 733 transitions.
[2025-02-08 04:46:54,650 INFO  L78                 Accepts]: Start accepts. Automaton has 545 states and 733 transitions. Word has length 167
[2025-02-08 04:46:54,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:54,650 INFO  L471      AbstractCegarLoop]: Abstraction has 545 states and 733 transitions.
[2025-02-08 04:46:54,650 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 04:46:54,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 545 states and 733 transitions.
[2025-02-08 04:46:54,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2025-02-08 04:46:54,652 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:54,652 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:46:54,652 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-08 04:46:54,652 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:54,652 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:54,653 INFO  L85        PathProgramCache]: Analyzing trace with hash -1521601184, now seen corresponding path program 1 times
[2025-02-08 04:46:54,653 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:54,653 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432584352]
[2025-02-08 04:46:54,653 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:54,653 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:54,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-02-08 04:46:54,743 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-02-08 04:46:54,743 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:54,743 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:54,936 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-08 04:46:54,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:54,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432584352]
[2025-02-08 04:46:54,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432584352] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 04:46:54,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868317403]
[2025-02-08 04:46:54,937 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:54,937 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 04:46:54,937 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 04:46:54,939 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:46:54,941 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:46:55,177 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes.
[2025-02-08 04:46:55,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements.
[2025-02-08 04:46:55,296 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:55,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:55,302 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-08 04:46:55,313 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 04:46:55,506 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-08 04:46:55,507 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 04:46:55,711 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-08 04:46:55,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [868317403] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 04:46:55,712 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 04:46:55,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2025-02-08 04:46:55,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854753962]
[2025-02-08 04:46:55,712 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 04:46:55,712 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-02-08 04:46:55,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:55,713 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-02-08 04:46:55,713 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2025-02-08 04:46:55,714 INFO  L87              Difference]: Start difference. First operand 545 states and 733 transitions. Second operand  has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 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-08 04:46:55,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:55,932 INFO  L93              Difference]: Finished difference Result 1212 states and 1632 transitions.
[2025-02-08 04:46:55,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-08 04:46:55,932 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 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 182
[2025-02-08 04:46:55,933 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:46:55,937 INFO  L225             Difference]: With dead ends: 1212
[2025-02-08 04:46:55,937 INFO  L226             Difference]: Without dead ends: 1187
[2025-02-08 04:46:55,938 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 361 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-08 04:46:55,939 INFO  L435           NwaCegarLoop]: 395 mSDtfsCounter, 1732 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-08 04:46:55,939 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 1595 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-08 04:46:55,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1187 states.
[2025-02-08 04:46:55,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187.
[2025-02-08 04:46:55,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1187 states, 1151 states have (on average 1.3353605560382276) internal successors, (1537), 1160 states have internal predecessors, (1537), 34 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-02-08 04:46:55,969 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1595 transitions.
[2025-02-08 04:46:55,970 INFO  L78                 Accepts]: Start accepts. Automaton has 1187 states and 1595 transitions. Word has length 182
[2025-02-08 04:46:55,970 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:46:55,970 INFO  L471      AbstractCegarLoop]: Abstraction has 1187 states and 1595 transitions.
[2025-02-08 04:46:55,970 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 67.85714285714286) internal successors, (475), 7 states have internal predecessors, (475), 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-08 04:46:55,971 INFO  L276                IsEmpty]: Start isEmpty. Operand 1187 states and 1595 transitions.
[2025-02-08 04:46:56,004 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 615
[2025-02-08 04:46:56,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:46:56,005 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]
[2025-02-08 04:46:56,014 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-08 04:46:56,209 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 04:46:56,209 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:46:56,210 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:46:56,210 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361768815, now seen corresponding path program 1 times
[2025-02-08 04:46:56,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:46:56,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137316192]
[2025-02-08 04:46:56,210 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:56,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:46:56,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes.
[2025-02-08 04:46:56,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements.
[2025-02-08 04:46:56,685 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:56,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:57,484 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-08 04:46:57,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-08 04:46:57,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137316192]
[2025-02-08 04:46:57,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137316192] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-08 04:46:57,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292801708]
[2025-02-08 04:46:57,485 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-08 04:46:57,485 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 04:46:57,485 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-08 04:46:57,487 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:46:57,489 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:46:57,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes.
[2025-02-08 04:46:58,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements.
[2025-02-08 04:46:58,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-08 04:46:58,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-08 04:46:58,297 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3076 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-08 04:46:58,316 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-08 04:46:58,863 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-08 04:46:58,864 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-08 04:46:59,443 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-08 04:46:59,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292801708] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-08 04:46:59,443 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-08 04:46:59,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2025-02-08 04:46:59,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838720132]
[2025-02-08 04:46:59,444 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-08 04:46:59,445 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-08 04:46:59,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-08 04:46:59,447 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-08 04:46:59,447 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2025-02-08 04:46:59,448 INFO  L87              Difference]: Start difference. First operand 1187 states and 1595 transitions. Second operand  has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 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-08 04:46:59,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-08 04:46:59,992 INFO  L93              Difference]: Finished difference Result 2952 states and 3975 transitions.
[2025-02-08 04:46:59,993 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-02-08 04:46:59,993 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 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 614
[2025-02-08 04:46:59,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-08 04:47:00,004 INFO  L225             Difference]: With dead ends: 2952
[2025-02-08 04:47:00,004 INFO  L226             Difference]: Without dead ends: 2927
[2025-02-08 04:47:00,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1222 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-08 04:47:00,006 INFO  L435           NwaCegarLoop]: 512 mSDtfsCounter, 4820 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4872 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-08 04:47:00,006 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4872 Valid, 3951 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-08 04:47:00,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2927 states.
[2025-02-08 04:47:00,056 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2927 to 2927.
[2025-02-08 04:47:00,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2927 states, 2855 states have (on average 1.3327495621716288) internal successors, (3805), 2864 states have internal predecessors, (3805), 70 states have call successors, (70), 2 states have call predecessors, (70), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60)
[2025-02-08 04:47:00,070 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3935 transitions.
[2025-02-08 04:47:00,071 INFO  L78                 Accepts]: Start accepts. Automaton has 2927 states and 3935 transitions. Word has length 614
[2025-02-08 04:47:00,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-08 04:47:00,072 INFO  L471      AbstractCegarLoop]: Abstraction has 2927 states and 3935 transitions.
[2025-02-08 04:47:00,072 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 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-08 04:47:00,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 2927 states and 3935 transitions.
[2025-02-08 04:47:00,121 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1479
[2025-02-08 04:47:00,121 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-08 04:47:00,122 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]
[2025-02-08 04:47:00,138 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-02-08 04:47:00,322 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-08 04:47:00,323 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-08 04:47:00,323 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-08 04:47:00,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 1330187149, now seen corresponding path program 2 times
[2025-02-08 04:47:00,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-08 04:47:00,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328385428]
[2025-02-08 04:47:00,324 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-02-08 04:47:00,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-08 04:47:00,745 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1478 statements into 2 equivalence classes.