./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:34:37,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:34:37,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:34:37,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:34:37,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:34:37,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:34:37,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:34:37,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:34:37,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:34:37,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:34:37,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:34:37,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:34:37,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:34:37,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:34:37,380 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:34:37,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:34:37,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:34:37,380 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:34:37,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:34:37,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:34:37,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:34:37,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:34:37,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:34:37,382 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-jdk21/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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2025-02-06 08:34:37,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:34:37,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:34:37,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:34:37,611 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:34:37,612 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:34:37,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2025-02-06 08:34:38,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddaf3c94a/e27bceaecd1d4793ad40be912b723d1f/FLAGd0164d35f [2025-02-06 08:34:39,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:34:39,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2025-02-06 08:34:39,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddaf3c94a/e27bceaecd1d4793ad40be912b723d1f/FLAGd0164d35f [2025-02-06 08:34:39,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddaf3c94a/e27bceaecd1d4793ad40be912b723d1f [2025-02-06 08:34:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:34:39,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:34:39,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:34:39,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:34:39,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:34:39,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:34:39" (1/1) ... [2025-02-06 08:34:39,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395c524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:39, skipping insertion in model container [2025-02-06 08:34:39,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:34:39" (1/1) ... [2025-02-06 08:34:39,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:34:39,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2025-02-06 08:34:39,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2025-02-06 08:34:39,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:34:39,909 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:34:39,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[33021,33034] [2025-02-06 08:34:40,013 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i[84583,84596] [2025-02-06 08:34:40,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:34:40,038 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:34:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40 WrapperNode [2025-02-06 08:34:40,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:34:40,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:34:40,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:34:40,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:34:40,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,066 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,139 INFO L138 Inliner]: procedures = 177, calls = 773, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3403 [2025-02-06 08:34:40,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:34:40,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:34:40,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:34:40,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:34:40,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,157 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,221 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 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, 50, 4]. [2025-02-06 08:34:40,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:34:40,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:34:40,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:34:40,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:34:40,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (1/1) ... [2025-02-06 08:34:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:34:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:40,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 08:34:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:34:40,388 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 08:34:40,388 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 08:34:40,388 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 08:34:40,388 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:34:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:34:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:34:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:34:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:34:40,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:34:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:34:40,546 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:34:40,547 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:34:42,438 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: 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-02-06 08:34:42,660 INFO L? ?]: Removed 823 outVars from TransFormulas that were not future-live. [2025-02-06 08:34:42,661 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:34:42,741 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:34:42,741 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:34:42,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:34:42 BoogieIcfgContainer [2025-02-06 08:34:42,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:34:42,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:34:42,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:34:42,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:34:42,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:34:39" (1/3) ... [2025-02-06 08:34:42,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ec8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:34:42, skipping insertion in model container [2025-02-06 08:34:42,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:34:40" (2/3) ... [2025-02-06 08:34:42,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430ec8fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:34:42, skipping insertion in model container [2025-02-06 08:34:42,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:34:42" (3/3) ... [2025-02-06 08:34:42,753 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2025-02-06 08:34:42,765 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:34:42,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test9-2.i that has 5 procedures, 1409 locations, 1 initial locations, 38 loop locations, and 2 error locations. [2025-02-06 08:34:42,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:34:42,859 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;@e03cd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:34:42,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 08:34:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 1401 states, 893 states have (on average 1.8297872340425532) internal successors, (1634), 1395 states have internal predecessors, (1634), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:34:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 08:34:42,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:42,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:42,873 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:42,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash -904108323, now seen corresponding path program 1 times [2025-02-06 08:34:42,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100233246] [2025-02-06 08:34:42,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:42,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 08:34:42,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 08:34:42,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:42,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100233246] [2025-02-06 08:34:43,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100233246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:43,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:43,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:34:43,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555967053] [2025-02-06 08:34:43,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:34:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:43,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:34:43,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:34:43,031 INFO L87 Difference]: Start difference. First operand has 1401 states, 893 states have (on average 1.8297872340425532) internal successors, (1634), 1395 states have internal predecessors, (1634), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) 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-02-06 08:34:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:43,280 INFO L93 Difference]: Finished difference Result 2800 states and 5778 transitions. [2025-02-06 08:34:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:34:43,282 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-02-06 08:34:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:43,300 INFO L225 Difference]: With dead ends: 2800 [2025-02-06 08:34:43,300 INFO L226 Difference]: Without dead ends: 1364 [2025-02-06 08:34:43,311 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-02-06 08:34:43,313 INFO L435 NwaCegarLoop]: 2534 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2534 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-02-06 08:34:43,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2534 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2025-02-06 08:34:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2025-02-06 08:34:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 857 states have (on average 1.7736289381563595) internal successors, (1520), 1358 states have internal predecessors, (1520), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:34:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2526 transitions. [2025-02-06 08:34:43,649 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2526 transitions. Word has length 9 [2025-02-06 08:34:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:43,650 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2526 transitions. [2025-02-06 08:34:43,650 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-02-06 08:34:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2526 transitions. [2025-02-06 08:34:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 08:34:43,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:43,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:34:43,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:34:43,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:43,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash -603747245, now seen corresponding path program 1 times [2025-02-06 08:34:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:43,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569391806] [2025-02-06 08:34:43,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:43,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 08:34:43,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 08:34:43,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:43,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569391806] [2025-02-06 08:34:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569391806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791146452] [2025-02-06 08:34:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:44,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:44,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:44,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:44,045 INFO L87 Difference]: Start difference. First operand 1364 states and 2526 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 08:34:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:44,795 INFO L93 Difference]: Finished difference Result 3880 states and 7279 transitions. [2025-02-06 08:34:44,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:34:44,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2025-02-06 08:34:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:44,813 INFO L225 Difference]: With dead ends: 3880 [2025-02-06 08:34:44,813 INFO L226 Difference]: Without dead ends: 2715 [2025-02-06 08:34:44,818 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-02-06 08:34:44,819 INFO L435 NwaCegarLoop]: 2759 mSDtfsCounter, 1505 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 7478 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:44,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 7478 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:34:44,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-02-06 08:34:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 1366. [2025-02-06 08:34:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 859 states have (on average 1.7718277066356227) internal successors, (1522), 1360 states have internal predecessors, (1522), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:34:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2528 transitions. [2025-02-06 08:34:45,077 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2528 transitions. Word has length 63 [2025-02-06 08:34:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:45,077 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2528 transitions. [2025-02-06 08:34:45,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-02-06 08:34:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2528 transitions. [2025-02-06 08:34:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:34:45,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:45,081 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:45,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:34:45,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 174221936, now seen corresponding path program 1 times [2025-02-06 08:34:45,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:45,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951400302] [2025-02-06 08:34:45,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:45,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:34:45,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:34:45,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:45,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:45,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:45,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951400302] [2025-02-06 08:34:45,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951400302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:45,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:45,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015795466] [2025-02-06 08:34:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:45,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:45,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:45,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:45,392 INFO L87 Difference]: Start difference. First operand 1366 states and 2528 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-06 08:34:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:45,559 INFO L93 Difference]: Finished difference Result 2686 states and 4986 transitions. [2025-02-06 08:34:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 138 [2025-02-06 08:34:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:45,571 INFO L225 Difference]: With dead ends: 2686 [2025-02-06 08:34:45,571 INFO L226 Difference]: Without dead ends: 1324 [2025-02-06 08:34:45,574 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-02-06 08:34:45,575 INFO L435 NwaCegarLoop]: 2393 mSDtfsCounter, 30 mSDsluCounter, 4767 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7160 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:45,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7160 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-02-06 08:34:45,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2025-02-06 08:34:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 817 states have (on average 1.7686658506731947) internal successors, (1445), 1318 states have internal predecessors, (1445), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:34:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2451 transitions. [2025-02-06 08:34:45,710 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2451 transitions. Word has length 138 [2025-02-06 08:34:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 1324 states and 2451 transitions. [2025-02-06 08:34:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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-02-06 08:34:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2451 transitions. [2025-02-06 08:34:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-06 08:34:45,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:45,712 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:45,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:34:45,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:45,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1776411721, now seen corresponding path program 1 times [2025-02-06 08:34:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72515800] [2025-02-06 08:34:45,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 08:34:45,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 08:34:45,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:45,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:34:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:45,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72515800] [2025-02-06 08:34:45,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72515800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:45,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:45,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:34:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144856830] [2025-02-06 08:34:45,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:45,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:34:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:45,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:34:45,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:34:45,867 INFO L87 Difference]: Start difference. First operand 1324 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-02-06 08:34:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:46,067 INFO L93 Difference]: Finished difference Result 3867 states and 7220 transitions. [2025-02-06 08:34:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:34:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2025-02-06 08:34:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:46,086 INFO L225 Difference]: With dead ends: 3867 [2025-02-06 08:34:46,086 INFO L226 Difference]: Without dead ends: 2547 [2025-02-06 08:34:46,091 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-02-06 08:34:46,092 INFO L435 NwaCegarLoop]: 2839 mSDtfsCounter, 1260 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 5236 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:46,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 5236 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2025-02-06 08:34:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2545. [2025-02-06 08:34:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1538 states have (on average 1.7971391417425226) internal successors, (2764), 2539 states have internal predecessors, (2764), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:34:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4770 transitions. [2025-02-06 08:34:46,389 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4770 transitions. Word has length 138 [2025-02-06 08:34:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:46,390 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4770 transitions. [2025-02-06 08:34:46,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-02-06 08:34:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4770 transitions. [2025-02-06 08:34:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:34:46,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:46,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:46,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:34:46,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:46,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1362780253, now seen corresponding path program 1 times [2025-02-06 08:34:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559927505] [2025-02-06 08:34:46,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:34:46,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:34:46,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:46,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:34:46,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559927505] [2025-02-06 08:34:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559927505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:46,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:46,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:34:46,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728517232] [2025-02-06 08:34:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:46,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:34:46,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:46,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:34:46,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:34:46,635 INFO L87 Difference]: Start difference. First operand 2545 states and 4770 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:46,802 INFO L93 Difference]: Finished difference Result 4884 states and 9270 transitions. [2025-02-06 08:34:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:34:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:34:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:46,821 INFO L225 Difference]: With dead ends: 4884 [2025-02-06 08:34:46,822 INFO L226 Difference]: Without dead ends: 2585 [2025-02-06 08:34:46,831 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-02-06 08:34:46,833 INFO L435 NwaCegarLoop]: 2391 mSDtfsCounter, 8 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:46,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4767 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-02-06 08:34:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2585. [2025-02-06 08:34:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2585 states, 1578 states have (on average 1.7769328263624842) internal successors, (2804), 2579 states have internal predecessors, (2804), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:34:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2585 states to 2585 states and 4810 transitions. [2025-02-06 08:34:47,077 INFO L78 Accepts]: Start accepts. Automaton has 2585 states and 4810 transitions. Word has length 153 [2025-02-06 08:34:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:47,079 INFO L471 AbstractCegarLoop]: Abstraction has 2585 states and 4810 transitions. [2025-02-06 08:34:47,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2585 states and 4810 transitions. [2025-02-06 08:34:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:34:47,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:47,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:34:47,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash 647323588, now seen corresponding path program 1 times [2025-02-06 08:34:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944016333] [2025-02-06 08:34:47,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:47,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:34:47,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:34:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 08:34:47,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:47,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944016333] [2025-02-06 08:34:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944016333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:47,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:47,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707891195] [2025-02-06 08:34:47,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:47,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:47,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:47,293 INFO L87 Difference]: Start difference. First operand 2585 states and 4810 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:47,482 INFO L93 Difference]: Finished difference Result 4800 states and 9112 transitions. [2025-02-06 08:34:47,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 08:34:47,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:34:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:47,496 INFO L225 Difference]: With dead ends: 4800 [2025-02-06 08:34:47,496 INFO L226 Difference]: Without dead ends: 2461 [2025-02-06 08:34:47,502 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-02-06 08:34:47,502 INFO L435 NwaCegarLoop]: 2316 mSDtfsCounter, 32 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6934 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:47,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6934 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:34:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2025-02-06 08:34:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2025-02-06 08:34:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1454 states have (on average 1.7909215955983493) internal successors, (2604), 2455 states have internal predecessors, (2604), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2025-02-06 08:34:47,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4610 transitions. [2025-02-06 08:34:47,744 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4610 transitions. Word has length 153 [2025-02-06 08:34:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 4610 transitions. [2025-02-06 08:34:47,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4610 transitions. [2025-02-06 08:34:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-06 08:34:47,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:47,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:47,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:34:47,746 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:47,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1523146525, now seen corresponding path program 1 times [2025-02-06 08:34:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:47,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257009594] [2025-02-06 08:34:47,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:47,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 08:34:47,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 08:34:47,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:47,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257009594] [2025-02-06 08:34:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257009594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:34:47,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:34:47,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:34:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571411964] [2025-02-06 08:34:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:34:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:34:47,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:47,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:34:47,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:34:47,910 INFO L87 Difference]: Start difference. First operand 2461 states and 4610 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:48,929 INFO L93 Difference]: Finished difference Result 3739 states and 6977 transitions. [2025-02-06 08:34:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:34:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 153 [2025-02-06 08:34:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:48,938 INFO L225 Difference]: With dead ends: 3739 [2025-02-06 08:34:48,938 INFO L226 Difference]: Without dead ends: 1368 [2025-02-06 08:34:48,944 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-02-06 08:34:48,944 INFO L435 NwaCegarLoop]: 2398 mSDtfsCounter, 2543 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1003 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1003 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:48,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 3528 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1003 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:34:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-02-06 08:34:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2025-02-06 08:34:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 861 states have (on average 1.718931475029036) internal successors, (1480), 1362 states have internal predecessors, (1480), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2025-02-06 08:34:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2486 transitions. [2025-02-06 08:34:49,043 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2486 transitions. Word has length 153 [2025-02-06 08:34:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:49,043 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2486 transitions. [2025-02-06 08:34:49,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:34:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2486 transitions. [2025-02-06 08:34:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 08:34:49,045 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:49,045 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:49,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:34:49,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:49,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:49,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1631995983, now seen corresponding path program 1 times [2025-02-06 08:34:49,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:49,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877567659] [2025-02-06 08:34:49,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:49,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:49,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:34:49,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:34:49,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:49,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:49,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877567659] [2025-02-06 08:34:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877567659] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:49,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883891130] [2025-02-06 08:34:49,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:49,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:49,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:34:49,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 08:34:49,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 08:34:49,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 08:34:49,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:49,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:49,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 08:34:49,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:49,993 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-02-06 08:34:50,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:34:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:50,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:34:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883891130] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:34:50,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:34:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-02-06 08:34:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476861870] [2025-02-06 08:34:50,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:34:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 08:34:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 08:34:50,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:34:50,395 INFO L87 Difference]: Start difference. First operand 1368 states and 2486 transitions. Second operand has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:34:55,552 INFO L93 Difference]: Finished difference Result 5211 states and 9603 transitions. [2025-02-06 08:34:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:34:55,553 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-02-06 08:34:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:34:55,571 INFO L225 Difference]: With dead ends: 5211 [2025-02-06 08:34:55,571 INFO L226 Difference]: Without dead ends: 4088 [2025-02-06 08:34:55,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:34:55,575 INFO L435 NwaCegarLoop]: 1987 mSDtfsCounter, 7447 mSDsluCounter, 13033 mSDsCounter, 0 mSdLazyCounter, 5385 mSolverCounterSat, 1511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8451 SdHoareTripleChecker+Valid, 15020 SdHoareTripleChecker+Invalid, 6896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1511 IncrementalHoareTripleChecker+Valid, 5385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:34:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8451 Valid, 15020 Invalid, 6896 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1511 Valid, 5385 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-06 08:34:55,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-02-06 08:34:55,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 1710. [2025-02-06 08:34:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1199 states have (on average 1.6113427856547122) internal successors, (1932), 1700 states have internal predecessors, (1932), 506 states have call successors, (506), 3 states have call predecessors, (506), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2025-02-06 08:34:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2944 transitions. [2025-02-06 08:34:55,843 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2944 transitions. Word has length 163 [2025-02-06 08:34:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:34:55,843 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2944 transitions. [2025-02-06 08:34:55,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.916666666666668) internal successors, (323), 12 states have internal predecessors, (323), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:34:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2944 transitions. [2025-02-06 08:34:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-02-06 08:34:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:34:55,848 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:34:55,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 08:34:56,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:56,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:34:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:34:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1318478363, now seen corresponding path program 1 times [2025-02-06 08:34:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:34:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627010035] [2025-02-06 08:34:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:34:56,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:34:56,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:34:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:34:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627010035] [2025-02-06 08:34:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627010035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:34:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526831809] [2025-02-06 08:34:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:34:58,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:34:58,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:34:58,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:34:58,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 08:34:58,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-02-06 08:34:58,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-02-06 08:34:58,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:34:58,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:34:58,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 08:34:58,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:34:58,954 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-02-06 08:34:59,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:34:59,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:34:59,297 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:34:59,383 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:34:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:59,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:34:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:34:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526831809] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:34:59,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:34:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-02-06 08:34:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147211225] [2025-02-06 08:34:59,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:34:59,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 08:34:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:34:59,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 08:34:59,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-02-06 08:34:59,811 INFO L87 Difference]: Start difference. First operand 1710 states and 2944 transitions. Second operand has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:35:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:11,545 INFO L93 Difference]: Finished difference Result 10527 states and 19360 transitions. [2025-02-06 08:35:11,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 08:35:11,546 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 388 [2025-02-06 08:35:11,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:11,634 INFO L225 Difference]: With dead ends: 10527 [2025-02-06 08:35:11,634 INFO L226 Difference]: Without dead ends: 9404 [2025-02-06 08:35:11,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 764 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-02-06 08:35:11,647 INFO L435 NwaCegarLoop]: 6755 mSDtfsCounter, 14108 mSDsluCounter, 33674 mSDsCounter, 0 mSdLazyCounter, 19576 mSolverCounterSat, 1766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17118 SdHoareTripleChecker+Valid, 40429 SdHoareTripleChecker+Invalid, 21342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1766 IncrementalHoareTripleChecker+Valid, 19576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:11,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17118 Valid, 40429 Invalid, 21342 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1766 Valid, 19576 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2025-02-06 08:35:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9404 states. [2025-02-06 08:35:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9404 to 2562. [2025-02-06 08:35:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2562 states, 2045 states have (on average 1.4992665036674817) internal successors, (3066), 2546 states have internal predecessors, (3066), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:35:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 4090 transitions. [2025-02-06 08:35:12,435 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 4090 transitions. Word has length 388 [2025-02-06 08:35:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:12,437 INFO L471 AbstractCegarLoop]: Abstraction has 2562 states and 4090 transitions. [2025-02-06 08:35:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 43.391304347826086) internal successors, (998), 23 states have internal predecessors, (998), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-06 08:35:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 4090 transitions. [2025-02-06 08:35:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-06 08:35:12,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:12,449 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:35:12,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 08:35:12,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:12,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:12,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -549889243, now seen corresponding path program 2 times [2025-02-06 08:35:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104103353] [2025-02-06 08:35:12,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 08:35:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:12,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 838 statements into 2 equivalence classes. [2025-02-06 08:35:13,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 838 statements. [2025-02-06 08:35:13,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 08:35:13,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:35:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104103353] [2025-02-06 08:35:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104103353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:13,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:13,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:35:13,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790278596] [2025-02-06 08:35:13,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:13,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:35:13,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:13,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:35:13,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:35:13,328 INFO L87 Difference]: Start difference. First operand 2562 states and 4090 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:35:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:13,762 INFO L93 Difference]: Finished difference Result 3689 states and 6255 transitions. [2025-02-06 08:35:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:35:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 838 [2025-02-06 08:35:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:13,773 INFO L225 Difference]: With dead ends: 3689 [2025-02-06 08:35:13,773 INFO L226 Difference]: Without dead ends: 2567 [2025-02-06 08:35:13,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:13,778 INFO L435 NwaCegarLoop]: 2323 mSDtfsCounter, 14 mSDsluCounter, 9028 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11351 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:13,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11351 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:35:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2025-02-06 08:35:13,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2564. [2025-02-06 08:35:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2047 states have (on average 1.4987787005373718) internal successors, (3068), 2548 states have internal predecessors, (3068), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:35:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 4092 transitions. [2025-02-06 08:35:13,998 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 4092 transitions. Word has length 838 [2025-02-06 08:35:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 2564 states and 4092 transitions. [2025-02-06 08:35:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:35:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 4092 transitions. [2025-02-06 08:35:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:35:14,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:14,018 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:35:14,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:35:14,018 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:14,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 995186276, now seen corresponding path program 1 times [2025-02-06 08:35:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:14,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174223297] [2025-02-06 08:35:14,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:14,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:35:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:35:14,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:14,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3381 trivial. 0 not checked. [2025-02-06 08:35:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174223297] [2025-02-06 08:35:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174223297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:35:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:35:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:35:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941957005] [2025-02-06 08:35:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:35:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:35:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:15,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:35:15,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:35:15,711 INFO L87 Difference]: Start difference. First operand 2564 states and 4092 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:35:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:35:16,033 INFO L93 Difference]: Finished difference Result 3693 states and 6259 transitions. [2025-02-06 08:35:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:35:16,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 839 [2025-02-06 08:35:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:35:16,041 INFO L225 Difference]: With dead ends: 3693 [2025-02-06 08:35:16,042 INFO L226 Difference]: Without dead ends: 2569 [2025-02-06 08:35:16,045 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-02-06 08:35:16,045 INFO L435 NwaCegarLoop]: 2318 mSDtfsCounter, 15 mSDsluCounter, 11304 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13622 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:35:16,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13622 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:35:16,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2025-02-06 08:35:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2568. [2025-02-06 08:35:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2568 states, 2051 states have (on average 1.4982935153583619) internal successors, (3073), 2552 states have internal predecessors, (3073), 512 states have call successors, (512), 3 states have call predecessors, (512), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 08:35:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 4097 transitions. [2025-02-06 08:35:16,181 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 4097 transitions. Word has length 839 [2025-02-06 08:35:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:35:16,182 INFO L471 AbstractCegarLoop]: Abstraction has 2568 states and 4097 transitions. [2025-02-06 08:35:16,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 08:35:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 4097 transitions. [2025-02-06 08:35:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-02-06 08:35:16,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:35:16,187 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:35:16,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:35:16,188 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 08:35:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:35:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2093982749, now seen corresponding path program 1 times [2025-02-06 08:35:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:35:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108921496] [2025-02-06 08:35:16,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:35:16,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:35:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:35:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:35:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108921496] [2025-02-06 08:35:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108921496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 08:35:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505485258] [2025-02-06 08:35:24,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:35:24,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 08:35:24,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:35:24,059 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 08:35:24,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 08:35:24,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-02-06 08:35:25,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-02-06 08:35:25,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:35:25,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:35:25,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 4161 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 08:35:25,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 08:35:25,334 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-02-06 08:35:25,476 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,564 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,809 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:25,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:26,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:26,134 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:26,212 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-02-06 08:35:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:26,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 08:35:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 3377 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 08:35:27,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505485258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 08:35:27,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 08:35:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 42 [2025-02-06 08:35:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767707724] [2025-02-06 08:35:27,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 08:35:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-06 08:35:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:35:27,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-06 08:35:27,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=1127, Unknown=0, NotChecked=0, Total=1722 [2025-02-06 08:35:27,208 INFO L87 Difference]: Start difference. First operand 2568 states and 4097 transitions. Second operand has 42 states, 42 states have (on average 55.92857142857143) internal successors, (2349), 42 states have internal predecessors, (2349), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)