./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:30:23,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:30:23,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:30:23,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:30:23,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:30:23,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:30:23,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:30:23,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:30:23,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:30:23,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:30:23,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:30:23,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:30:23,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:30:23,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:30:23,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:30:23,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:30:23,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:23,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:30:23,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:30:23,696 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/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 -> bfb70cce6cd508003f6161c30aa2ac99ac8ddeb6209ddd86b65ca0c623c2fb1c [2025-03-17 10:30:23,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:30:23,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:30:23,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:30:23,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:30:23,926 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:30:23,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2025-03-17 10:30:25,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e701b717b/0d83274e52794a4ead2f98eb8d33d519/FLAG3259bcc2b [2025-03-17 10:30:25,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:30:25,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i [2025-03-17 10:30:25,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e701b717b/0d83274e52794a4ead2f98eb8d33d519/FLAG3259bcc2b [2025-03-17 10:30:25,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e701b717b/0d83274e52794a4ead2f98eb8d33d519 [2025-03-17 10:30:25,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:30:25,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:30:25,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:25,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:30:25,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:30:25,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:25,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8933637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25, skipping insertion in model container [2025-03-17 10:30:25,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:25,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:30:25,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i[33021,33034] [2025-03-17 10:30:25,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:25,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:30:25,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-2.i[33021,33034] [2025-03-17 10:30:25,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:30:25,996 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:30:25,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25 WrapperNode [2025-03-17 10:30:25,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:30:25,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:25,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:30:25,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:30:26,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,052 INFO L138 Inliner]: procedures = 176, calls = 230, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 971 [2025-03-17 10:30:26,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:30:26,053 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:30:26,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:30:26,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:30:26,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,114 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2025-03-17 10:30:26,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:30:26,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:30:26,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:30:26,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:30:26,150 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (1/1) ... [2025-03-17 10:30:26,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:30:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:26,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:30:26,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:30:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:30:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:30:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:30:26,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:30:26,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 10:30:26,196 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:30:26,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:30:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:30:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:30:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:30:26,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:30:26,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:30:26,339 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:30:26,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:30:27,244 INFO L? ?]: Removed 228 outVars from TransFormulas that were not future-live. [2025-03-17 10:30:27,244 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:30:27,284 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:30:27,284 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:30:27,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:27 BoogieIcfgContainer [2025-03-17 10:30:27,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:30:27,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:30:27,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:30:27,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:30:27,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:30:25" (1/3) ... [2025-03-17 10:30:27,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f0fa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:27, skipping insertion in model container [2025-03-17 10:30:27,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:30:25" (2/3) ... [2025-03-17 10:30:27,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f0fa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:30:27, skipping insertion in model container [2025-03-17 10:30:27,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:30:27" (3/3) ... [2025-03-17 10:30:27,291 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-2.i [2025-03-17 10:30:27,302 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:30:27,303 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-2.i that has 4 procedures, 263 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-17 10:30:27,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:30:27,354 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;@24a398df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:30:27,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 10:30:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 242 states have (on average 1.6239669421487604) internal successors, (393), 253 states have internal predecessors, (393), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:30:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 10:30:27,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:27,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:27,364 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1369399778, now seen corresponding path program 1 times [2025-03-17 10:30:27,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:27,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955171112] [2025-03-17 10:30:27,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:27,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 10:30:27,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 10:30:27,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:27,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955171112] [2025-03-17 10:30:27,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955171112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:27,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:27,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543244634] [2025-03-17 10:30:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:27,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:27,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:27,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:27,527 INFO L87 Difference]: Start difference. First operand has 259 states, 242 states have (on average 1.6239669421487604) internal successors, (393), 253 states have internal predecessors, (393), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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-03-17 10:30:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:27,714 INFO L93 Difference]: Finished difference Result 708 states and 1157 transitions. [2025-03-17 10:30:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:27,716 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-03-17 10:30:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:27,724 INFO L225 Difference]: With dead ends: 708 [2025-03-17 10:30:27,724 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 10:30:27,728 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-03-17 10:30:27,731 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 271 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:27,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 742 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 10:30:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 225. [2025-03-17 10:30:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 209 states have (on average 1.4641148325358853) internal successors, (306), 219 states have internal predecessors, (306), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:30:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 332 transitions. [2025-03-17 10:30:27,776 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 332 transitions. Word has length 8 [2025-03-17 10:30:27,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:27,776 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 332 transitions. [2025-03-17 10:30:27,777 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-03-17 10:30:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 332 transitions. [2025-03-17 10:30:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:30:27,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:27,781 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] [2025-03-17 10:30:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:30:27,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:27,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -645052995, now seen corresponding path program 1 times [2025-03-17 10:30:27,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:27,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479422982] [2025-03-17 10:30:27,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:27,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:30:27,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:30:27,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:27,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479422982] [2025-03-17 10:30:28,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479422982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:28,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:28,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090934492] [2025-03-17 10:30:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:28,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:28,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:28,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:28,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:28,143 INFO L87 Difference]: Start difference. First operand 225 states and 332 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 10:30:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:28,269 INFO L93 Difference]: Finished difference Result 451 states and 665 transitions. [2025-03-17 10:30:28,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:30:28,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 81 [2025-03-17 10:30:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:28,272 INFO L225 Difference]: With dead ends: 451 [2025-03-17 10:30:28,272 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 10:30:28,275 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-03-17 10:30:28,276 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 106 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:28,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 762 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 10:30:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2025-03-17 10:30:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 209 states have (on average 1.430622009569378) internal successors, (299), 219 states have internal predecessors, (299), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:30:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 325 transitions. [2025-03-17 10:30:28,290 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 325 transitions. Word has length 81 [2025-03-17 10:30:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:28,290 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 325 transitions. [2025-03-17 10:30:28,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 10:30:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 325 transitions. [2025-03-17 10:30:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:30:28,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:28,295 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] [2025-03-17 10:30:28,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:30:28,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash -932819882, now seen corresponding path program 1 times [2025-03-17 10:30:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335408823] [2025-03-17 10:30:28,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:28,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:30:28,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:30:28,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:28,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:28,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335408823] [2025-03-17 10:30:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335408823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:30:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303997843] [2025-03-17 10:30:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:30:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:28,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:30:28,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:30:28,481 INFO L87 Difference]: Start difference. First operand 225 states and 325 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 10:30:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:28,559 INFO L93 Difference]: Finished difference Result 400 states and 573 transitions. [2025-03-17 10:30:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:30:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 81 [2025-03-17 10:30:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:28,561 INFO L225 Difference]: With dead ends: 400 [2025-03-17 10:30:28,562 INFO L226 Difference]: Without dead ends: 177 [2025-03-17 10:30:28,563 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-03-17 10:30:28,564 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 9 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:28,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 629 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-17 10:30:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-17 10:30:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 161 states have (on average 1.360248447204969) internal successors, (219), 171 states have internal predecessors, (219), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:30:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2025-03-17 10:30:28,576 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 81 [2025-03-17 10:30:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:28,576 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2025-03-17 10:30:28,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-03-17 10:30:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2025-03-17 10:30:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 10:30:28,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:28,579 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] [2025-03-17 10:30:28,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:30:28,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:28,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1033731849, now seen corresponding path program 1 times [2025-03-17 10:30:28,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:28,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119837921] [2025-03-17 10:30:28,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:28,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 10:30:28,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 10:30:28,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:30:28,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:28,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119837921] [2025-03-17 10:30:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119837921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:30:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:30:28,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:30:28,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222379533] [2025-03-17 10:30:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:30:28,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:30:28,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:28,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:30:28,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:30:28,740 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-03-17 10:30:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:28,828 INFO L93 Difference]: Finished difference Result 431 states and 595 transitions. [2025-03-17 10:30:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:30:28,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 81 [2025-03-17 10:30:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:28,829 INFO L225 Difference]: With dead ends: 431 [2025-03-17 10:30:28,829 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 10:30:28,830 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-03-17 10:30:28,830 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 54 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:28,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 452 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 10:30:28,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-17 10:30:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 240 states have (on average 1.3541666666666667) internal successors, (325), 250 states have internal predecessors, (325), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 10:30:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 351 transitions. [2025-03-17 10:30:28,845 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 351 transitions. Word has length 81 [2025-03-17 10:30:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:28,845 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 351 transitions. [2025-03-17 10:30:28,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-03-17 10:30:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 351 transitions. [2025-03-17 10:30:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 10:30:28,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:28,848 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] [2025-03-17 10:30:28,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:30:28,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 4694188, now seen corresponding path program 1 times [2025-03-17 10:30:28,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:28,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710658891] [2025-03-17 10:30:28,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:28,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:28,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 10:30:28,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 10:30:28,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:28,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:29,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710658891] [2025-03-17 10:30:29,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710658891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:29,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241445653] [2025-03-17 10:30:29,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:29,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:30:29,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 10:30:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 10:30:29,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 10:30:29,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:29,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:29,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 10:30:29,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:29,423 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:30:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241445653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:30:29,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:30:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 10:30:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073958852] [2025-03-17 10:30:29,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:30:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:30:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:30:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:30:29,553 INFO L87 Difference]: Start difference. First operand 256 states and 351 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:30:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:29,682 INFO L93 Difference]: Finished difference Result 632 states and 865 transitions. [2025-03-17 10:30:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:30:29,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2025-03-17 10:30:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:29,687 INFO L225 Difference]: With dead ends: 632 [2025-03-17 10:30:29,687 INFO L226 Difference]: Without dead ends: 604 [2025-03-17 10:30:29,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:30:29,688 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 686 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:29,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 897 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:30:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-17 10:30:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2025-03-17 10:30:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 579 states have (on average 1.3316062176165804) internal successors, (771), 589 states have internal predecessors, (771), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 10:30:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 815 transitions. [2025-03-17 10:30:29,707 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 815 transitions. Word has length 96 [2025-03-17 10:30:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:29,707 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 815 transitions. [2025-03-17 10:30:29,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:30:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 815 transitions. [2025-03-17 10:30:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-03-17 10:30:29,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:29,714 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:29,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 10:30:29,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:29,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -492315255, now seen corresponding path program 1 times [2025-03-17 10:30:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156236980] [2025-03-17 10:30:29,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:30,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 10:30:30,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 10:30:30,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:30,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:30,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:30:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156236980] [2025-03-17 10:30:30,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156236980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:30:30,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863887161] [2025-03-17 10:30:30,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:30:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:30:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:30:30,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:30:30,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 10:30:30,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-03-17 10:30:31,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-03-17 10:30:31,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:30:31,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:30:31,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 10:30:31,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:30:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:31,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 10:30:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 10:30:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863887161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 10:30:31,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 10:30:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 10:30:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39323313] [2025-03-17 10:30:31,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 10:30:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:30:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:30:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:30:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:30:31,815 INFO L87 Difference]: Start difference. First operand 604 states and 815 transitions. Second operand has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:30:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:30:32,087 INFO L93 Difference]: Finished difference Result 1490 states and 2014 transitions. [2025-03-17 10:30:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 10:30:32,088 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 315 [2025-03-17 10:30:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:30:32,094 INFO L225 Difference]: With dead ends: 1490 [2025-03-17 10:30:32,094 INFO L226 Difference]: Without dead ends: 1462 [2025-03-17 10:30:32,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:30:32,095 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 2271 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2297 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:30:32,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2297 Valid, 2118 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:30:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2025-03-17 10:30:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1462. [2025-03-17 10:30:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 1419 states have (on average 1.3255813953488371) internal successors, (1881), 1429 states have internal predecessors, (1881), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 31 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 10:30:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1961 transitions. [2025-03-17 10:30:32,148 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1961 transitions. Word has length 315 [2025-03-17 10:30:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:30:32,149 INFO L471 AbstractCegarLoop]: Abstraction has 1462 states and 1961 transitions. [2025-03-17 10:30:32,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.5) internal successors, (606), 12 states have internal predecessors, (606), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 10:30:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1961 transitions. [2025-03-17 10:30:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2025-03-17 10:30:32,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:30:32,191 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:30:32,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 10:30:32,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 10:30:32,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 10:30:32,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:30:32,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1978997673, now seen corresponding path program 2 times [2025-03-17 10:30:32,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:30:32,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465115541] [2025-03-17 10:30:32,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:30:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:30:32,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 753 statements into 2 equivalence classes. [2025-03-17 10:31:37,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 753 of 753 statements. [2025-03-17 10:31:37,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:31:37,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:31:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 478 proven. 3 refuted. 0 times theorem prover too weak. 2800 trivial. 0 not checked. [2025-03-17 10:31:38,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:31:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465115541] [2025-03-17 10:31:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465115541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 10:31:38,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41078745] [2025-03-17 10:31:38,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 10:31:38,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 10:31:38,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:31:38,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 10:31:38,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 10:31:38,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 753 statements into 2 equivalence classes. [2025-03-17 10:32:01,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 753 of 753 statements. [2025-03-17 10:32:01,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 10:32:01,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:32:02,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 3839 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-17 10:32:02,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 10:32:02,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 10:32:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-17 10:32:02,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 58 [2025-03-17 10:32:02,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3281 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2025-03-17 10:32:02,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 10:32:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41078745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:32:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 10:32:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-03-17 10:32:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136400536] [2025-03-17 10:32:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:32:02,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 10:32:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:32:02,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 10:32:02,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 10:32:02,907 INFO L87 Difference]: Start difference. First operand 1462 states and 1961 transitions. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 11 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)