./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:05:30,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:05:30,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 06:05:30,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:05:30,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:05:30,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:05:30,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:05:30,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:05:30,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 06:05:30,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 06:05:30,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:05:30,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:05:30,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:05:30,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:05:30,103 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:05:30,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:05:30,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:05:30,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:05:30,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:30,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:05:30,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:05:30,106 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 -> b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 [2025-03-04 06:05:30,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:05:30,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:05:30,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:05:30,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:05:30,341 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:05:30,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2025-03-04 06:05:31,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a2ea09b/e5b10c922f8a48cf8871b7be99c0fc9e/FLAGa6878f22a [2025-03-04 06:05:31,827 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:05:31,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2025-03-04 06:05:31,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a2ea09b/e5b10c922f8a48cf8871b7be99c0fc9e/FLAGa6878f22a [2025-03-04 06:05:32,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a2ea09b/e5b10c922f8a48cf8871b7be99c0fc9e [2025-03-04 06:05:32,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:05:32,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:05:32,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:32,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:05:32,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:05:32,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179209d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32, skipping insertion in model container [2025-03-04 06:05:32,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,102 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:05:32,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2025-03-04 06:05:32,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2025-03-04 06:05:32,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:32,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:05:32,484 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[33021,33034] [2025-03-04 06:05:32,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i[45234,45247] [2025-03-04 06:05:32,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:05:32,575 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:05:32,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32 WrapperNode [2025-03-04 06:05:32,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:05:32,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:32,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:05:32,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:05:32,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,636 INFO L138 Inliner]: procedures = 177, calls = 289, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1381 [2025-03-04 06:05:32,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:05:32,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:05:32,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:05:32,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:05:32,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,710 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-03-04 06:05:32,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:05:32,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:05:32,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:05:32,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:05:32,765 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (1/1) ... [2025-03-04 06:05:32,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:05:32,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:32,791 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-04 06:05:32,794 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-04 06:05:32,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 06:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 06:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 06:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 06:05:32,813 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 06:05:32,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 06:05:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 06:05:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 06:05:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-03-04 06:05:32,814 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 06:05:32,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 06:05:32,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 06:05:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 06:05:32,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:05:32,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:05:32,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:05:32,994 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:05:34,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: 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-04 06:05:34,152 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2025-03-04 06:05:34,152 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:05:34,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:05:34,200 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 06:05:34,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:34 BoogieIcfgContainer [2025-03-04 06:05:34,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:05:34,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:05:34,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:05:34,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:05:34,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:05:32" (1/3) ... [2025-03-04 06:05:34,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64432334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:34, skipping insertion in model container [2025-03-04 06:05:34,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:05:32" (2/3) ... [2025-03-04 06:05:34,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64432334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:05:34, skipping insertion in model container [2025-03-04 06:05:34,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:05:34" (3/3) ... [2025-03-04 06:05:34,210 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-1.i [2025-03-04 06:05:34,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:05:34,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test8-1.i that has 6 procedures, 438 locations, 1 initial locations, 35 loop locations, and 2 error locations. [2025-03-04 06:05:34,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:05:34,275 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;@4d206d1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:05:34,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 06:05:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 430 states, 404 states have (on average 1.6262376237623761) internal successors, (657), 421 states have internal predecessors, (657), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 06:05:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 06:05:34,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:34,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:34,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash 981001401, now seen corresponding path program 1 times [2025-03-04 06:05:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769735048] [2025-03-04 06:05:34,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:34,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 06:05:34,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 06:05:34,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:34,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:34,386 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-04 06:05:34,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:34,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769735048] [2025-03-04 06:05:34,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769735048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:34,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:34,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:05:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999933238] [2025-03-04 06:05:34,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:34,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 06:05:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:34,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 06:05:34,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 06:05:34,407 INFO L87 Difference]: Start difference. First operand has 430 states, 404 states have (on average 1.6262376237623761) internal successors, (657), 421 states have internal predecessors, (657), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-04 06:05:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:34,510 INFO L93 Difference]: Finished difference Result 858 states and 1409 transitions. [2025-03-04 06:05:34,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 06:05:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-04 06:05:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:34,522 INFO L225 Difference]: With dead ends: 858 [2025-03-04 06:05:34,522 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 06:05:34,525 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-04 06:05:34,529 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:34,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 591 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:34,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 06:05:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-03-04 06:05:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 401 states have (on average 1.4688279301745637) internal successors, (589), 417 states have internal predecessors, (589), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 06:05:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 629 transitions. [2025-03-04 06:05:34,575 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 629 transitions. Word has length 9 [2025-03-04 06:05:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 629 transitions. [2025-03-04 06:05:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-04 06:05:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 629 transitions. [2025-03-04 06:05:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 06:05:34,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:34,578 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] [2025-03-04 06:05:34,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:05:34,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:34,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 958741725, now seen corresponding path program 1 times [2025-03-04 06:05:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:34,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536644300] [2025-03-04 06:05:34,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:34,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 06:05:34,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 06:05:34,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:34,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:34,967 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-04 06:05:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536644300] [2025-03-04 06:05:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536644300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769932026] [2025-03-04 06:05:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:34,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:34,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:34,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:34,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:34,974 INFO L87 Difference]: Start difference. First operand 426 states and 629 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-04 06:05:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:35,232 INFO L93 Difference]: Finished difference Result 1031 states and 1523 transitions. [2025-03-04 06:05:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:35,233 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), 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 62 [2025-03-04 06:05:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:35,238 INFO L225 Difference]: With dead ends: 1031 [2025-03-04 06:05:35,238 INFO L226 Difference]: Without dead ends: 805 [2025-03-04 06:05:35,240 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-04 06:05:35,241 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 541 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:35,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1696 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:05:35,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2025-03-04 06:05:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 428. [2025-03-04 06:05:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 403 states have (on average 1.466501240694789) internal successors, (591), 419 states have internal predecessors, (591), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 06:05:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 631 transitions. [2025-03-04 06:05:35,276 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 631 transitions. Word has length 62 [2025-03-04 06:05:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:35,276 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 631 transitions. [2025-03-04 06:05:35,278 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), 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-04 06:05:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2025-03-04 06:05:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 06:05:35,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:35,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:05:35,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash -884869056, now seen corresponding path program 1 times [2025-03-04 06:05:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664228461] [2025-03-04 06:05:35,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:35,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:05:35,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:05:35,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:35,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:35,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-04 06:05:35,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:35,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664228461] [2025-03-04 06:05:35,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664228461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:35,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:35,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:05:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139547321] [2025-03-04 06:05:35,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:35,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:35,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:35,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:05:35,549 INFO L87 Difference]: Start difference. First operand 428 states and 631 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 06:05:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:35,694 INFO L93 Difference]: Finished difference Result 810 states and 1192 transitions. [2025-03-04 06:05:35,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:05:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 83 [2025-03-04 06:05:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:35,699 INFO L225 Difference]: With dead ends: 810 [2025-03-04 06:05:35,699 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 06:05:35,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:05:35,701 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 33 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:35,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1463 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 06:05:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-04 06:05:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.4238227146814404) internal successors, (514), 377 states have internal predecessors, (514), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 06:05:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 554 transitions. [2025-03-04 06:05:35,722 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 554 transitions. Word has length 83 [2025-03-04 06:05:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 554 transitions. [2025-03-04 06:05:35,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-04 06:05:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 554 transitions. [2025-03-04 06:05:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 06:05:35,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:35,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:35,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:05:35,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -714289065, now seen corresponding path program 1 times [2025-03-04 06:05:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:35,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400609349] [2025-03-04 06:05:35,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:35,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:05:35,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:05:35,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:35,889 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-04 06:05:35,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:35,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400609349] [2025-03-04 06:05:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400609349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:35,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:05:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648431386] [2025-03-04 06:05:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:35,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:05:35,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:35,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:05:35,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:35,893 INFO L87 Difference]: Start difference. First operand 386 states and 554 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:05:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:35,993 INFO L93 Difference]: Finished difference Result 768 states and 1104 transitions. [2025-03-04 06:05:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:05:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 83 [2025-03-04 06:05:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:35,996 INFO L225 Difference]: With dead ends: 768 [2025-03-04 06:05:35,996 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 06:05:35,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:35,997 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 2 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:35,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 992 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 06:05:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-04 06:05:36,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 361 states have (on average 1.4155124653739612) internal successors, (511), 377 states have internal predecessors, (511), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 06:05:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 551 transitions. [2025-03-04 06:05:36,015 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 551 transitions. Word has length 83 [2025-03-04 06:05:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:36,015 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 551 transitions. [2025-03-04 06:05:36,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:05:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 551 transitions. [2025-03-04 06:05:36,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 06:05:36,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:36,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:05:36,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:36,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash 757983162, now seen corresponding path program 1 times [2025-03-04 06:05:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075735157] [2025-03-04 06:05:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:36,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:05:36,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:05:36,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:36,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:36,185 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-04 06:05:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075735157] [2025-03-04 06:05:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075735157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:05:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879421960] [2025-03-04 06:05:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:05:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:05:36,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:36,186 INFO L87 Difference]: Start difference. First operand 386 states and 551 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:05:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:36,358 INFO L93 Difference]: Finished difference Result 1016 states and 1453 transitions. [2025-03-04 06:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:05:36,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 83 [2025-03-04 06:05:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:36,361 INFO L225 Difference]: With dead ends: 1016 [2025-03-04 06:05:36,363 INFO L226 Difference]: Without dead ends: 634 [2025-03-04 06:05:36,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:05:36,365 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 293 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:36,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1171 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-03-04 06:05:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 631. [2025-03-04 06:05:36,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.421487603305785) internal successors, (860), 621 states have internal predecessors, (860), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:05:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 902 transitions. [2025-03-04 06:05:36,390 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 902 transitions. Word has length 83 [2025-03-04 06:05:36,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:36,390 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 902 transitions. [2025-03-04 06:05:36,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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-04 06:05:36,390 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 902 transitions. [2025-03-04 06:05:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 06:05:36,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:36,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:05:36,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1806928326, now seen corresponding path program 1 times [2025-03-04 06:05:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:36,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712076713] [2025-03-04 06:05:36,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:36,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:36,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:05:36,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:05:36,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:05:36,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712076713] [2025-03-04 06:05:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712076713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:36,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285042487] [2025-03-04 06:05:36,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:36,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:36,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:36,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:05:36,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:05:37,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:05:37,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:37,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:37,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 06:05:37,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:37,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:05:37,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 06:05:37,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:05:37,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-03-04 06:05:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:37,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:05:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285042487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:05:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 06:05:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736135736] [2025-03-04 06:05:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:37,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:05:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:37,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:05:37,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:05:37,889 INFO L87 Difference]: Start difference. First operand 631 states and 902 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:39,486 INFO L93 Difference]: Finished difference Result 1503 states and 2160 transitions. [2025-03-04 06:05:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:05:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-03-04 06:05:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:39,492 INFO L225 Difference]: With dead ends: 1503 [2025-03-04 06:05:39,492 INFO L226 Difference]: Without dead ends: 914 [2025-03-04 06:05:39,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:05:39,495 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 573 mSDsluCounter, 2921 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 3405 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:39,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 3405 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 06:05:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-04 06:05:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 631. [2025-03-04 06:05:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 605 states have (on average 1.4198347107438016) internal successors, (859), 621 states have internal predecessors, (859), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:05:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 901 transitions. [2025-03-04 06:05:39,523 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 901 transitions. Word has length 98 [2025-03-04 06:05:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 901 transitions. [2025-03-04 06:05:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 901 transitions. [2025-03-04 06:05:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 06:05:39,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:39,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:39,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:05:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 06:05:39,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -130687460, now seen corresponding path program 1 times [2025-03-04 06:05:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:39,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015886061] [2025-03-04 06:05:39,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:39,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:39,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:05:39,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:05:39,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:39,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:05:39,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015886061] [2025-03-04 06:05:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015886061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055241682] [2025-03-04 06:05:39,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:39,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:39,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:39,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:05:40,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 06:05:40,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 06:05:40,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:40,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:40,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 06:05:40,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:40,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 06:05:40,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-03-04 06:05:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:40,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:05:40,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055241682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:40,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:05:40,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 06:05:40,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197667121] [2025-03-04 06:05:40,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:40,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 06:05:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:40,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 06:05:40,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 06:05:40,879 INFO L87 Difference]: Start difference. First operand 631 states and 901 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:42,357 INFO L93 Difference]: Finished difference Result 1514 states and 2176 transitions. [2025-03-04 06:05:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 06:05:42,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2025-03-04 06:05:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:42,363 INFO L225 Difference]: With dead ends: 1514 [2025-03-04 06:05:42,363 INFO L226 Difference]: Without dead ends: 930 [2025-03-04 06:05:42,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:05:42,366 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 654 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:42,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2687 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 06:05:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-04 06:05:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 643. [2025-03-04 06:05:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 617 states have (on average 1.4181523500810373) internal successors, (875), 633 states have internal predecessors, (875), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:05:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 917 transitions. [2025-03-04 06:05:42,384 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 917 transitions. Word has length 99 [2025-03-04 06:05:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:42,385 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 917 transitions. [2025-03-04 06:05:42,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 917 transitions. [2025-03-04 06:05:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 06:05:42,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:42,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:42,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:05:42,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 06:05:42,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:42,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1004141801, now seen corresponding path program 1 times [2025-03-04 06:05:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:42,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556418979] [2025-03-04 06:05:42,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:42,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:05:42,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:05:42,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:42,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556418979] [2025-03-04 06:05:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556418979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:42,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 06:05:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814745905] [2025-03-04 06:05:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:42,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:05:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:42,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:05:42,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:05:42,856 INFO L87 Difference]: Start difference. First operand 643 states and 917 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:43,117 INFO L93 Difference]: Finished difference Result 1243 states and 1789 transitions. [2025-03-04 06:05:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:05:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-04 06:05:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:43,120 INFO L225 Difference]: With dead ends: 1243 [2025-03-04 06:05:43,120 INFO L226 Difference]: Without dead ends: 649 [2025-03-04 06:05:43,122 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-04 06:05:43,122 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 9 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:43,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2257 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 06:05:43,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-04 06:05:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-04 06:05:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 623 states have (on average 1.4141252006420546) internal successors, (881), 639 states have internal predecessors, (881), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:05:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 923 transitions. [2025-03-04 06:05:43,137 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 923 transitions. Word has length 100 [2025-03-04 06:05:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 923 transitions. [2025-03-04 06:05:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 923 transitions. [2025-03-04 06:05:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 06:05:43,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:43,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:43,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:05:43,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:43,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1802603475, now seen corresponding path program 1 times [2025-03-04 06:05:43,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:43,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25163965] [2025-03-04 06:05:43,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:43,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:05:43,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:05:43,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:43,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:43,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:43,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25163965] [2025-03-04 06:05:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25163965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:43,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467126106] [2025-03-04 06:05:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:43,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:43,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:43,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:43,408 INFO L87 Difference]: Start difference. First operand 649 states and 923 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:43,713 INFO L93 Difference]: Finished difference Result 1249 states and 1793 transitions. [2025-03-04 06:05:43,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:43,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-03-04 06:05:43,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:43,716 INFO L225 Difference]: With dead ends: 1249 [2025-03-04 06:05:43,716 INFO L226 Difference]: Without dead ends: 659 [2025-03-04 06:05:43,717 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-04 06:05:43,718 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 14 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:43,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2684 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-03-04 06:05:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2025-03-04 06:05:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 631 states have (on average 1.4120443740095088) internal successors, (891), 647 states have internal predecessors, (891), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 06:05:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 933 transitions. [2025-03-04 06:05:43,734 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 933 transitions. Word has length 100 [2025-03-04 06:05:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:43,734 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 933 transitions. [2025-03-04 06:05:43,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 933 transitions. [2025-03-04 06:05:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 06:05:43,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:43,735 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:43,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:05:43,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1553465006, now seen corresponding path program 1 times [2025-03-04 06:05:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:43,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36182457] [2025-03-04 06:05:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:43,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:05:43,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:05:43,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:43,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:05:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36182457] [2025-03-04 06:05:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36182457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61626040] [2025-03-04 06:05:44,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:44,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:44,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:05:44,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 06:05:44,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 06:05:44,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:44,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 06:05:44,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:05:44,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:05:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61626040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:05:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 06:05:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553087530] [2025-03-04 06:05:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:05:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:05:44,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:05:44,335 INFO L87 Difference]: Start difference. First operand 657 states and 933 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 06:05:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:44,421 INFO L93 Difference]: Finished difference Result 1217 states and 1743 transitions. [2025-03-04 06:05:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:05:44,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 101 [2025-03-04 06:05:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:44,425 INFO L225 Difference]: With dead ends: 1217 [2025-03-04 06:05:44,425 INFO L226 Difference]: Without dead ends: 660 [2025-03-04 06:05:44,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:05:44,427 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 0 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:44,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1526 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-04 06:05:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-03-04 06:05:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 633 states have (on average 1.4123222748815165) internal successors, (894), 650 states have internal predecessors, (894), 21 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 937 transitions. [2025-03-04 06:05:44,446 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 937 transitions. Word has length 101 [2025-03-04 06:05:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:44,446 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 937 transitions. [2025-03-04 06:05:44,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 06:05:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 937 transitions. [2025-03-04 06:05:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 06:05:44,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:44,448 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:44,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:05:44,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:44,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:44,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1308960334, now seen corresponding path program 1 times [2025-03-04 06:05:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:44,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143100108] [2025-03-04 06:05:44,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:44,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:05:44,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:05:44,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:44,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:05:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143100108] [2025-03-04 06:05:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143100108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411394385] [2025-03-04 06:05:44,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:44,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:44,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:44,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:05:45,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 06:05:45,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 06:05:45,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:45,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:45,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 06:05:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:05:45,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:05:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 06:05:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411394385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:05:45,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:05:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:05:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093647543] [2025-03-04 06:05:45,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:05:45,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:45,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:45,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:45,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:45,724 INFO L87 Difference]: Start difference. First operand 660 states and 937 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 06:05:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:45,938 INFO L93 Difference]: Finished difference Result 1231 states and 1764 transitions. [2025-03-04 06:05:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 06:05:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2025-03-04 06:05:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:45,942 INFO L225 Difference]: With dead ends: 1231 [2025-03-04 06:05:45,942 INFO L226 Difference]: Without dead ends: 671 [2025-03-04 06:05:45,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:05:45,944 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 5 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2042 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:45,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2042 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 06:05:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-04 06:05:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 669. [2025-03-04 06:05:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 641 states have (on average 1.4165366614664587) internal successors, (908), 658 states have internal predecessors, (908), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 951 transitions. [2025-03-04 06:05:45,965 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 951 transitions. Word has length 103 [2025-03-04 06:05:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 951 transitions. [2025-03-04 06:05:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 06:05:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 951 transitions. [2025-03-04 06:05:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 06:05:45,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:45,967 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:45,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:05:46,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:46,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -334349714, now seen corresponding path program 2 times [2025-03-04 06:05:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131903868] [2025-03-04 06:05:46,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:05:46,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:46,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-03-04 06:05:46,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 107 statements. [2025-03-04 06:05:46,230 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:05:46,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 06:05:46,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:46,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131903868] [2025-03-04 06:05:46,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131903868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:46,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:46,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942293512] [2025-03-04 06:05:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:46,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:46,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:46,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:46,426 INFO L87 Difference]: Start difference. First operand 669 states and 951 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:46,767 INFO L93 Difference]: Finished difference Result 1285 states and 1844 transitions. [2025-03-04 06:05:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:46,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-03-04 06:05:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:46,770 INFO L225 Difference]: With dead ends: 1285 [2025-03-04 06:05:46,770 INFO L226 Difference]: Without dead ends: 679 [2025-03-04 06:05:46,771 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-04 06:05:46,772 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 13 mSDsluCounter, 2190 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:46,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2690 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:46,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-04 06:05:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 669. [2025-03-04 06:05:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 641 states have (on average 1.4165366614664587) internal successors, (908), 658 states have internal predecessors, (908), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 951 transitions. [2025-03-04 06:05:46,789 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 951 transitions. Word has length 107 [2025-03-04 06:05:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:46,789 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 951 transitions. [2025-03-04 06:05:46,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 951 transitions. [2025-03-04 06:05:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 06:05:46,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:46,790 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:46,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:05:46,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:46,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 485303061, now seen corresponding path program 1 times [2025-03-04 06:05:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:46,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339682893] [2025-03-04 06:05:46,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:05:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:05:47,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:47,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339682893] [2025-03-04 06:05:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339682893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513505053] [2025-03-04 06:05:47,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:47,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:47,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:47,303 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:47,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 06:05:47,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:05:47,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:05:47,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:47,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:47,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:05:47,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 06:05:47,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:05:47,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513505053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:47,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:05:47,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-04 06:05:47,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105765577] [2025-03-04 06:05:47,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:47,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:47,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:47,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:47,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 06:05:47,686 INFO L87 Difference]: Start difference. First operand 669 states and 951 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:47,986 INFO L93 Difference]: Finished difference Result 1293 states and 1855 transitions. [2025-03-04 06:05:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 06:05:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 107 [2025-03-04 06:05:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:47,989 INFO L225 Difference]: With dead ends: 1293 [2025-03-04 06:05:47,989 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 06:05:47,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 06:05:47,991 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 42 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 2696 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 06:05:48,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 661. [2025-03-04 06:05:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 633 states have (on average 1.4123222748815165) internal successors, (894), 650 states have internal predecessors, (894), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 937 transitions. [2025-03-04 06:05:48,006 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 937 transitions. Word has length 107 [2025-03-04 06:05:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:48,007 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 937 transitions. [2025-03-04 06:05:48,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 937 transitions. [2025-03-04 06:05:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 06:05:48,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:48,008 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:48,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 06:05:48,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 06:05:48,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:48,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:48,209 INFO L85 PathProgramCache]: Analyzing trace with hash -109613935, now seen corresponding path program 1 times [2025-03-04 06:05:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:48,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375578153] [2025-03-04 06:05:48,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:48,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:05:48,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:05:48,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:48,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 06:05:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:48,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375578153] [2025-03-04 06:05:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375578153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:48,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:48,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564177333] [2025-03-04 06:05:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:48,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:48,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:48,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:48,583 INFO L87 Difference]: Start difference. First operand 661 states and 937 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:49,003 INFO L93 Difference]: Finished difference Result 1293 states and 1849 transitions. [2025-03-04 06:05:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:49,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 109 [2025-03-04 06:05:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:49,006 INFO L225 Difference]: With dead ends: 1293 [2025-03-04 06:05:49,007 INFO L226 Difference]: Without dead ends: 693 [2025-03-04 06:05:49,008 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-04 06:05:49,008 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 26 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:49,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3197 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 06:05:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-04 06:05:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 681. [2025-03-04 06:05:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 653 states have (on average 1.4058192955589586) internal successors, (918), 670 states have internal predecessors, (918), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 961 transitions. [2025-03-04 06:05:49,028 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 961 transitions. Word has length 109 [2025-03-04 06:05:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:49,029 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 961 transitions. [2025-03-04 06:05:49,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 961 transitions. [2025-03-04 06:05:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 06:05:49,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:49,030 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:05:49,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 983338759, now seen corresponding path program 1 times [2025-03-04 06:05:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080676162] [2025-03-04 06:05:49,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:49,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:05:49,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:05:49,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:49,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080676162] [2025-03-04 06:05:49,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080676162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:49,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667413984] [2025-03-04 06:05:49,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:49,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:49,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:49,395 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:49,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 06:05:49,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 06:05:50,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 06:05:50,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:50,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:05:50,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:05:50,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:05:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667413984] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:05:54,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:05:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-03-04 06:05:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821767904] [2025-03-04 06:05:54,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:05:54,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:05:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:05:54,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=231, Unknown=1, NotChecked=0, Total=342 [2025-03-04 06:05:54,500 INFO L87 Difference]: Start difference. First operand 681 states and 961 transitions. Second operand has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:05:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:55,009 INFO L93 Difference]: Finished difference Result 1269 states and 1810 transitions. [2025-03-04 06:05:55,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 06:05:55,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2025-03-04 06:05:55,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:55,012 INFO L225 Difference]: With dead ends: 1269 [2025-03-04 06:05:55,012 INFO L226 Difference]: Without dead ends: 690 [2025-03-04 06:05:55,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=267, Invalid=488, Unknown=1, NotChecked=0, Total=756 [2025-03-04 06:05:55,015 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 30 mSDsluCounter, 3462 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:55,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3961 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-04 06:05:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-03-04 06:05:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 662 states have (on average 1.403323262839879) internal successors, (929), 679 states have internal predecessors, (929), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 972 transitions. [2025-03-04 06:05:55,034 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 972 transitions. Word has length 109 [2025-03-04 06:05:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:55,034 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 972 transitions. [2025-03-04 06:05:55,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 06:05:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 972 transitions. [2025-03-04 06:05:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 06:05:55,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:55,036 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:55,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 06:05:55,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 06:05:55,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 571202439, now seen corresponding path program 2 times [2025-03-04 06:05:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:55,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81680247] [2025-03-04 06:05:55,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:05:55,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:55,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-03-04 06:05:55,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 115 statements. [2025-03-04 06:05:55,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:05:55,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-04 06:05:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81680247] [2025-03-04 06:05:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81680247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:05:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627992471] [2025-03-04 06:05:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:05:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:05:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:55,569 INFO L87 Difference]: Start difference. First operand 690 states and 972 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:56,096 INFO L93 Difference]: Finished difference Result 1333 states and 1894 transitions. [2025-03-04 06:05:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:05:56,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 115 [2025-03-04 06:05:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:56,099 INFO L225 Difference]: With dead ends: 1333 [2025-03-04 06:05:56,099 INFO L226 Difference]: Without dead ends: 724 [2025-03-04 06:05:56,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:05:56,101 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 17 mSDsluCounter, 3548 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:56,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4036 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 06:05:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-04 06:05:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 700. [2025-03-04 06:05:56,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 672 states have (on average 1.400297619047619) internal successors, (941), 689 states have internal predecessors, (941), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 984 transitions. [2025-03-04 06:05:56,117 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 984 transitions. Word has length 115 [2025-03-04 06:05:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:56,118 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 984 transitions. [2025-03-04 06:05:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 984 transitions. [2025-03-04 06:05:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 06:05:56,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:56,119 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:05:56,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:56,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1475569557, now seen corresponding path program 1 times [2025-03-04 06:05:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:56,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768203038] [2025-03-04 06:05:56,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:05:56,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:05:56,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:56,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:05:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768203038] [2025-03-04 06:05:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768203038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:05:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413139113] [2025-03-04 06:05:56,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:56,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:56,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:05:56,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:05:56,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 06:05:56,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:05:57,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:05:57,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:57,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:57,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 06:05:57,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:05:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 06:05:57,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:05:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 35 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 06:05:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413139113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:05:57,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:05:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 6] total 21 [2025-03-04 06:05:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33116797] [2025-03-04 06:05:57,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:05:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 06:05:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:57,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 06:05:57,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-03-04 06:05:57,258 INFO L87 Difference]: Start difference. First operand 700 states and 984 transitions. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 06:05:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:57,743 INFO L93 Difference]: Finished difference Result 1307 states and 1858 transitions. [2025-03-04 06:05:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:05:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 115 [2025-03-04 06:05:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:57,746 INFO L225 Difference]: With dead ends: 1307 [2025-03-04 06:05:57,746 INFO L226 Difference]: Without dead ends: 714 [2025-03-04 06:05:57,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:05:57,748 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 14 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 06:05:57,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2046 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-04 06:05:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 710. [2025-03-04 06:05:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 682 states have (on average 1.401759530791789) internal successors, (956), 699 states have internal predecessors, (956), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 999 transitions. [2025-03-04 06:05:57,764 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 999 transitions. Word has length 115 [2025-03-04 06:05:57,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:57,764 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 999 transitions. [2025-03-04 06:05:57,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 21 states have internal predecessors, (120), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 06:05:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 999 transitions. [2025-03-04 06:05:57,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 06:05:57,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:57,766 INFO L218 NwaCegarLoop]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:57,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 06:05:57,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:05:57,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:57,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 915099119, now seen corresponding path program 2 times [2025-03-04 06:05:57,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:57,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520437605] [2025-03-04 06:05:57,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:05:57,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:58,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-03-04 06:05:58,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 96 of 128 statements. [2025-03-04 06:05:58,034 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:05:58,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:05:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-04 06:05:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:05:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520437605] [2025-03-04 06:05:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520437605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:05:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:05:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:05:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286717910] [2025-03-04 06:05:58,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:05:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:05:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:05:58,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:05:58,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:58,403 INFO L87 Difference]: Start difference. First operand 710 states and 999 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:58,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 06:05:58,763 INFO L93 Difference]: Finished difference Result 1352 states and 1923 transitions. [2025-03-04 06:05:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 06:05:58,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2025-03-04 06:05:58,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 06:05:58,766 INFO L225 Difference]: With dead ends: 1352 [2025-03-04 06:05:58,766 INFO L226 Difference]: Without dead ends: 716 [2025-03-04 06:05:58,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:05:58,768 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 8 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2674 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-04 06:05:58,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2674 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 06:05:58,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-04 06:05:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-04 06:05:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 688 states have (on average 1.3982558139534884) internal successors, (962), 705 states have internal predecessors, (962), 21 states have call successors, (21), 4 states have call predecessors, (21), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2025-03-04 06:05:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1005 transitions. [2025-03-04 06:05:58,782 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1005 transitions. Word has length 128 [2025-03-04 06:05:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 06:05:58,783 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1005 transitions. [2025-03-04 06:05:58,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 06:05:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1005 transitions. [2025-03-04 06:05:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 06:05:58,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 06:05:58,784 INFO L218 NwaCegarLoop]: trace histogram [25, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:05:58,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:05:58,784 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 06:05:58,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:05:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash 418258216, now seen corresponding path program 1 times [2025-03-04 06:05:58,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:05:58,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553516424] [2025-03-04 06:05:58,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:05:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:05:58,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:05:59,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:05:59,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:05:59,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 78 proven. 220 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 06:06:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:06:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553516424] [2025-03-04 06:06:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553516424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:06:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816110279] [2025-03-04 06:06:08,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:06:08,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:06:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:06:08,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:06:08,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 06:06:08,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:06:09,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:06:09,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:06:09,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:06:09,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 194 conjuncts are in the unsatisfiable core [2025-03-04 06:06:09,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:06:09,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 06:06:09,719 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-04 06:06:09,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-04 06:06:09,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 06:06:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 06:06:10,008 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 06:06:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33