./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 21:17:03,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:17:03,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 21:17:03,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:17:03,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:17:03,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:17:03,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:17:03,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:17:03,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 21:17:03,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 21:17:03,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:17:03,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:17:03,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:17:03,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:17:03,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:17:03,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 21:17:03,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:17:03,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:17:03,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:17:03,438 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-08 21:17:03,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:17:03,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:17:03,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:17:03,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:17:03,672 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:17:03,674 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-08 21:17:04,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acc4e275/d9ff9d30c77744e49114a28e267c459b/FLAG7fa239264 [2025-03-08 21:17:05,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:17:05,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2025-03-08 21:17:05,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acc4e275/d9ff9d30c77744e49114a28e267c459b/FLAG7fa239264 [2025-03-08 21:17:05,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3acc4e275/d9ff9d30c77744e49114a28e267c459b [2025-03-08 21:17:05,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:17:05,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:17:05,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:17:05,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:17:05,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:17:05,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:17:05" (1/1) ... [2025-03-08 21:17:05,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60e5e813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:05, skipping insertion in model container [2025-03-08 21:17:05,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:17:05" (1/1) ... [2025-03-08 21:17:05,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:17:05,762 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-08 21:17:05,774 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-08 21:17:05,857 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-08 21:17:05,858 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-08 21:17:05,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:17:05,877 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:17:05,914 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-08 21:17:05,920 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-08 21:17:05,966 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-08 21:17:05,967 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-08 21:17:05,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:17:06,017 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:17:06,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06 WrapperNode [2025-03-08 21:17:06,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:17:06,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:17:06,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:17:06,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:17:06,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,083 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-03-08 21:17:06,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:17:06,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:17:06,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:17:06,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:17:06,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,171 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-03-08 21:17:06,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,194 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:17:06,239 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:17:06,239 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:17:06,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:17:06,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (1/1) ... [2025-03-08 21:17:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:17:06,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:17:06,263 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-08 21:17:06,267 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-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-08 21:17:06,281 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 21:17:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 21:17:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-08 21:17:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-08 21:17:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 21:17:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:17:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:17:06,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:17:06,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:17:06,484 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-08 21:17:07,366 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-08 21:17:07,366 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-08 21:17:07,367 INFO L1307 $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-08 21:17:07,424 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-03-08 21:17:07,425 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:17:07,477 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:17:07,477 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 21:17:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:17:07 BoogieIcfgContainer [2025-03-08 21:17:07,477 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:17:07,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:17:07,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:17:07,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:17:07,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:17:05" (1/3) ... [2025-03-08 21:17:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9baeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:17:07, skipping insertion in model container [2025-03-08 21:17:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:17:06" (2/3) ... [2025-03-08 21:17:07,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9baeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:17:07, skipping insertion in model container [2025-03-08 21:17:07,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:17:07" (3/3) ... [2025-03-08 21:17:07,484 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2025-03-08 21:17:07,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:17:07,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test6-1.i that has 5 procedures, 429 locations, 1 initial locations, 34 loop locations, and 4 error locations. [2025-03-08 21:17:07,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:17:07,557 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;@3a4bdd51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:17:07,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 21:17:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 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-08 21:17:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 21:17:07,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:07,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:07,567 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-08 21:17:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1073890916, now seen corresponding path program 1 times [2025-03-08 21:17:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132310951] [2025-03-08 21:17:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 21:17:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 21:17:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:07,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:07,731 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-08 21:17:07,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:07,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132310951] [2025-03-08 21:17:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132310951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:07,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:07,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:17:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147805042] [2025-03-08 21:17:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 21:17:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:07,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 21:17:07,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 21:17:07,756 INFO L87 Difference]: Start difference. First operand has 429 states, 407 states have (on average 1.5945945945945945) internal successors, (649), 411 states have internal predecessors, (649), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:17:07,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:07,871 INFO L93 Difference]: Finished difference Result 854 states and 1359 transitions. [2025-03-08 21:17:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 21:17:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 21:17:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:07,879 INFO L225 Difference]: With dead ends: 854 [2025-03-08 21:17:07,880 INFO L226 Difference]: Without dead ends: 423 [2025-03-08 21:17:07,883 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-08 21:17:07,884 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 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-08 21:17:07,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-08 21:17:07,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-03-08 21:17:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 402 states have (on average 1.4402985074626866) internal successors, (579), 407 states have internal predecessors, (579), 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-08 21:17:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 604 transitions. [2025-03-08 21:17:07,937 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 604 transitions. Word has length 8 [2025-03-08 21:17:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:07,937 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 604 transitions. [2025-03-08 21:17:07,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:17:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 604 transitions. [2025-03-08 21:17:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 21:17:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:07,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:07,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:17:07,938 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-08 21:17:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2034121717, now seen corresponding path program 1 times [2025-03-08 21:17:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064506330] [2025-03-08 21:17:07,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:07,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 21:17:07,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 21:17:07,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:08,088 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-08 21:17:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064506330] [2025-03-08 21:17:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064506330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496144427] [2025-03-08 21:17:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:08,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:08,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:08,092 INFO L87 Difference]: Start difference. First operand 423 states and 604 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08 21:17:08,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:08,366 INFO L93 Difference]: Finished difference Result 1029 states and 1480 transitions. [2025-03-08 21:17:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:17:08,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-03-08 21:17:08,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:08,371 INFO L225 Difference]: With dead ends: 1029 [2025-03-08 21:17:08,371 INFO L226 Difference]: Without dead ends: 819 [2025-03-08 21:17:08,372 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-08 21:17:08,372 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 552 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1611 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:08,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1611 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:17:08,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-08 21:17:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 425. [2025-03-08 21:17:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.438118811881188) internal successors, (581), 409 states have internal predecessors, (581), 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-08 21:17:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 606 transitions. [2025-03-08 21:17:08,406 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 606 transitions. Word has length 10 [2025-03-08 21:17:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:08,407 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 606 transitions. [2025-03-08 21:17:08,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-08 21:17:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 606 transitions. [2025-03-08 21:17:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 21:17:08,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:08,408 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-08 21:17:08,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:17:08,408 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-08 21:17:08,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash -577258923, now seen corresponding path program 1 times [2025-03-08 21:17:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739779158] [2025-03-08 21:17:08,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:08,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 21:17:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 21:17:08,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:08,696 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-08 21:17:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739779158] [2025-03-08 21:17:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739779158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345980712] [2025-03-08 21:17:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:08,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:08,697 INFO L87 Difference]: Start difference. First operand 425 states and 606 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-08 21:17:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:08,846 INFO L93 Difference]: Finished difference Result 849 states and 1211 transitions. [2025-03-08 21:17:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:17:08,847 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-08 21:17:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:08,850 INFO L225 Difference]: With dead ends: 849 [2025-03-08 21:17:08,851 INFO L226 Difference]: Without dead ends: 428 [2025-03-08 21:17:08,852 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-08 21:17:08,852 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 105 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1521 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-08 21:17:08,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1521 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 21:17:08,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-08 21:17:08,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-03-08 21:17:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 404 states have (on average 1.4207920792079207) internal successors, (574), 409 states have internal predecessors, (574), 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-08 21:17:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 599 transitions. [2025-03-08 21:17:08,872 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 599 transitions. Word has length 64 [2025-03-08 21:17:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 599 transitions. [2025-03-08 21:17:08,873 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-08 21:17:08,873 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 599 transitions. [2025-03-08 21:17:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 21:17:08,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:08,874 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-08 21:17:08,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:17:08,875 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-08 21:17:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1694587505, now seen corresponding path program 1 times [2025-03-08 21:17:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610870490] [2025-03-08 21:17:08,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:08,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 21:17:08,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 21:17:08,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:08,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:09,291 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-08 21:17:09,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610870490] [2025-03-08 21:17:09,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610870490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:09,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:09,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:17:09,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214572030] [2025-03-08 21:17:09,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:09,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:17:09,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:09,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:17:09,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:17:09,292 INFO L87 Difference]: Start difference. First operand 425 states and 599 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 21:17:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:09,833 INFO L93 Difference]: Finished difference Result 880 states and 1239 transitions. [2025-03-08 21:17:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:17:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 21:17:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:09,835 INFO L225 Difference]: With dead ends: 880 [2025-03-08 21:17:09,836 INFO L226 Difference]: Without dead ends: 459 [2025-03-08 21:17:09,837 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-08 21:17:09,838 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 14 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2230 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:09,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2230 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-08 21:17:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 452. [2025-03-08 21:17:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 431 states have (on average 1.408352668213457) internal successors, (607), 436 states have internal predecessors, (607), 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-08 21:17:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 632 transitions. [2025-03-08 21:17:09,852 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 632 transitions. Word has length 64 [2025-03-08 21:17:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:09,852 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 632 transitions. [2025-03-08 21:17:09,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 21:17:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 632 transitions. [2025-03-08 21:17:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 21:17:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:09,855 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-08 21:17:09,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:17:09,856 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-08 21:17:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash -245950012, now seen corresponding path program 1 times [2025-03-08 21:17:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066780049] [2025-03-08 21:17:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:09,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:09,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 21:17:09,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 21:17:09,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:09,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:10,103 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-08 21:17:10,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:10,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066780049] [2025-03-08 21:17:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066780049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:10,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:10,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:17:10,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593487433] [2025-03-08 21:17:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:10,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:17:10,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:10,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:17:10,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:17:10,105 INFO L87 Difference]: Start difference. First operand 452 states and 632 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-08 21:17:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:10,315 INFO L93 Difference]: Finished difference Result 909 states and 1274 transitions. [2025-03-08 21:17:10,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:17:10,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-08 21:17:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:10,318 INFO L225 Difference]: With dead ends: 909 [2025-03-08 21:17:10,318 INFO L226 Difference]: Without dead ends: 461 [2025-03-08 21:17:10,319 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-08 21:17:10,319 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 17 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1474 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-08 21:17:10,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1474 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 21:17:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-08 21:17:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 453. [2025-03-08 21:17:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.4074074074074074) internal successors, (608), 437 states have internal predecessors, (608), 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-08 21:17:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 633 transitions. [2025-03-08 21:17:10,330 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 633 transitions. Word has length 65 [2025-03-08 21:17:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:10,330 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 633 transitions. [2025-03-08 21:17:10,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-08 21:17:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 633 transitions. [2025-03-08 21:17:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 21:17:10,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:10,332 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-08 21:17:10,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:17:10,332 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-08 21:17:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash 920060683, now seen corresponding path program 1 times [2025-03-08 21:17:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971139262] [2025-03-08 21:17:10,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:10,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 21:17:10,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 21:17:10,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:10,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:10,560 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-08 21:17:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971139262] [2025-03-08 21:17:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971139262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:17:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048986124] [2025-03-08 21:17:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:17:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:10,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:17:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:17:10,563 INFO L87 Difference]: Start difference. First operand 453 states and 633 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-08 21:17:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:11,073 INFO L93 Difference]: Finished difference Result 914 states and 1281 transitions. [2025-03-08 21:17:11,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:17:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-08 21:17:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:11,076 INFO L225 Difference]: With dead ends: 914 [2025-03-08 21:17:11,076 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 21:17:11,077 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-08 21:17:11,078 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 14 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2680 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:11,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2680 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 21:17:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 462. [2025-03-08 21:17:11,088 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-08 21:17:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 646 transitions. [2025-03-08 21:17:11,089 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 646 transitions. Word has length 65 [2025-03-08 21:17:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:11,090 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 646 transitions. [2025-03-08 21:17:11,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-08 21:17:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 646 transitions. [2025-03-08 21:17:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:17:11,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:11,091 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-08 21:17:11,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:17:11,091 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-08 21:17:11,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1788179634, now seen corresponding path program 1 times [2025-03-08 21:17:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102852874] [2025-03-08 21:17:11,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:11,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:17:11,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:17:11,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:11,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:11,289 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-08 21:17:11,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:11,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102852874] [2025-03-08 21:17:11,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102852874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:11,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:17:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336029741] [2025-03-08 21:17:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:11,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:17:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:11,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:17:11,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:17:11,291 INFO L87 Difference]: Start difference. First operand 462 states and 646 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-08 21:17:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:11,710 INFO L93 Difference]: Finished difference Result 923 states and 1293 transitions. [2025-03-08 21:17:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:17:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-08 21:17:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:11,712 INFO L225 Difference]: With dead ends: 923 [2025-03-08 21:17:11,713 INFO L226 Difference]: Without dead ends: 465 [2025-03-08 21:17:11,713 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-08 21:17:11,714 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 8 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2259 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-08 21:17:11,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2259 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 21:17:11,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-08 21:17:11,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-08 21:17:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 444 states have (on average 1.4054054054054055) internal successors, (624), 449 states have internal predecessors, (624), 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-08 21:17:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 649 transitions. [2025-03-08 21:17:11,724 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 649 transitions. Word has length 66 [2025-03-08 21:17:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:11,724 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 649 transitions. [2025-03-08 21:17:11,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 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-08 21:17:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 649 transitions. [2025-03-08 21:17:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:17:11,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:11,725 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-08 21:17:11,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:17:11,725 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-08 21:17:11,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:11,725 INFO L85 PathProgramCache]: Analyzing trace with hash 120710166, now seen corresponding path program 1 times [2025-03-08 21:17:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652409092] [2025-03-08 21:17:11,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:11,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:11,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:17:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:17:11,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:11,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:12,014 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-08 21:17:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652409092] [2025-03-08 21:17:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652409092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:17:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657997459] [2025-03-08 21:17:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:12,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:17:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:12,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:17:12,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:17:12,016 INFO L87 Difference]: Start difference. First operand 465 states and 649 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-08 21:17:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:12,737 INFO L93 Difference]: Finished difference Result 942 states and 1319 transitions. [2025-03-08 21:17:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:17:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-08 21:17:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:12,740 INFO L225 Difference]: With dead ends: 942 [2025-03-08 21:17:12,740 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 21:17:12,741 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-08 21:17:12,741 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 33 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3646 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-08 21:17:12,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3646 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:17:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 21:17:12,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2025-03-08 21:17:12,751 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-08 21:17:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 663 transitions. [2025-03-08 21:17:12,753 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 663 transitions. Word has length 66 [2025-03-08 21:17:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:12,754 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 663 transitions. [2025-03-08 21:17:12,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 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-08 21:17:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 663 transitions. [2025-03-08 21:17:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 21:17:12,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:12,755 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-08 21:17:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:17:12,755 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-08 21:17:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1040245330, now seen corresponding path program 1 times [2025-03-08 21:17:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628798190] [2025-03-08 21:17:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 21:17:12,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 21:17:12,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:12,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:13,120 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-08 21:17:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:13,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628798190] [2025-03-08 21:17:13,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628798190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:13,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 21:17:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799916368] [2025-03-08 21:17:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:13,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 21:17:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:13,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 21:17:13,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 21:17:13,125 INFO L87 Difference]: Start difference. First operand 475 states and 663 transitions. Second operand has 8 states, 8 states have (on average 8.0) 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-08 21:17:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:13,746 INFO L93 Difference]: Finished difference Result 952 states and 1331 transitions. [2025-03-08 21:17:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 21:17:13,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) 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-08 21:17:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:13,748 INFO L225 Difference]: With dead ends: 952 [2025-03-08 21:17:13,748 INFO L226 Difference]: Without dead ends: 481 [2025-03-08 21:17:13,749 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-08 21:17:13,749 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 27 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:13,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3199 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-08 21:17:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 478. [2025-03-08 21:17:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 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-08 21:17:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-08 21:17:13,759 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 66 [2025-03-08 21:17:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:13,760 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-08 21:17:13,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) 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-08 21:17:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-08 21:17:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 21:17:13,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:13,761 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-08 21:17:13,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:17:13,761 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-08 21:17:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 885840396, now seen corresponding path program 1 times [2025-03-08 21:17:13,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:13,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575181852] [2025-03-08 21:17:13,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:13,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:13,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:17:13,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:17:13,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:13,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:13,935 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-08 21:17:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575181852] [2025-03-08 21:17:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575181852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:13,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:17:13,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956556227] [2025-03-08 21:17:13,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:13,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:17:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:13,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:17:13,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:17:13,937 INFO L87 Difference]: Start difference. First operand 478 states and 666 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-08 21:17:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:14,458 INFO L93 Difference]: Finished difference Result 959 states and 1339 transitions. [2025-03-08 21:17:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:17:14,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-08 21:17:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:14,460 INFO L225 Difference]: With dead ends: 959 [2025-03-08 21:17:14,460 INFO L226 Difference]: Without dead ends: 485 [2025-03-08 21:17:14,461 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-08 21:17:14,462 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 12 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2686 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:14,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2686 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-08 21:17:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 478. [2025-03-08 21:17:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 457 states have (on average 1.4026258205689277) internal successors, (641), 462 states have internal predecessors, (641), 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-08 21:17:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 666 transitions. [2025-03-08 21:17:14,472 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 666 transitions. Word has length 67 [2025-03-08 21:17:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:14,473 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 666 transitions. [2025-03-08 21:17:14,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-08 21:17:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 666 transitions. [2025-03-08 21:17:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 21:17:14,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:14,474 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-08 21:17:14,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:17:14,474 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-08 21:17:14,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 800296954, now seen corresponding path program 1 times [2025-03-08 21:17:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833775296] [2025-03-08 21:17:14,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:14,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:17:14,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:17:14,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:14,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:14,873 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-08 21:17:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:14,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833775296] [2025-03-08 21:17:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833775296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:14,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:17:14,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090160922] [2025-03-08 21:17:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:14,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:17:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:14,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:17:14,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:17:14,875 INFO L87 Difference]: Start difference. First operand 478 states and 666 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-08 21:17:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:16,131 INFO L93 Difference]: Finished difference Result 1404 states and 1970 transitions. [2025-03-08 21:17:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 21:17:16,132 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-08 21:17:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:16,135 INFO L225 Difference]: With dead ends: 1404 [2025-03-08 21:17:16,135 INFO L226 Difference]: Without dead ends: 930 [2025-03-08 21:17:16,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 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-08 21:17:16,137 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 852 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3661 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:16,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3661 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 21:17:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-08 21:17:16,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 508. [2025-03-08 21:17:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 487 states have (on average 1.3880903490759753) internal successors, (676), 492 states have internal predecessors, (676), 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-08 21:17:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 701 transitions. [2025-03-08 21:17:16,151 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 701 transitions. Word has length 67 [2025-03-08 21:17:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:16,151 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 701 transitions. [2025-03-08 21:17:16,151 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-08 21:17:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 701 transitions. [2025-03-08 21:17:16,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 21:17:16,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:16,152 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-08 21:17:16,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:17:16,152 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-08 21:17:16,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1280407161, now seen corresponding path program 1 times [2025-03-08 21:17:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266658895] [2025-03-08 21:17:16,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:16,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:17:16,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:17:16,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:16,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:16,360 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-08 21:17:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266658895] [2025-03-08 21:17:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266658895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:16,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:17:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991523826] [2025-03-08 21:17:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:16,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:17:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:16,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:17:16,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:17:16,361 INFO L87 Difference]: Start difference. First operand 508 states and 701 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:16,917 INFO L93 Difference]: Finished difference Result 995 states and 1381 transitions. [2025-03-08 21:17:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:17:16,917 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:16,919 INFO L225 Difference]: With dead ends: 995 [2025-03-08 21:17:16,919 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 21:17:16,920 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-08 21:17:16,920 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:16,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3648 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 21:17:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2025-03-08 21:17:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 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-08 21:17:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-08 21:17:16,932 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-08 21:17:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:16,932 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-08 21:17:16,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-08 21:17:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 21:17:16,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:16,933 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-08 21:17:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:17:16,934 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-08 21:17:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash -940118731, now seen corresponding path program 1 times [2025-03-08 21:17:16,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:16,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095398776] [2025-03-08 21:17:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:16,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:16,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 21:17:16,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 21:17:16,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:16,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:17,164 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-08 21:17:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095398776] [2025-03-08 21:17:17,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095398776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:17,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:17,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:17:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884449757] [2025-03-08 21:17:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:17,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:17:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:17,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:17:17,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:17:17,166 INFO L87 Difference]: Start difference. First operand 511 states and 705 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:17,851 INFO L93 Difference]: Finished difference Result 1016 states and 1410 transitions. [2025-03-08 21:17:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:17,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:17,854 INFO L225 Difference]: With dead ends: 1016 [2025-03-08 21:17:17,854 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 21:17:17,855 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-08 21:17:17,856 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3578 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:17,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3578 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 21:17:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 511. [2025-03-08 21:17:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 490 states have (on average 1.3877551020408163) internal successors, (680), 495 states have internal predecessors, (680), 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-08 21:17:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 705 transitions. [2025-03-08 21:17:17,870 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 705 transitions. Word has length 68 [2025-03-08 21:17:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:17,871 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 705 transitions. [2025-03-08 21:17:17,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 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-08 21:17:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 705 transitions. [2025-03-08 21:17:17,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:17:17,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:17,873 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-08 21:17:17,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:17:17,874 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-08 21:17:17,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 453215023, now seen corresponding path program 1 times [2025-03-08 21:17:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690653399] [2025-03-08 21:17:17,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:17,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:17,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:17:17,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:17:17,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:17,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:18,100 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-08 21:17:18,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690653399] [2025-03-08 21:17:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690653399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:18,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:17:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330597553] [2025-03-08 21:17:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:18,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:17:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:18,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:17:18,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:17:18,103 INFO L87 Difference]: Start difference. First operand 511 states and 705 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-08 21:17:18,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:18,708 INFO L93 Difference]: Finished difference Result 1004 states and 1394 transitions. [2025-03-08 21:17:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:18,708 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-08 21:17:18,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:18,710 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 21:17:18,710 INFO L226 Difference]: Without dead ends: 527 [2025-03-08 21:17:18,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 21:17:18,711 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 23 mSDsluCounter, 3086 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:18,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3630 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-08 21:17:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 521. [2025-03-08 21:17:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 500 states have (on average 1.384) internal successors, (692), 505 states have internal predecessors, (692), 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-08 21:17:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 717 transitions. [2025-03-08 21:17:18,722 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 717 transitions. Word has length 69 [2025-03-08 21:17:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:18,722 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 717 transitions. [2025-03-08 21:17:18,722 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-08 21:17:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 717 transitions. [2025-03-08 21:17:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:17:18,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:18,723 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-08 21:17:18,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:17:18,723 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-08 21:17:18,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:18,724 INFO L85 PathProgramCache]: Analyzing trace with hash 336389107, now seen corresponding path program 1 times [2025-03-08 21:17:18,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:18,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628423077] [2025-03-08 21:17:18,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:18,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:18,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:17:18,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:17:18,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:18,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:18,968 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-08 21:17:18,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:18,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628423077] [2025-03-08 21:17:18,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628423077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:18,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:18,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:17:18,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995191701] [2025-03-08 21:17:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:18,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:17:18,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:18,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:17:18,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:17:18,969 INFO L87 Difference]: Start difference. First operand 521 states and 717 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-08 21:17:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:19,587 INFO L93 Difference]: Finished difference Result 1026 states and 1421 transitions. [2025-03-08 21:17:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:19,587 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-08 21:17:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:19,590 INFO L225 Difference]: With dead ends: 1026 [2025-03-08 21:17:19,590 INFO L226 Difference]: Without dead ends: 539 [2025-03-08 21:17:19,590 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-08 21:17:19,591 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:19,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4008 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:19,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-08 21:17:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 524. [2025-03-08 21:17:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3836978131212723) internal successors, (696), 508 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-08 21:17:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 721 transitions. [2025-03-08 21:17:19,602 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 721 transitions. Word has length 69 [2025-03-08 21:17:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:19,602 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 721 transitions. [2025-03-08 21:17:19,602 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-08 21:17:19,602 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 721 transitions. [2025-03-08 21:17:19,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:17:19,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:19,603 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-08 21:17:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:17:19,603 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-08 21:17:19,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1715793235, now seen corresponding path program 1 times [2025-03-08 21:17:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359089421] [2025-03-08 21:17:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:19,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:17:19,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:17:19,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:19,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:19,795 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-08 21:17:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:19,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359089421] [2025-03-08 21:17:19,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359089421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:19,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:19,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:17:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835545465] [2025-03-08 21:17:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:19,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:17:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:19,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:17:19,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:17:19,796 INFO L87 Difference]: Start difference. First operand 524 states and 721 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:20,290 INFO L93 Difference]: Finished difference Result 1021 states and 1411 transitions. [2025-03-08 21:17:20,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:17:20,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:20,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:20,293 INFO L225 Difference]: With dead ends: 1021 [2025-03-08 21:17:20,293 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 21:17:20,294 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-08 21:17:20,294 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 11 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:20,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2717 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 21:17:20,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2025-03-08 21:17:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 503 states have (on average 1.3817097415506958) internal successors, (695), 508 states have internal predecessors, (695), 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-08 21:17:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 720 transitions. [2025-03-08 21:17:20,306 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 720 transitions. Word has length 69 [2025-03-08 21:17:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:20,307 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 720 transitions. [2025-03-08 21:17:20,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 720 transitions. [2025-03-08 21:17:20,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 21:17:20,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:20,307 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-08 21:17:20,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:17:20,308 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-08 21:17:20,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1659638897, now seen corresponding path program 1 times [2025-03-08 21:17:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840413429] [2025-03-08 21:17:20,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:20,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:20,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:17:20,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:17:20,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:20,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:20,475 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-08 21:17:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840413429] [2025-03-08 21:17:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840413429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 21:17:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861716974] [2025-03-08 21:17:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 21:17:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 21:17:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 21:17:20,478 INFO L87 Difference]: Start difference. First operand 524 states and 720 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:21,028 INFO L93 Difference]: Finished difference Result 1019 states and 1409 transitions. [2025-03-08 21:17:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 21:17:21,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:21,031 INFO L225 Difference]: With dead ends: 1019 [2025-03-08 21:17:21,032 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 21:17:21,032 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-08 21:17:21,033 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 8 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2653 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.5s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:21,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2653 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 21:17:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 21:17:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2025-03-08 21:17:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 507 states have (on average 1.3806706114398422) internal successors, (700), 512 states have internal predecessors, (700), 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-08 21:17:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 725 transitions. [2025-03-08 21:17:21,044 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 725 transitions. Word has length 69 [2025-03-08 21:17:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:21,044 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 725 transitions. [2025-03-08 21:17:21,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-08 21:17:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 725 transitions. [2025-03-08 21:17:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:17:21,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:21,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:21,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:17:21,046 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-08 21:17:21,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1849591247, now seen corresponding path program 1 times [2025-03-08 21:17:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:21,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655194200] [2025-03-08 21:17:21,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:21,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:21,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:17:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:17:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:21,316 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-08 21:17:21,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:21,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655194200] [2025-03-08 21:17:21,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655194200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:21,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:21,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:17:21,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699939576] [2025-03-08 21:17:21,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:21,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:17:21,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:21,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:17:21,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:17:21,342 INFO L87 Difference]: Start difference. First operand 528 states and 725 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-08 21:17:23,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 21:17:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:24,140 INFO L93 Difference]: Finished difference Result 1034 states and 1429 transitions. [2025-03-08 21:17:24,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2025-03-08 21:17:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:24,142 INFO L225 Difference]: With dead ends: 1034 [2025-03-08 21:17:24,142 INFO L226 Difference]: Without dead ends: 540 [2025-03-08 21:17:24,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:17:24,143 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 13 mSDsluCounter, 3025 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3566 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:24,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3566 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 21:17:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-08 21:17:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 532. [2025-03-08 21:17:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 511 states have (on average 1.3796477495107633) internal successors, (705), 516 states have internal predecessors, (705), 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-08 21:17:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 730 transitions. [2025-03-08 21:17:24,153 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 730 transitions. Word has length 70 [2025-03-08 21:17:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:24,153 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 730 transitions. [2025-03-08 21:17:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-08 21:17:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 730 transitions. [2025-03-08 21:17:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:17:24,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:24,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:24,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:17:24,155 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-08 21:17:24,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1772012149, now seen corresponding path program 1 times [2025-03-08 21:17:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560226002] [2025-03-08 21:17:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:24,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:17:24,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:17:24,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:24,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:24,505 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-08 21:17:24,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:24,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560226002] [2025-03-08 21:17:24,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560226002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:24,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:24,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 21:17:24,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78510413] [2025-03-08 21:17:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:24,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:17:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:24,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:17:24,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:17:24,507 INFO L87 Difference]: Start difference. First operand 532 states and 730 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-08 21:17:29,150 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-08 21:17:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:29,664 INFO L93 Difference]: Finished difference Result 1051 states and 1450 transitions. [2025-03-08 21:17:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2025-03-08 21:17:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:29,667 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 21:17:29,667 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 21:17:29,667 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-08 21:17:29,668 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 42 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:29,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3952 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1539 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-03-08 21:17:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 21:17:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 530. [2025-03-08 21:17:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 509 states have (on average 1.3791748526522594) internal successors, (702), 514 states have internal predecessors, (702), 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-08 21:17:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 727 transitions. [2025-03-08 21:17:29,679 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 727 transitions. Word has length 70 [2025-03-08 21:17:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:29,680 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 727 transitions. [2025-03-08 21:17:29,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-08 21:17:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 727 transitions. [2025-03-08 21:17:29,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:17:29,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:29,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:17:29,681 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-08 21:17:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2087456900, now seen corresponding path program 1 times [2025-03-08 21:17:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418761816] [2025-03-08 21:17:29,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:29,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:17:29,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:17:29,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:29,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:29,888 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-08 21:17:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418761816] [2025-03-08 21:17:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418761816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 21:17:29,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209395496] [2025-03-08 21:17:29,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:29,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:17:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:17:29,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 21:17:29,891 INFO L87 Difference]: Start difference. First operand 530 states and 727 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-08 21:17:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:30,597 INFO L93 Difference]: Finished difference Result 1043 states and 1438 transitions. [2025-03-08 21:17:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:30,597 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 70 [2025-03-08 21:17:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:30,599 INFO L225 Difference]: With dead ends: 1043 [2025-03-08 21:17:30,599 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 21:17:30,600 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-08 21:17:30,600 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 26 mSDsluCounter, 3991 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4530 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 21:17:30,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4530 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 21:17:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 21:17:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 536. [2025-03-08 21:17:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 515 states have (on average 1.3766990291262136) internal successors, (709), 520 states have internal predecessors, (709), 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-08 21:17:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 734 transitions. [2025-03-08 21:17:30,610 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 734 transitions. Word has length 70 [2025-03-08 21:17:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 734 transitions. [2025-03-08 21:17:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-08 21:17:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 734 transitions. [2025-03-08 21:17:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:17:30,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:30,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:30,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:17:30,611 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 21:17:30,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:30,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1754401810, now seen corresponding path program 1 times [2025-03-08 21:17:30,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:30,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522471032] [2025-03-08 21:17:30,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:30,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:30,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:17:30,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:17:30,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:30,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:30,766 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-08 21:17:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522471032] [2025-03-08 21:17:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522471032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:30,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 21:17:30,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382458073] [2025-03-08 21:17:30,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:30,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 21:17:30,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:30,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 21:17:30,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 21:17:30,767 INFO L87 Difference]: Start difference. First operand 536 states and 734 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-08 21:17:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 21:17:31,394 INFO L93 Difference]: Finished difference Result 1064 states and 1465 transitions. [2025-03-08 21:17:31,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 21:17:31,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 70 [2025-03-08 21:17:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 21:17:31,397 INFO L225 Difference]: With dead ends: 1064 [2025-03-08 21:17:31,397 INFO L226 Difference]: Without dead ends: 562 [2025-03-08 21:17:31,398 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-08 21:17:31,398 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 33 mSDsluCounter, 3029 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3578 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-08 21:17:31,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3578 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 21:17:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-08 21:17:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 533. [2025-03-08 21:17:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 512 states have (on average 1.37890625) internal successors, (706), 517 states have internal predecessors, (706), 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-08 21:17:31,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 731 transitions. [2025-03-08 21:17:31,409 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 731 transitions. Word has length 70 [2025-03-08 21:17:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 21:17:31,409 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 731 transitions. [2025-03-08 21:17:31,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-08 21:17:31,411 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 731 transitions. [2025-03-08 21:17:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 21:17:31,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 21:17:31,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:17:31,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:17:31,412 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-08 21:17:31,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:17:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1291735459, now seen corresponding path program 1 times [2025-03-08 21:17:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:17:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565756983] [2025-03-08 21:17:31,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:17:31,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:17:31,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 21:17:31,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 21:17:31,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:17:31,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:17:42,531 WARN L286 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 21:17:56,114 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-08 21:17:56,151 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-08 21:17:56,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:17:56,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565756983] [2025-03-08 21:17:56,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565756983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:17:56,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:17:56,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 21:17:56,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659986084] [2025-03-08 21:17:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:17:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 21:17:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:17:56,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 21:17:56,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-08 21:17:56,153 INFO L87 Difference]: Start difference. First operand 533 states and 731 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-08 21:18:00,710 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-08 21:18:04,715 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-08 21:18:08,719 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-08 21:18:12,722 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-08 21:18:14,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []