./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.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_FNV_test6-1.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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:24:21,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:24:21,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:24:21,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:24:21,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:24:21,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:24:21,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:24:21,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:24:21,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:24:21,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:24:21,438 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:24:21,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:24:21,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:24:21,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:24:21,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:24:21,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:24:21,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:21,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:24:21,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:24:21,441 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2025-03-17 10:24:21,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:24:21,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:24:21,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:24:21,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:24:21,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:24:21,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-17 10:24:22,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeacce74/ccc5792810fd4d6083722a43decf5b06/FLAG481a13a25 [2025-03-17 10:24:23,248 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:24:23,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-17 10:24:23,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeacce74/ccc5792810fd4d6083722a43decf5b06/FLAG481a13a25 [2025-03-17 10:24:23,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeacce74/ccc5792810fd4d6083722a43decf5b06 [2025-03-17 10:24:23,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:24:23,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:24:23,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:23,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:24:23,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:24:23,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:23" (1/1) ... [2025-03-17 10:24:23,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a0e6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:23, skipping insertion in model container [2025-03-17 10:24:23,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:24:23" (1/1) ... [2025-03-17 10:24:23,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:24:23,787 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_FNV_test6-1.i[44118,44131] [2025-03-17 10:24:23,797 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_FNV_test6-1.i[44660,44673] [2025-03-17 10:24:23,875 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_FNV_test6-1.i[56247,56260] [2025-03-17 10:24:23,876 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_FNV_test6-1.i[56368,56381] [2025-03-17 10:24:23,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:23,895 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:24:23,933 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_FNV_test6-1.i[44118,44131] [2025-03-17 10:24:23,935 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_FNV_test6-1.i[44660,44673] [2025-03-17 10:24:23,987 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_FNV_test6-1.i[56247,56260] [2025-03-17 10:24:23,988 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_FNV_test6-1.i[56368,56381] [2025-03-17 10:24:23,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:24:24,042 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:24:24,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24 WrapperNode [2025-03-17 10:24:24,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:24:24,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:24,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:24:24,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:24:24,049 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:24:24" (1/1) ... [2025-03-17 10:24:24,078 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:24:24" (1/1) ... [2025-03-17 10:24:24,137 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-03-17 10:24:24,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:24:24,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:24:24,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:24:24,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:24:24,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,207 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2025-03-17 10:24:24,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:24:24,264 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:24:24,264 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:24:24,264 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:24:24,265 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (1/1) ... [2025-03-17 10:24:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:24:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:24:24,314 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:24:24,320 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:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-17 10:24:24,334 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:24:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:24:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-17 10:24:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-17 10:24:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:24:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:24:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:24:24,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:24:24,509 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:24:24,563 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-17 10:24:25,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-17 10:24:25,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-17 10:24:25,612 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:24:25,683 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2025-03-17 10:24:25,683 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:24:25,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:24:25,736 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:24:25,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:25 BoogieIcfgContainer [2025-03-17 10:24:25,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:24:25,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:24:25,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:24:25,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:24:25,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:24:23" (1/3) ... [2025-03-17 10:24:25,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a99b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:25, skipping insertion in model container [2025-03-17 10:24:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:24:24" (2/3) ... [2025-03-17 10:24:25,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0a99b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:24:25, skipping insertion in model container [2025-03-17 10:24:25,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:24:25" (3/3) ... [2025-03-17 10:24:25,743 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2025-03-17 10:24:25,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:24:25,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test6-1.i that has 5 procedures, 426 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-17 10:24:25,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:24:25,808 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;@4663851e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:24:25,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 10:24:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 404 states have (on average 1.599009900990099) internal successors, (646), 408 states have internal predecessors, (646), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 10:24:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:24:25,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:25,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:25,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:25,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash -611902627, now seen corresponding path program 1 times [2025-03-17 10:24:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:25,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047778679] [2025-03-17 10:24:25,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:25,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:24:25,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:24:25,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:25,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:25,977 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:24:25,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:25,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047778679] [2025-03-17 10:24:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047778679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:25,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:25,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:24:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982608999] [2025-03-17 10:24:25,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:25,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:24:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:25,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:24:25,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:24:26,001 INFO L87 Difference]: Start difference. First operand has 426 states, 404 states have (on average 1.599009900990099) internal successors, (646), 408 states have internal predecessors, (646), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:26,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:26,122 INFO L93 Difference]: Finished difference Result 849 states and 1354 transitions. [2025-03-17 10:24:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:24:26,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 10:24:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:26,138 INFO L225 Difference]: With dead ends: 849 [2025-03-17 10:24:26,138 INFO L226 Difference]: Without dead ends: 420 [2025-03-17 10:24:26,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:24:26,147 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:26,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 563 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-17 10:24:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-17 10:24:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2025-03-17 10:24:26,212 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2025-03-17 10:24:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:26,213 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2025-03-17 10:24:26,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2025-03-17 10:24:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:24:26,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:26,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:24:26,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:24:26,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash -672684682, now seen corresponding path program 1 times [2025-03-17 10:24:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637574905] [2025-03-17 10:24:26,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:26,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:24:26,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:24:26,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:26,396 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:24:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637574905] [2025-03-17 10:24:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637574905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:24:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778844522] [2025-03-17 10:24:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:26,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:26,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:26,400 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:26,743 INFO L93 Difference]: Finished difference Result 1024 states and 1475 transitions. [2025-03-17 10:24:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:26,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 10:24:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:26,748 INFO L225 Difference]: With dead ends: 1024 [2025-03-17 10:24:26,749 INFO L226 Difference]: Without dead ends: 815 [2025-03-17 10:24:26,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:24:26,750 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 551 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:26,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 1607 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:24:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-17 10:24:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 422. [2025-03-17 10:24:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2025-03-17 10:24:26,779 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2025-03-17 10:24:26,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:26,779 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2025-03-17 10:24:26,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2025-03-17 10:24:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 10:24:26,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:26,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] [2025-03-17 10:24:26,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:24:26,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:26,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:26,781 INFO L85 PathProgramCache]: Analyzing trace with hash -198173675, now seen corresponding path program 1 times [2025-03-17 10:24:26,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:26,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9511806] [2025-03-17 10:24:26,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:26,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:26,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:24:26,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:24:26,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:26,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:27,067 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:24:27,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9511806] [2025-03-17 10:24:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9511806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:27,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395096643] [2025-03-17 10:24:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:27,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:27,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:27,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:27,069 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:27,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:27,219 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2025-03-17 10:24:27,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:27,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-17 10:24:27,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:27,222 INFO L225 Difference]: With dead ends: 844 [2025-03-17 10:24:27,222 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 10:24:27,224 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:24:27,225 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 105 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:27,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1512 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:24:27,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 10:24:27,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2025-03-17 10:24:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2025-03-17 10:24:27,246 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 63 [2025-03-17 10:24:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2025-03-17 10:24:27,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2025-03-17 10:24:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 10:24:27,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:27,250 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] [2025-03-17 10:24:27,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:24:27,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:27,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash -345921234, now seen corresponding path program 1 times [2025-03-17 10:24:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120638809] [2025-03-17 10:24:27,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:24:27,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:24:27,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:27,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:27,709 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:24:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120638809] [2025-03-17 10:24:27,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120638809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:27,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:27,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33322909] [2025-03-17 10:24:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:27,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:27,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:27,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:27,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:27,712 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:28,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:28,349 INFO L93 Difference]: Finished difference Result 875 states and 1234 transitions. [2025-03-17 10:24:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:24:28,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-17 10:24:28,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:28,352 INFO L225 Difference]: With dead ends: 875 [2025-03-17 10:24:28,352 INFO L226 Difference]: Without dead ends: 456 [2025-03-17 10:24:28,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:28,353 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 14 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:28,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2215 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-17 10:24:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 449. [2025-03-17 10:24:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 428 states have (on average 1.411214953271028) internal successors, (604), 433 states have internal predecessors, (604), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 629 transitions. [2025-03-17 10:24:28,375 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 629 transitions. Word has length 63 [2025-03-17 10:24:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:28,375 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 629 transitions. [2025-03-17 10:24:28,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 629 transitions. [2025-03-17 10:24:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:24:28,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:28,377 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] [2025-03-17 10:24:28,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:24:28,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:28,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1991068577, now seen corresponding path program 1 times [2025-03-17 10:24:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:28,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807536855] [2025-03-17 10:24:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:28,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:24:28,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:24:28,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:28,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:28,647 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:24:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807536855] [2025-03-17 10:24:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807536855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:28,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:24:28,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128383667] [2025-03-17 10:24:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:24:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:24:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:28,650 INFO L87 Difference]: Start difference. First operand 449 states and 629 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:28,882 INFO L93 Difference]: Finished difference Result 904 states and 1269 transitions. [2025-03-17 10:24:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:24:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-17 10:24:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:28,891 INFO L225 Difference]: With dead ends: 904 [2025-03-17 10:24:28,891 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 10:24:28,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:24:28,893 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 17 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:28,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1465 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:24:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 10:24:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2025-03-17 10:24:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.4102564102564104) internal successors, (605), 434 states have internal predecessors, (605), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:28,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 630 transitions. [2025-03-17 10:24:28,912 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 630 transitions. Word has length 64 [2025-03-17 10:24:28,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:28,912 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 630 transitions. [2025-03-17 10:24:28,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:28,913 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 630 transitions. [2025-03-17 10:24:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:24:28,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:28,916 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] [2025-03-17 10:24:28,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:24:28,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:28,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1137888024, now seen corresponding path program 1 times [2025-03-17 10:24:28,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:28,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486060102] [2025-03-17 10:24:28,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:28,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:24:28,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:24:28,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:28,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:29,130 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:24:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486060102] [2025-03-17 10:24:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486060102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:29,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:29,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:24:29,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496721224] [2025-03-17 10:24:29,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:29,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:24:29,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:29,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:24:29,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:29,132 INFO L87 Difference]: Start difference. First operand 450 states and 630 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:29,605 INFO L93 Difference]: Finished difference Result 909 states and 1276 transitions. [2025-03-17 10:24:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:24:29,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-17 10:24:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:29,608 INFO L225 Difference]: With dead ends: 909 [2025-03-17 10:24:29,608 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 10:24:29,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:29,611 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 14 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:29,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2662 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:24:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 10:24:29,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2025-03-17 10:24:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.4109589041095891) internal successors, (618), 443 states have internal predecessors, (618), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 643 transitions. [2025-03-17 10:24:29,630 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 643 transitions. Word has length 64 [2025-03-17 10:24:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:29,630 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 643 transitions. [2025-03-17 10:24:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 643 transitions. [2025-03-17 10:24:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:24:29,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:29,631 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] [2025-03-17 10:24:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:24:29,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:29,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:29,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1499349009, now seen corresponding path program 1 times [2025-03-17 10:24:29,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829264616] [2025-03-17 10:24:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:29,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:29,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:24:29,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:24:29,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:29,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:29,829 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:24:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829264616] [2025-03-17 10:24:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829264616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:29,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:29,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:24:29,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28308552] [2025-03-17 10:24:29,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:29,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:24:29,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:29,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:24:29,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:29,831 INFO L87 Difference]: Start difference. First operand 459 states and 643 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:30,273 INFO L93 Difference]: Finished difference Result 918 states and 1288 transitions. [2025-03-17 10:24:30,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:24:30,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:24:30,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:30,276 INFO L225 Difference]: With dead ends: 918 [2025-03-17 10:24:30,276 INFO L226 Difference]: Without dead ends: 462 [2025-03-17 10:24:30,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:24:30,277 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 8 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:30,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2244 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:24:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-17 10:24:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2025-03-17 10:24:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 441 states have (on average 1.4081632653061225) internal successors, (621), 446 states have internal predecessors, (621), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:30,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 646 transitions. [2025-03-17 10:24:30,288 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 646 transitions. Word has length 65 [2025-03-17 10:24:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:30,288 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 646 transitions. [2025-03-17 10:24:30,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 646 transitions. [2025-03-17 10:24:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:24:30,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:30,289 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] [2025-03-17 10:24:30,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:24:30,289 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:30,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash -168120459, now seen corresponding path program 1 times [2025-03-17 10:24:30,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768161246] [2025-03-17 10:24:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:30,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:30,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:24:30,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:24:30,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:30,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:30,559 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:24:30,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:30,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768161246] [2025-03-17 10:24:30,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768161246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:30,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:30,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:24:30,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069947362] [2025-03-17 10:24:30,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:30,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:30,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:30,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:30,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:30,561 INFO L87 Difference]: Start difference. First operand 462 states and 646 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:31,333 INFO L93 Difference]: Finished difference Result 937 states and 1314 transitions. [2025-03-17 10:24:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:24:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:24:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:31,336 INFO L225 Difference]: With dead ends: 937 [2025-03-17 10:24:31,336 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 10:24:31,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:24:31,338 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 33 mSDsluCounter, 3087 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:31,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3622 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:24:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 10:24:31,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 472. [2025-03-17 10:24:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 451 states have (on average 1.4079822616407982) internal successors, (635), 456 states have internal predecessors, (635), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 660 transitions. [2025-03-17 10:24:31,351 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 660 transitions. Word has length 65 [2025-03-17 10:24:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:31,352 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 660 transitions. [2025-03-17 10:24:31,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:31,352 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 660 transitions. [2025-03-17 10:24:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:24:31,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:31,353 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] [2025-03-17 10:24:31,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:24:31,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:31,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:31,354 INFO L85 PathProgramCache]: Analyzing trace with hash 751414705, now seen corresponding path program 1 times [2025-03-17 10:24:31,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:31,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214824658] [2025-03-17 10:24:31,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:31,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:31,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:24:31,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:24:31,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:31,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:31,698 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:24:31,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:31,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214824658] [2025-03-17 10:24:31,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214824658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:31,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:24:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462214933] [2025-03-17 10:24:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:31,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:24:31,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:31,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:24:31,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:24:31,700 INFO L87 Difference]: Start difference. First operand 472 states and 660 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:32,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:32,263 INFO L93 Difference]: Finished difference Result 947 states and 1326 transitions. [2025-03-17 10:24:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:24:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:24:32,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:32,266 INFO L225 Difference]: With dead ends: 947 [2025-03-17 10:24:32,266 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 10:24:32,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:32,267 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 27 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:32,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2759 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:24:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 10:24:32,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 475. [2025-03-17 10:24:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 454 states have (on average 1.4052863436123348) internal successors, (638), 459 states have internal predecessors, (638), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2025-03-17 10:24:32,278 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 65 [2025-03-17 10:24:32,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2025-03-17 10:24:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2025-03-17 10:24:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:24:32,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:32,279 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] [2025-03-17 10:24:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:24:32,279 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:32,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -745704472, now seen corresponding path program 1 times [2025-03-17 10:24:32,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:32,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96018899] [2025-03-17 10:24:32,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:32,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:32,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:24:32,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:24:32,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:32,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:32,483 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:24:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96018899] [2025-03-17 10:24:32,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96018899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:32,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:24:32,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979949995] [2025-03-17 10:24:32,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:32,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:24:32,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:24:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:32,488 INFO L87 Difference]: Start difference. First operand 475 states and 663 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:33,011 INFO L93 Difference]: Finished difference Result 954 states and 1334 transitions. [2025-03-17 10:24:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:24:33,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-17 10:24:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:33,014 INFO L225 Difference]: With dead ends: 954 [2025-03-17 10:24:33,014 INFO L226 Difference]: Without dead ends: 482 [2025-03-17 10:24:33,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:24:33,015 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 12 mSDsluCounter, 2128 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:33,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2665 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:24:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-03-17 10:24:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 475. [2025-03-17 10:24:33,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 454 states have (on average 1.4052863436123348) internal successors, (638), 459 states have internal predecessors, (638), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2025-03-17 10:24:33,026 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 66 [2025-03-17 10:24:33,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:33,026 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2025-03-17 10:24:33,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2025-03-17 10:24:33,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:24:33,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:33,027 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] [2025-03-17 10:24:33,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:24:33,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1173549674, now seen corresponding path program 1 times [2025-03-17 10:24:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093097311] [2025-03-17 10:24:33,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:33,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:24:33,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:24:33,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:33,414 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:24:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:33,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093097311] [2025-03-17 10:24:33,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093097311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:33,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:24:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752051953] [2025-03-17 10:24:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:33,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:33,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:33,416 INFO L87 Difference]: Start difference. First operand 475 states and 663 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:34,477 INFO L93 Difference]: Finished difference Result 1398 states and 1964 transitions. [2025-03-17 10:24:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:24:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-17 10:24:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:34,481 INFO L225 Difference]: With dead ends: 1398 [2025-03-17 10:24:34,481 INFO L226 Difference]: Without dead ends: 926 [2025-03-17 10:24:34,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 10:24:34,482 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 852 mSDsluCounter, 2578 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:34,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3107 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 10:24:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-17 10:24:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 505. [2025-03-17 10:24:34,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 484 states have (on average 1.390495867768595) internal successors, (673), 489 states have internal predecessors, (673), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 698 transitions. [2025-03-17 10:24:34,496 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 698 transitions. Word has length 66 [2025-03-17 10:24:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:34,496 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 698 transitions. [2025-03-17 10:24:34,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 698 transitions. [2025-03-17 10:24:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 10:24:34,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:34,497 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] [2025-03-17 10:24:34,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:24:34,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:34,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:34,498 INFO L85 PathProgramCache]: Analyzing trace with hash -895332235, now seen corresponding path program 1 times [2025-03-17 10:24:34,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:34,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177414574] [2025-03-17 10:24:34,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:34,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:34,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 10:24:34,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 10:24:34,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:34,719 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:24:34,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:34,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177414574] [2025-03-17 10:24:34,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177414574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:34,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:34,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:24:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959561499] [2025-03-17 10:24:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:34,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:34,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:34,721 INFO L87 Difference]: Start difference. First operand 505 states and 698 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:35,413 INFO L93 Difference]: Finished difference Result 1005 states and 1397 transitions. [2025-03-17 10:24:35,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:24:35,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-17 10:24:35,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:35,416 INFO L225 Difference]: With dead ends: 1005 [2025-03-17 10:24:35,416 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 10:24:35,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:35,417 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 37 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:35,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3535 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:35,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 10:24:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 508. [2025-03-17 10:24:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 487 states have (on average 1.3901437371663243) internal successors, (677), 492 states have internal predecessors, (677), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 702 transitions. [2025-03-17 10:24:35,429 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 702 transitions. Word has length 67 [2025-03-17 10:24:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:35,429 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 702 transitions. [2025-03-17 10:24:35,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 702 transitions. [2025-03-17 10:24:35,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 10:24:35,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:35,430 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] [2025-03-17 10:24:35,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:24:35,430 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:35,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash -684910184, now seen corresponding path program 1 times [2025-03-17 10:24:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276518345] [2025-03-17 10:24:35,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 10:24:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 10:24:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:35,609 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:24:35,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276518345] [2025-03-17 10:24:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276518345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:24:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626443803] [2025-03-17 10:24:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:35,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:35,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:35,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:35,612 INFO L87 Difference]: Start difference. First operand 508 states and 702 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:36,160 INFO L93 Difference]: Finished difference Result 996 states and 1384 transitions. [2025-03-17 10:24:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:24:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-17 10:24:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:36,162 INFO L225 Difference]: With dead ends: 996 [2025-03-17 10:24:36,162 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 10:24:36,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:36,163 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 20 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3218 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:24:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 10:24:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 508. [2025-03-17 10:24:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 487 states have (on average 1.3901437371663243) internal successors, (677), 492 states have internal predecessors, (677), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 702 transitions. [2025-03-17 10:24:36,177 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 702 transitions. Word has length 67 [2025-03-17 10:24:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:36,178 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 702 transitions. [2025-03-17 10:24:36,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 702 transitions. [2025-03-17 10:24:36,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:24:36,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:36,180 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] [2025-03-17 10:24:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:24:36,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:36,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:36,180 INFO L85 PathProgramCache]: Analyzing trace with hash 807840335, now seen corresponding path program 1 times [2025-03-17 10:24:36,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:36,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845166442] [2025-03-17 10:24:36,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:36,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:36,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:24:36,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:24:36,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:36,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:36,412 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:24:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845166442] [2025-03-17 10:24:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845166442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:36,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:24:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066310301] [2025-03-17 10:24:36,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:36,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:24:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:36,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:24:36,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:24:36,415 INFO L87 Difference]: Start difference. First operand 508 states and 702 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:37,136 INFO L93 Difference]: Finished difference Result 1004 states and 1396 transitions. [2025-03-17 10:24:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:24:37,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:24:37,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:37,139 INFO L225 Difference]: With dead ends: 1004 [2025-03-17 10:24:37,139 INFO L226 Difference]: Without dead ends: 529 [2025-03-17 10:24:37,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:24:37,140 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 17 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3972 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:37,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3972 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:24:37,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-17 10:24:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 521. [2025-03-17 10:24:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 500 states have (on average 1.388) internal successors, (694), 505 states have internal predecessors, (694), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 719 transitions. [2025-03-17 10:24:37,157 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 719 transitions. Word has length 68 [2025-03-17 10:24:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 719 transitions. [2025-03-17 10:24:37,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 719 transitions. [2025-03-17 10:24:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:24:37,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:37,158 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] [2025-03-17 10:24:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:24:37,159 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2107722833, now seen corresponding path program 1 times [2025-03-17 10:24:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503946511] [2025-03-17 10:24:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:37,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:37,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:24:37,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:24:37,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:37,384 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:24:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503946511] [2025-03-17 10:24:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503946511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:24:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993949067] [2025-03-17 10:24:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:37,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:24:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:37,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:24:37,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:37,385 INFO L87 Difference]: Start difference. First operand 521 states and 719 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:37,870 INFO L93 Difference]: Finished difference Result 1013 states and 1405 transitions. [2025-03-17 10:24:37,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:24:37,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:24:37,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:37,873 INFO L225 Difference]: With dead ends: 1013 [2025-03-17 10:24:37,873 INFO L226 Difference]: Without dead ends: 525 [2025-03-17 10:24:37,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:37,874 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 11 mSDsluCounter, 2167 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:37,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2707 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:24:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-17 10:24:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 518. [2025-03-17 10:24:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 497 states have (on average 1.386317907444668) internal successors, (689), 502 states have internal predecessors, (689), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 714 transitions. [2025-03-17 10:24:37,889 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 714 transitions. Word has length 68 [2025-03-17 10:24:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:37,889 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 714 transitions. [2025-03-17 10:24:37,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 714 transitions. [2025-03-17 10:24:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:24:37,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:37,891 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] [2025-03-17 10:24:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:24:37,891 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1188187669, now seen corresponding path program 1 times [2025-03-17 10:24:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:37,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865100795] [2025-03-17 10:24:37,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:37,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:37,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:24:37,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:24:37,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:37,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:38,068 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:24:38,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:38,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865100795] [2025-03-17 10:24:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865100795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:24:38,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116613398] [2025-03-17 10:24:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:38,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:24:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:38,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:24:38,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:38,071 INFO L87 Difference]: Start difference. First operand 518 states and 714 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:38,538 INFO L93 Difference]: Finished difference Result 1008 states and 1398 transitions. [2025-03-17 10:24:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:24:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:38,541 INFO L225 Difference]: With dead ends: 1008 [2025-03-17 10:24:38,541 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 10:24:38,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:24:38,542 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 8 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:38,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2635 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 10:24:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 10:24:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 522. [2025-03-17 10:24:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 501 states have (on average 1.3852295409181636) internal successors, (694), 506 states have internal predecessors, (694), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 719 transitions. [2025-03-17 10:24:38,556 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 719 transitions. Word has length 68 [2025-03-17 10:24:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:38,556 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 719 transitions. [2025-03-17 10:24:38,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 719 transitions. [2025-03-17 10:24:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:24:38,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:38,557 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] [2025-03-17 10:24:38,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:24:38,557 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:38,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:38,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1920470134, now seen corresponding path program 1 times [2025-03-17 10:24:38,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:38,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768952404] [2025-03-17 10:24:38,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:38,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:38,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:24:38,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:24:38,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:38,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:38,885 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:24:38,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768952404] [2025-03-17 10:24:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768952404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:38,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:24:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215686890] [2025-03-17 10:24:38,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:38,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:24:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:38,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:24:38,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:24:38,886 INFO L87 Difference]: Start difference. First operand 522 states and 719 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:39,849 INFO L93 Difference]: Finished difference Result 1033 states and 1429 transitions. [2025-03-17 10:24:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:24:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 10:24:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:39,852 INFO L225 Difference]: With dead ends: 1033 [2025-03-17 10:24:39,852 INFO L226 Difference]: Without dead ends: 544 [2025-03-17 10:24:39,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-17 10:24:39,853 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 44 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:39,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3504 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:24:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-17 10:24:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 519. [2025-03-17 10:24:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 498 states have (on average 1.3835341365461848) internal successors, (689), 503 states have internal predecessors, (689), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 714 transitions. [2025-03-17 10:24:39,863 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 714 transitions. Word has length 69 [2025-03-17 10:24:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:39,864 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 714 transitions. [2025-03-17 10:24:39,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 714 transitions. [2025-03-17 10:24:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:24:39,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:39,866 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] [2025-03-17 10:24:39,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:24:39,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:39,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1274300868, now seen corresponding path program 1 times [2025-03-17 10:24:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100411367] [2025-03-17 10:24:39,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:39,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:39,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:24:39,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:24:39,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:39,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:40,070 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:24:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:40,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100411367] [2025-03-17 10:24:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100411367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:40,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 10:24:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586164868] [2025-03-17 10:24:40,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:24:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:40,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:24:40,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:40,071 INFO L87 Difference]: Start difference. First operand 519 states and 714 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:40,678 INFO L93 Difference]: Finished difference Result 1022 states and 1413 transitions. [2025-03-17 10:24:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:24:40,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 10:24:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:40,681 INFO L225 Difference]: With dead ends: 1022 [2025-03-17 10:24:40,681 INFO L226 Difference]: Without dead ends: 536 [2025-03-17 10:24:40,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:40,682 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 40 mSDsluCounter, 3493 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4025 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:40,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4025 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-17 10:24:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 525. [2025-03-17 10:24:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 504 states have (on average 1.380952380952381) internal successors, (696), 509 states have internal predecessors, (696), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 721 transitions. [2025-03-17 10:24:40,693 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 721 transitions. Word has length 69 [2025-03-17 10:24:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:40,693 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 721 transitions. [2025-03-17 10:24:40,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 721 transitions. [2025-03-17 10:24:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:24:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:40,694 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] [2025-03-17 10:24:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:24:40,694 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:40,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1727409454, now seen corresponding path program 1 times [2025-03-17 10:24:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049434194] [2025-03-17 10:24:40,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:40,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:24:40,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:24:40,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:40,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:24:40,882 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:24:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:24:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049434194] [2025-03-17 10:24:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049434194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:24:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:24:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:24:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242197005] [2025-03-17 10:24:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:24:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:24:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:24:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:24:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:24:40,883 INFO L87 Difference]: Start difference. First operand 525 states and 721 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:24:41,497 INFO L93 Difference]: Finished difference Result 1043 states and 1440 transitions. [2025-03-17 10:24:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:24:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 10:24:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:24:41,500 INFO L225 Difference]: With dead ends: 1043 [2025-03-17 10:24:41,500 INFO L226 Difference]: Without dead ends: 551 [2025-03-17 10:24:41,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:24:41,501 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 33 mSDsluCounter, 3008 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:24:41,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3554 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:24:41,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-03-17 10:24:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 522. [2025-03-17 10:24:41,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 501 states have (on average 1.3832335329341316) internal successors, (693), 506 states have internal predecessors, (693), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 10:24:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 718 transitions. [2025-03-17 10:24:41,511 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 718 transitions. Word has length 69 [2025-03-17 10:24:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:24:41,511 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 718 transitions. [2025-03-17 10:24:41,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:24:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 718 transitions. [2025-03-17 10:24:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:24:41,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:24:41,512 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] [2025-03-17 10:24:41,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:24:41,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:24:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:24:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1171681124, now seen corresponding path program 1 times [2025-03-17 10:24:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:24:41,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130648097] [2025-03-17 10:24:41,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:24:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:24:41,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:24:41,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:24:41,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:24:41,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:25:03,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-03-17 10:25:03,509 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:25:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:25:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130648097] [2025-03-17 10:25:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130648097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:25:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:25:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 10:25:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384123891] [2025-03-17 10:25:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:25:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:25:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:25:03,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:25:03,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-17 10:25:03,510 INFO L87 Difference]: Start difference. First operand 522 states and 718 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:25:08,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:12,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:16,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:20,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:24,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:28,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:32,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:36,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:40,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-03-17 10:25:41,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:44,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:47,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:51,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:55,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:25:58,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []