./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:21:01,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:21:01,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 10:21:01,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:21:01,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:21:01,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:21:01,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:21:01,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:21:01,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 10:21:01,366 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 10:21:01,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:21:01,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:21:01,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:21:01,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:21:01,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:21:01,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:21:01,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:21:01,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:01,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:21:01,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:21:01,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:21:01,370 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 -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2025-03-17 10:21:01,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:21:01,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:21:01,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:21:01,594 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:21:01,594 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:21:01,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2025-03-17 10:21:02,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3a03490/6aef93235be242968d349dfa5ce7227c/FLAG87b56350a [2025-03-17 10:21:02,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:21:02,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2025-03-17 10:21:03,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3a03490/6aef93235be242968d349dfa5ce7227c/FLAG87b56350a [2025-03-17 10:21:03,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b3a03490/6aef93235be242968d349dfa5ce7227c [2025-03-17 10:21:03,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:21:03,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:21:03,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:03,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:21:03,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:21:03,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:03,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35585358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03, skipping insertion in model container [2025-03-17 10:21:03,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:03,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:21:03,679 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_BER_test6-2.i[44118,44131] [2025-03-17 10:21:03,692 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_BER_test6-2.i[44660,44673] [2025-03-17 10:21:03,769 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_BER_test6-2.i[56247,56260] [2025-03-17 10:21:03,770 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_BER_test6-2.i[56368,56381] [2025-03-17 10:21:03,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:03,791 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:21:03,825 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_BER_test6-2.i[44118,44131] [2025-03-17 10:21:03,827 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_BER_test6-2.i[44660,44673] [2025-03-17 10:21:03,865 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_BER_test6-2.i[56247,56260] [2025-03-17 10:21:03,865 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_BER_test6-2.i[56368,56381] [2025-03-17 10:21:03,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:21:03,912 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:21:03,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03 WrapperNode [2025-03-17 10:21:03,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:21:03,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:03,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:21:03,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:21:03,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:03,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:03,982 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-03-17 10:21:03,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:21:03,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:21:03,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:21:03,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:21:03,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:03,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,079 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 270, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 57, 4]. [2025-03-17 10:21:04,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,133 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:21:04,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:21:04,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:21:04,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:21:04,147 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (1/1) ... [2025-03-17 10:21:04,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:21:04,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:21:04,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:21:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:21:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:21:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 10:21:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-03-17 10:21:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 10:21:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 10:21:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:21:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-03-17 10:21:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-03-17 10:21:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 10:21:04,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:21:04,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:21:04,402 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:21:04,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:21:04,458 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-03-17 10:21:05,439 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-03-17 10:21:05,439 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-03-17 10:21:05,439 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-17 10:21:05,508 INFO L? ?]: Removed 359 outVars from TransFormulas that were not future-live. [2025-03-17 10:21:05,508 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:21:05,555 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:21:05,555 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 10:21:05,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:05 BoogieIcfgContainer [2025-03-17 10:21:05,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:21:05,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:21:05,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:21:05,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:21:05,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:21:03" (1/3) ... [2025-03-17 10:21:05,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f27b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:05, skipping insertion in model container [2025-03-17 10:21:05,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:21:03" (2/3) ... [2025-03-17 10:21:05,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129f27b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:21:05, skipping insertion in model container [2025-03-17 10:21:05,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:21:05" (3/3) ... [2025-03-17 10:21:05,562 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2025-03-17 10:21:05,571 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:21:05,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test6-2.i that has 5 procedures, 463 locations, 1 initial locations, 39 loop locations, and 4 error locations. [2025-03-17 10:21:05,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:21:05,625 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;@449b82c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:21:05,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-17 10:21:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 439 states have (on average 1.5990888382687927) internal successors, (702), 443 states have internal predecessors, (702), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 10:21:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 10:21:05,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:05,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:05,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1956630904, now seen corresponding path program 1 times [2025-03-17 10:21:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:05,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334580639] [2025-03-17 10:21:05,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:05,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 10:21:05,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 10:21:05,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:05,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334580639] [2025-03-17 10:21:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334580639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:05,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:05,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:21:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503374627] [2025-03-17 10:21:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:05,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 10:21:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:05,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 10:21:05,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:05,831 INFO L87 Difference]: Start difference. First operand has 463 states, 439 states have (on average 1.5990888382687927) internal successors, (702), 443 states have internal predecessors, (702), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:05,947 INFO L93 Difference]: Finished difference Result 923 states and 1476 transitions. [2025-03-17 10:21:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 10:21:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 10:21:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:05,961 INFO L225 Difference]: With dead ends: 923 [2025-03-17 10:21:05,961 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 10:21:05,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 10:21:05,971 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:05,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 614 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 10:21:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-03-17 10:21:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.4344827586206896) internal successors, (624), 439 states have internal predecessors, (624), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:06,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 654 transitions. [2025-03-17 10:21:06,037 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 654 transitions. Word has length 7 [2025-03-17 10:21:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:06,038 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 654 transitions. [2025-03-17 10:21:06,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 654 transitions. [2025-03-17 10:21:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 10:21:06,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:06,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:21:06,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:06,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1918154703, now seen corresponding path program 1 times [2025-03-17 10:21:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:06,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229779491] [2025-03-17 10:21:06,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:06,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 10:21:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 10:21:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:06,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:06,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:06,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229779491] [2025-03-17 10:21:06,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229779491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:06,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:06,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:21:06,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271541515] [2025-03-17 10:21:06,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:06,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:06,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:06,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:06,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:06,200 INFO L87 Difference]: Start difference. First operand 458 states and 654 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:06,452 INFO L93 Difference]: Finished difference Result 1138 states and 1634 transitions. [2025-03-17 10:21:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 10:21:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:06,456 INFO L225 Difference]: With dead ends: 1138 [2025-03-17 10:21:06,457 INFO L226 Difference]: Without dead ends: 891 [2025-03-17 10:21:06,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:06,460 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 599 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:06,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1785 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-03-17 10:21:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 460. [2025-03-17 10:21:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4324942791762014) internal successors, (626), 441 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2025-03-17 10:21:06,497 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 9 [2025-03-17 10:21:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:06,498 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2025-03-17 10:21:06,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2025-03-17 10:21:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 10:21:06,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:06,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:06,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:21:06,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:06,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -826577293, now seen corresponding path program 1 times [2025-03-17 10:21:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:06,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505883092] [2025-03-17 10:21:06,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:21:06,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:21:06,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:06,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505883092] [2025-03-17 10:21:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505883092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301367155] [2025-03-17 10:21:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:06,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:06,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:06,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:06,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:06,775 INFO L87 Difference]: Start difference. First operand 460 states and 656 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:06,922 INFO L93 Difference]: Finished difference Result 920 states and 1312 transitions. [2025-03-17 10:21:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:06,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-17 10:21:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:06,927 INFO L225 Difference]: With dead ends: 920 [2025-03-17 10:21:06,927 INFO L226 Difference]: Without dead ends: 463 [2025-03-17 10:21:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:21:06,928 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 105 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:06,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1668 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 10:21:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-17 10:21:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 460. [2025-03-17 10:21:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4164759725400458) internal successors, (619), 441 states have internal predecessors, (619), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 649 transitions. [2025-03-17 10:21:06,944 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 649 transitions. Word has length 63 [2025-03-17 10:21:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:06,945 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 649 transitions. [2025-03-17 10:21:06,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 649 transitions. [2025-03-17 10:21:06,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 10:21:06,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:06,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:06,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:21:06,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:06,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1098398099, now seen corresponding path program 1 times [2025-03-17 10:21:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994247149] [2025-03-17 10:21:06,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:06,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 10:21:07,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 10:21:07,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:07,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:07,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994247149] [2025-03-17 10:21:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994247149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661858256] [2025-03-17 10:21:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:07,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:07,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:07,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:07,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:07,368 INFO L87 Difference]: Start difference. First operand 460 states and 649 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:07,919 INFO L93 Difference]: Finished difference Result 951 states and 1340 transitions. [2025-03-17 10:21:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:21:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-17 10:21:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:07,922 INFO L225 Difference]: With dead ends: 951 [2025-03-17 10:21:07,922 INFO L226 Difference]: Without dead ends: 494 [2025-03-17 10:21:07,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:07,925 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 14 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:07,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2475 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-17 10:21:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 487. [2025-03-17 10:21:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 464 states have (on average 1.4051724137931034) internal successors, (652), 468 states have internal predecessors, (652), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 682 transitions. [2025-03-17 10:21:07,945 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 682 transitions. Word has length 63 [2025-03-17 10:21:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:07,946 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 682 transitions. [2025-03-17 10:21:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 682 transitions. [2025-03-17 10:21:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:21:07,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:07,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:07,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:21:07,949 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:07,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:07,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1347471732, now seen corresponding path program 1 times [2025-03-17 10:21:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:07,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400289810] [2025-03-17 10:21:07,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:07,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:21:07,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:21:07,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:07,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:08,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:08,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400289810] [2025-03-17 10:21:08,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400289810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:08,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:08,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:21:08,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856113490] [2025-03-17 10:21:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:08,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:08,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:08,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:08,205 INFO L87 Difference]: Start difference. First operand 487 states and 682 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:08,701 INFO L93 Difference]: Finished difference Result 984 states and 1382 transitions. [2025-03-17 10:21:08,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:21:08,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-17 10:21:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:08,704 INFO L225 Difference]: With dead ends: 984 [2025-03-17 10:21:08,704 INFO L226 Difference]: Without dead ends: 500 [2025-03-17 10:21:08,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:08,709 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 15 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2973 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:08,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2973 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:08,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-17 10:21:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2025-03-17 10:21:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 474 states have (on average 1.4071729957805907) internal successors, (667), 478 states have internal predecessors, (667), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 697 transitions. [2025-03-17 10:21:08,730 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 697 transitions. Word has length 64 [2025-03-17 10:21:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 697 transitions. [2025-03-17 10:21:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 697 transitions. [2025-03-17 10:21:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 10:21:08,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:08,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:08,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:21:08,732 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1781484869, now seen corresponding path program 1 times [2025-03-17 10:21:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:08,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124001707] [2025-03-17 10:21:08,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 10:21:08,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 10:21:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:09,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124001707] [2025-03-17 10:21:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124001707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:21:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088530975] [2025-03-17 10:21:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:21:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:09,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:21:09,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:09,003 INFO L87 Difference]: Start difference. First operand 497 states and 697 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:09,223 INFO L93 Difference]: Finished difference Result 994 states and 1395 transitions. [2025-03-17 10:21:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:21:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-17 10:21:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:09,226 INFO L225 Difference]: With dead ends: 994 [2025-03-17 10:21:09,226 INFO L226 Difference]: Without dead ends: 500 [2025-03-17 10:21:09,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:21:09,228 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 17 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:09,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1621 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 10:21:09,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-17 10:21:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 497. [2025-03-17 10:21:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 474 states have (on average 1.4050632911392404) internal successors, (666), 478 states have internal predecessors, (666), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:09,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 696 transitions. [2025-03-17 10:21:09,247 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 696 transitions. Word has length 64 [2025-03-17 10:21:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:09,247 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 696 transitions. [2025-03-17 10:21:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 696 transitions. [2025-03-17 10:21:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:21:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:09,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:09,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:21:09,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash -727885484, now seen corresponding path program 1 times [2025-03-17 10:21:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710538473] [2025-03-17 10:21:09,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:21:09,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:21:09,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:09,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:09,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:09,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710538473] [2025-03-17 10:21:09,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710538473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:09,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:09,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:09,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535523085] [2025-03-17 10:21:09,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:09,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:09,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:09,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:09,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:09,605 INFO L87 Difference]: Start difference. First operand 497 states and 696 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:10,326 INFO L93 Difference]: Finished difference Result 1007 states and 1414 transitions. [2025-03-17 10:21:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:21:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:21:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:10,329 INFO L225 Difference]: With dead ends: 1007 [2025-03-17 10:21:10,329 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 10:21:10,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 10:21:10,330 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 33 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4038 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:10,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4038 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:21:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 10:21:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2025-03-17 10:21:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 484 states have (on average 1.4049586776859504) internal successors, (680), 488 states have internal predecessors, (680), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:10,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 710 transitions. [2025-03-17 10:21:10,345 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 710 transitions. Word has length 65 [2025-03-17 10:21:10,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:10,346 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 710 transitions. [2025-03-17 10:21:10,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:10,346 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 710 transitions. [2025-03-17 10:21:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:21:10,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:10,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:10,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:21:10,348 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:10,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash 191649680, now seen corresponding path program 1 times [2025-03-17 10:21:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032558763] [2025-03-17 10:21:10,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:10,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:21:10,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:21:10,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:10,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:10,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:10,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032558763] [2025-03-17 10:21:10,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032558763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:10,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:21:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8738902] [2025-03-17 10:21:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:10,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 10:21:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:10,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 10:21:10,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:21:10,692 INFO L87 Difference]: Start difference. First operand 507 states and 710 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:11,331 INFO L93 Difference]: Finished difference Result 1017 states and 1426 transitions. [2025-03-17 10:21:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 10:21:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:21:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:11,334 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 10:21:11,334 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 10:21:11,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:21:11,335 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 27 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3542 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:11,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3542 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:21:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 10:21:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2025-03-17 10:21:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 487 states have (on average 1.4024640657084189) internal successors, (683), 491 states have internal predecessors, (683), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 713 transitions. [2025-03-17 10:21:11,350 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 713 transitions. Word has length 65 [2025-03-17 10:21:11,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:11,350 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 713 transitions. [2025-03-17 10:21:11,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 713 transitions. [2025-03-17 10:21:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 10:21:11,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:11,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:21:11,351 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 939583984, now seen corresponding path program 1 times [2025-03-17 10:21:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094764633] [2025-03-17 10:21:11,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:11,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 10:21:11,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 10:21:11,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:11,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094764633] [2025-03-17 10:21:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094764633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:11,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:21:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279616451] [2025-03-17 10:21:11,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:11,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:21:11,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:11,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:21:11,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:11,550 INFO L87 Difference]: Start difference. First operand 510 states and 713 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:11,886 INFO L93 Difference]: Finished difference Result 1020 states and 1428 transitions. [2025-03-17 10:21:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:21:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 10:21:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:11,889 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 10:21:11,889 INFO L226 Difference]: Without dead ends: 513 [2025-03-17 10:21:11,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:21:11,892 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 8 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:11,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2054 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 10:21:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-03-17 10:21:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2025-03-17 10:21:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 490 states have (on average 1.4) internal successors, (686), 494 states have internal predecessors, (686), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 716 transitions. [2025-03-17 10:21:11,907 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 716 transitions. Word has length 65 [2025-03-17 10:21:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:11,907 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 716 transitions. [2025-03-17 10:21:11,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 716 transitions. [2025-03-17 10:21:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:21:11,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:11,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:21:11,909 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1226594146, now seen corresponding path program 1 times [2025-03-17 10:21:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312861317] [2025-03-17 10:21:11,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:11,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:21:11,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:21:11,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:11,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312861317] [2025-03-17 10:21:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312861317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:12,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:12,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 10:21:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143344897] [2025-03-17 10:21:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:12,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:12,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:12,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:12,340 INFO L87 Difference]: Start difference. First operand 513 states and 716 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:13,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:13,333 INFO L93 Difference]: Finished difference Result 1512 states and 2123 transitions. [2025-03-17 10:21:13,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 10:21:13,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-17 10:21:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:13,338 INFO L225 Difference]: With dead ends: 1512 [2025-03-17 10:21:13,338 INFO L226 Difference]: Without dead ends: 1002 [2025-03-17 10:21:13,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-17 10:21:13,340 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 903 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:13,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 3285 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 10:21:13,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-17 10:21:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 543. [2025-03-17 10:21:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 520 states have (on average 1.3865384615384615) internal successors, (721), 524 states have internal predecessors, (721), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 751 transitions. [2025-03-17 10:21:13,362 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 751 transitions. Word has length 66 [2025-03-17 10:21:13,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:13,362 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 751 transitions. [2025-03-17 10:21:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:13,362 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 751 transitions. [2025-03-17 10:21:13,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-17 10:21:13,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:13,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:13,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:21:13,363 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:13,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2127011312, now seen corresponding path program 1 times [2025-03-17 10:21:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143000912] [2025-03-17 10:21:13,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:13,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 10:21:13,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 10:21:13,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:13,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:13,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143000912] [2025-03-17 10:21:13,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143000912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:13,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:13,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:21:13,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931810480] [2025-03-17 10:21:13,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:13,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:13,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:13,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:13,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:13,551 INFO L87 Difference]: Start difference. First operand 543 states and 751 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:14,076 INFO L93 Difference]: Finished difference Result 1060 states and 1475 transitions. [2025-03-17 10:21:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:21:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-17 10:21:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:14,079 INFO L225 Difference]: With dead ends: 1060 [2025-03-17 10:21:14,079 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 10:21:14,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 10:21:14,080 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 12 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2981 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:14,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2981 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 10:21:14,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 543. [2025-03-17 10:21:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 520 states have (on average 1.3865384615384615) internal successors, (721), 524 states have internal predecessors, (721), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 751 transitions. [2025-03-17 10:21:14,093 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 751 transitions. Word has length 66 [2025-03-17 10:21:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:14,093 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 751 transitions. [2025-03-17 10:21:14,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:14,094 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 751 transitions. [2025-03-17 10:21:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 10:21:14,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:14,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:14,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:21:14,095 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:14,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -732190697, now seen corresponding path program 1 times [2025-03-17 10:21:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343996567] [2025-03-17 10:21:14,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:14,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 10:21:14,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 10:21:14,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:14,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:14,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:14,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343996567] [2025-03-17 10:21:14,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343996567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:14,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:14,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:14,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401506964] [2025-03-17 10:21:14,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:14,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:14,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:14,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:14,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:14,295 INFO L87 Difference]: Start difference. First operand 543 states and 751 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:14,795 INFO L93 Difference]: Finished difference Result 1066 states and 1482 transitions. [2025-03-17 10:21:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 10:21:14,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-17 10:21:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:14,797 INFO L225 Difference]: With dead ends: 1066 [2025-03-17 10:21:14,797 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 10:21:14,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:14,799 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 20 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3562 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:14,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3562 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 10:21:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 546. [2025-03-17 10:21:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 523 states have (on average 1.3862332695984703) internal successors, (725), 527 states have internal predecessors, (725), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 755 transitions. [2025-03-17 10:21:14,811 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 755 transitions. Word has length 67 [2025-03-17 10:21:14,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:14,813 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 755 transitions. [2025-03-17 10:21:14,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 755 transitions. [2025-03-17 10:21:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-17 10:21:14,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:14,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:14,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:21:14,815 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:14,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -393093520, now seen corresponding path program 1 times [2025-03-17 10:21:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648280741] [2025-03-17 10:21:14,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:14,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 10:21:14,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 10:21:14,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:15,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648280741] [2025-03-17 10:21:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648280741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:15,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858249036] [2025-03-17 10:21:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:15,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:15,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:15,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:15,036 INFO L87 Difference]: Start difference. First operand 546 states and 755 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:15,773 INFO L93 Difference]: Finished difference Result 1087 states and 1511 transitions. [2025-03-17 10:21:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-17 10:21:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:15,776 INFO L225 Difference]: With dead ends: 1087 [2025-03-17 10:21:15,776 INFO L226 Difference]: Without dead ends: 574 [2025-03-17 10:21:15,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:21:15,778 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 37 mSDsluCounter, 3372 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:15,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3970 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:21:15,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-17 10:21:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 546. [2025-03-17 10:21:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 523 states have (on average 1.3862332695984703) internal successors, (725), 527 states have internal predecessors, (725), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 755 transitions. [2025-03-17 10:21:15,794 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 755 transitions. Word has length 67 [2025-03-17 10:21:15,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:15,795 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 755 transitions. [2025-03-17 10:21:15,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 755 transitions. [2025-03-17 10:21:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:21:15,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:15,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:15,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:21:15,797 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:15,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:15,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1082343952, now seen corresponding path program 1 times [2025-03-17 10:21:15,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245369427] [2025-03-17 10:21:15,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:15,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:21:15,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:21:15,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:15,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:16,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245369427] [2025-03-17 10:21:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245369427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:21:16,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460394966] [2025-03-17 10:21:16,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:16,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:21:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:16,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:21:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:21:16,042 INFO L87 Difference]: Start difference. First operand 546 states and 755 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:16,660 INFO L93 Difference]: Finished difference Result 1075 states and 1495 transitions. [2025-03-17 10:21:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:21:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:16,663 INFO L225 Difference]: With dead ends: 1075 [2025-03-17 10:21:16,663 INFO L226 Difference]: Without dead ends: 562 [2025-03-17 10:21:16,665 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-17 10:21:16,665 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 23 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4022 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:16,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4022 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:21:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-17 10:21:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 556. [2025-03-17 10:21:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 533 states have (on average 1.3827392120075046) internal successors, (737), 537 states have internal predecessors, (737), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 767 transitions. [2025-03-17 10:21:16,680 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 767 transitions. Word has length 68 [2025-03-17 10:21:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:16,680 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 767 transitions. [2025-03-17 10:21:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 767 transitions. [2025-03-17 10:21:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:21:16,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:16,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:16,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:21:16,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:16,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2075829225, now seen corresponding path program 1 times [2025-03-17 10:21:16,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:16,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638849693] [2025-03-17 10:21:16,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:16,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:21:16,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:21:16,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:16,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:16,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638849693] [2025-03-17 10:21:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638849693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:16,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:21:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430138916] [2025-03-17 10:21:16,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:16,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:16,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:16,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:16,939 INFO L87 Difference]: Start difference. First operand 556 states and 767 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:17,429 INFO L93 Difference]: Finished difference Result 1084 states and 1502 transitions. [2025-03-17 10:21:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:21:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:21:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:17,432 INFO L225 Difference]: With dead ends: 1084 [2025-03-17 10:21:17,433 INFO L226 Difference]: Without dead ends: 561 [2025-03-17 10:21:17,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:17,434 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 11 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:17,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3011 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-17 10:21:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 556. [2025-03-17 10:21:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 533 states have (on average 1.3808630393996248) internal successors, (736), 537 states have internal predecessors, (736), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 766 transitions. [2025-03-17 10:21:17,448 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 766 transitions. Word has length 68 [2025-03-17 10:21:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 766 transitions. [2025-03-17 10:21:17,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 766 transitions. [2025-03-17 10:21:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:21:17,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:17,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:17,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:21:17,450 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:17,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1156294061, now seen corresponding path program 1 times [2025-03-17 10:21:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:17,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266467107] [2025-03-17 10:21:17,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:17,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:21:17,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:21:17,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:17,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:17,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266467107] [2025-03-17 10:21:17,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266467107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:17,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:17,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 10:21:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739405931] [2025-03-17 10:21:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 10:21:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:17,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 10:21:17,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:17,617 INFO L87 Difference]: Start difference. First operand 556 states and 766 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:18,139 INFO L93 Difference]: Finished difference Result 1084 states and 1502 transitions. [2025-03-17 10:21:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:21:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:21:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:18,143 INFO L225 Difference]: With dead ends: 1084 [2025-03-17 10:21:18,143 INFO L226 Difference]: Without dead ends: 561 [2025-03-17 10:21:18,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 10:21:18,145 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 8 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:18,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2947 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 10:21:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-17 10:21:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 560. [2025-03-17 10:21:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 537 states have (on average 1.3798882681564246) internal successors, (741), 541 states have internal predecessors, (741), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 771 transitions. [2025-03-17 10:21:18,159 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 771 transitions. Word has length 68 [2025-03-17 10:21:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 771 transitions. [2025-03-17 10:21:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 771 transitions. [2025-03-17 10:21:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 10:21:18,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:18,161 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:21:18,161 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 839733943, now seen corresponding path program 1 times [2025-03-17 10:21:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478892685] [2025-03-17 10:21:18,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:18,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:21:18,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:21:18,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:18,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478892685] [2025-03-17 10:21:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478892685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:18,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:18,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:21:18,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558801622] [2025-03-17 10:21:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:18,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:21:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:18,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:21:18,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:21:18,380 INFO L87 Difference]: Start difference. First operand 560 states and 771 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:19,119 INFO L93 Difference]: Finished difference Result 1104 states and 1528 transitions. [2025-03-17 10:21:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-17 10:21:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:19,122 INFO L225 Difference]: With dead ends: 1104 [2025-03-17 10:21:19,122 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 10:21:19,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:21:19,123 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 17 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:19,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4449 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:21:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 10:21:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 563. [2025-03-17 10:21:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 540 states have (on average 1.3796296296296295) internal successors, (745), 544 states have internal predecessors, (745), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 775 transitions. [2025-03-17 10:21:19,139 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 775 transitions. Word has length 68 [2025-03-17 10:21:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:19,140 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 775 transitions. [2025-03-17 10:21:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 775 transitions. [2025-03-17 10:21:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:21:19,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:19,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:19,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:21:19,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash 807210512, now seen corresponding path program 1 times [2025-03-17 10:21:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173215684] [2025-03-17 10:21:19,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:19,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:19,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:21:19,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:21:19,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:19,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:19,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173215684] [2025-03-17 10:21:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173215684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 10:21:19,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212999189] [2025-03-17 10:21:19,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:19,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 10:21:19,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:19,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 10:21:19,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 10:21:19,442 INFO L87 Difference]: Start difference. First operand 563 states and 775 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:20,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:20,068 INFO L93 Difference]: Finished difference Result 1105 states and 1530 transitions. [2025-03-17 10:21:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 10:21:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:20,071 INFO L225 Difference]: With dead ends: 1105 [2025-03-17 10:21:20,071 INFO L226 Difference]: Without dead ends: 575 [2025-03-17 10:21:20,072 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-17 10:21:20,072 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 13 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3958 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:20,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3958 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 10:21:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-17 10:21:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 567. [2025-03-17 10:21:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 544 states have (on average 1.3786764705882353) internal successors, (750), 548 states have internal predecessors, (750), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 780 transitions. [2025-03-17 10:21:20,084 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 780 transitions. Word has length 69 [2025-03-17 10:21:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:20,084 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 780 transitions. [2025-03-17 10:21:20,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 780 transitions. [2025-03-17 10:21:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:21:20,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:20,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:20,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:21:20,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 903655021, now seen corresponding path program 1 times [2025-03-17 10:21:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699134891] [2025-03-17 10:21:20,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:21:20,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:21:20,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:20,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699134891] [2025-03-17 10:21:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699134891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 10:21:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357818048] [2025-03-17 10:21:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:20,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 10:21:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:20,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 10:21:20,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 10:21:20,262 INFO L87 Difference]: Start difference. First operand 567 states and 780 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:20,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 10:21:20,967 INFO L93 Difference]: Finished difference Result 1127 states and 1558 transitions. [2025-03-17 10:21:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 10:21:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-17 10:21:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 10:21:20,970 INFO L225 Difference]: With dead ends: 1127 [2025-03-17 10:21:20,971 INFO L226 Difference]: Without dead ends: 593 [2025-03-17 10:21:20,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 10:21:20,972 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 33 mSDsluCounter, 3372 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 10:21:20,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3970 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 10:21:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-17 10:21:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 564. [2025-03-17 10:21:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 541 states have (on average 1.3807763401109057) internal successors, (747), 545 states have internal predecessors, (747), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 10:21:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 777 transitions. [2025-03-17 10:21:20,984 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 777 transitions. Word has length 69 [2025-03-17 10:21:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 10:21:20,984 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 777 transitions. [2025-03-17 10:21:20,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 777 transitions. [2025-03-17 10:21:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 10:21:20,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 10:21:20,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:21:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:21:20,986 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-17 10:21:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:21:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash -63177157, now seen corresponding path program 1 times [2025-03-17 10:21:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:21:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138737317] [2025-03-17 10:21:20,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:21:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:21:21,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 10:21:21,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 10:21:21,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:21:21,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:21:39,291 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-03-17 10:21:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:21:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:21:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138737317] [2025-03-17 10:21:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138737317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:21:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:21:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 10:21:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895790183] [2025-03-17 10:21:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:21:39,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 10:21:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:21:39,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 10:21:39,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-03-17 10:21:39,343 INFO L87 Difference]: Start difference. First operand 564 states and 777 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:21:42,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:21:46,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:21:50,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:21:54,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:21:59,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:03,016 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-03-17 10:22:07,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:09,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:21,043 WARN L286 SmtUtils]: Spent 11.91s on a formula simplification. DAG size of input: 42 DAG size of output: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 10:22:23,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:27,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:31,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 10:22:36,231 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 []