./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:44,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:44,322 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:02:44,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:44,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:44,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:44,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:44,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:44,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:44,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:44,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:44,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:44,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:44,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:44,356 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:44,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:44,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:44,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:44,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:44,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:44,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:44,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:44,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81c7729345d5d6e6cfdedd64c331a4f8f6005773af2c566c0c24cc964b2ec390 [2025-03-04 01:02:44,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:44,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:44,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:44,585 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:44,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:44,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2025-03-04 01:02:45,742 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a0932f8/6eeb336d3b3643e3a38309c33312a498/FLAGca6670e8c [2025-03-04 01:02:45,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:45,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i [2025-03-04 01:02:45,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a0932f8/6eeb336d3b3643e3a38309c33312a498/FLAGca6670e8c [2025-03-04 01:02:46,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68a0932f8/6eeb336d3b3643e3a38309c33312a498 [2025-03-04 01:02:46,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:46,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:46,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:46,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:46,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:46,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30326cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46, skipping insertion in model container [2025-03-04 01:02:46,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:46,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i[916,929] [2025-03-04 01:02:46,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:46,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:46,502 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-19.i[916,929] [2025-03-04 01:02:46,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:46,550 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:46,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46 WrapperNode [2025-03-04 01:02:46,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:46,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:46,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:46,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:46,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,604 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-03-04 01:02:46,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:46,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:46,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:46,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:46,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,627 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2025-03-04 01:02:46,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:46,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:46,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:46,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:46,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (1/1) ... [2025-03-04 01:02:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:46,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:02:46,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:02:46,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:46,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:02:46,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:02:46,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:46,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:46,798 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:46,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:47,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-04 01:02:47,135 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:47,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:47,145 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:47,146 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:47,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:47 BoogieIcfgContainer [2025-03-04 01:02:47,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:47,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:47,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:47,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:47,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:46" (1/3) ... [2025-03-04 01:02:47,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc9ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:47, skipping insertion in model container [2025-03-04 01:02:47,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:46" (2/3) ... [2025-03-04 01:02:47,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc9ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:47, skipping insertion in model container [2025-03-04 01:02:47,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:47" (3/3) ... [2025-03-04 01:02:47,153 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-19.i [2025-03-04 01:02:47,164 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:47,166 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-19.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:47,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:47,214 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;@57ad442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:47,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:02:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:02:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:47,230 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:47,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:47,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1542436912, now seen corresponding path program 1 times [2025-03-04 01:02:47,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:47,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-04 01:02:47,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:47,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:47,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:47,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:02:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197819472] [2025-03-04 01:02:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197819472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631714581] [2025-03-04 01:02:47,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:47,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:47,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:47,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:47,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:02:47,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:47,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:47,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:47,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:47,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:47,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:47,686 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:02:47,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631714581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:47,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:47,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:02:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175686580] [2025-03-04 01:02:47,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:47,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:47,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:47,708 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.382716049382716) internal successors, (112), 82 states have internal predecessors, (112), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:47,732 INFO L93 Difference]: Finished difference Result 196 states and 304 transitions. [2025-03-04 01:02:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:47,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-04 01:02:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:47,738 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:02:47,739 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:02:47,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:47,746 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:47,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:47,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:02:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:02:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:02:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-03-04 01:02:47,774 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 132 [2025-03-04 01:02:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:47,775 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-03-04 01:02:47,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-03-04 01:02:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:02:47,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:47,780 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:47,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:02:47,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:02:47,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:47,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1345416801, now seen corresponding path program 1 times [2025-03-04 01:02:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793888204] [2025-03-04 01:02:47,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:48,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:48,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:48,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793888204] [2025-03-04 01:02:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793888204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:48,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:02:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285157209] [2025-03-04 01:02:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:48,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:48,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:48,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:48,259 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:02:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:48,300 INFO L93 Difference]: Finished difference Result 196 states and 279 transitions. [2025-03-04 01:02:48,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:48,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:02:48,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:48,302 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:02:48,302 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:02:48,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:48,303 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:48,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:02:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:02:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:02:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2025-03-04 01:02:48,318 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 132 [2025-03-04 01:02:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:48,319 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2025-03-04 01:02:48,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:02:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2025-03-04 01:02:48,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:02:48,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:48,321 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:48,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:02:48,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1346340322, now seen corresponding path program 1 times [2025-03-04 01:02:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311517711] [2025-03-04 01:02:48,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:48,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:48,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:48,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:48,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:02:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311517711] [2025-03-04 01:02:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311517711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158681560] [2025-03-04 01:02:49,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:49,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:49,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:02:49,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:49,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:49,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:49,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:49,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 01:02:49,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:50,096 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 23 treesize of output 3 [2025-03-04 01:02:50,148 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 29 treesize of output 13 [2025-03-04 01:02:50,219 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 68 treesize of output 55 [2025-03-04 01:02:50,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 01:02:50,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2025-03-04 01:02:50,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-04 01:02:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 13 proven. 250 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2025-03-04 01:02:50,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:50,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-03-04 01:02:50,599 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2025-03-04 01:02:50,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 1 [2025-03-04 01:02:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:50,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158681560] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:02:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 13] total 25 [2025-03-04 01:02:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969892046] [2025-03-04 01:02:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:50,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:50,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:50,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:50,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:02:50,672 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:02:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:50,958 INFO L93 Difference]: Finished difference Result 272 states and 382 transitions. [2025-03-04 01:02:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:02:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-04 01:02:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:50,962 INFO L225 Difference]: With dead ends: 272 [2025-03-04 01:02:50,962 INFO L226 Difference]: Without dead ends: 175 [2025-03-04 01:02:50,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:02:50,963 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 89 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:50,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 773 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-04 01:02:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2025-03-04 01:02:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 139 states have (on average 1.2949640287769784) internal successors, (180), 140 states have internal predecessors, (180), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:02:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 240 transitions. [2025-03-04 01:02:50,987 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 240 transitions. Word has length 132 [2025-03-04 01:02:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:50,988 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 240 transitions. [2025-03-04 01:02:50,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:02:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2025-03-04 01:02:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:02:50,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:50,991 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:51,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:51,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 01:02:51,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1595317277, now seen corresponding path program 1 times [2025-03-04 01:02:51,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:51,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317529046] [2025-03-04 01:02:51,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:51,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:51,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:02:51,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:02:51,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:51,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317529046] [2025-03-04 01:02:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317529046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739759495] [2025-03-04 01:02:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:51,500 INFO L87 Difference]: Start difference. First operand 172 states and 240 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:51,566 INFO L93 Difference]: Finished difference Result 383 states and 533 transitions. [2025-03-04 01:02:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-04 01:02:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:51,570 INFO L225 Difference]: With dead ends: 383 [2025-03-04 01:02:51,570 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:02:51,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:51,572 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 94 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:51,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 647 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:02:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 178. [2025-03-04 01:02:51,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 145 states have (on average 1.296551724137931) internal successors, (188), 146 states have internal predecessors, (188), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:02:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 248 transitions. [2025-03-04 01:02:51,589 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 248 transitions. Word has length 132 [2025-03-04 01:02:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:51,589 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 248 transitions. [2025-03-04 01:02:51,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 248 transitions. [2025-03-04 01:02:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:02:51,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:51,592 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:51,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:02:51,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:51,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -294489052, now seen corresponding path program 1 times [2025-03-04 01:02:51,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472883126] [2025-03-04 01:02:51,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:51,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:02:51,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:02:51,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:51,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472883126] [2025-03-04 01:02:52,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472883126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:02:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323710238] [2025-03-04 01:02:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:52,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:02:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:52,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:02:52,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:02:52,077 INFO L87 Difference]: Start difference. First operand 178 states and 248 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:52,520 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2025-03-04 01:02:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:02:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2025-03-04 01:02:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:52,524 INFO L225 Difference]: With dead ends: 467 [2025-03-04 01:02:52,526 INFO L226 Difference]: Without dead ends: 292 [2025-03-04 01:02:52,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:02:52,527 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:52,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 927 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-04 01:02:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2025-03-04 01:02:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 235 states have (on average 1.2723404255319148) internal successors, (299), 238 states have internal predecessors, (299), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:02:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2025-03-04 01:02:52,560 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 133 [2025-03-04 01:02:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:52,561 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2025-03-04 01:02:52,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2025-03-04 01:02:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:02:52,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:52,562 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:52,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:02:52,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:52,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 183011265, now seen corresponding path program 1 times [2025-03-04 01:02:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791799701] [2025-03-04 01:02:52,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:52,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:02:52,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:02:52,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:52,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:53,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:53,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791799701] [2025-03-04 01:02:53,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791799701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:53,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:53,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:02:53,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667271844] [2025-03-04 01:02:53,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:53,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:02:53,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:53,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:02:53,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:02:53,186 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:53,735 INFO L93 Difference]: Finished difference Result 824 states and 1125 transitions. [2025-03-04 01:02:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:02:53,738 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-04 01:02:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:53,741 INFO L225 Difference]: With dead ends: 824 [2025-03-04 01:02:53,742 INFO L226 Difference]: Without dead ends: 535 [2025-03-04 01:02:53,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:02:53,743 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 97 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:53,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1516 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:02:53,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-04 01:02:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 327. [2025-03-04 01:02:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 274 states have (on average 1.2956204379562044) internal successors, (355), 277 states have internal predecessors, (355), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 01:02:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 451 transitions. [2025-03-04 01:02:53,771 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 451 transitions. Word has length 134 [2025-03-04 01:02:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:53,772 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 451 transitions. [2025-03-04 01:02:53,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 11 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 451 transitions. [2025-03-04 01:02:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:02:53,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:53,773 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:53,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:02:53,773 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:53,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:53,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1393394272, now seen corresponding path program 1 times [2025-03-04 01:02:53,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:53,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906563999] [2025-03-04 01:02:53,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:53,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:53,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:02:53,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:02:53,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:53,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:54,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906563999] [2025-03-04 01:02:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906563999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:02:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330989919] [2025-03-04 01:02:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:54,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:02:54,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:02:54,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:02:54,914 INFO L87 Difference]: Start difference. First operand 327 states and 451 transitions. Second operand has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:55,581 INFO L93 Difference]: Finished difference Result 806 states and 1105 transitions. [2025-03-04 01:02:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:02:55,582 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2025-03-04 01:02:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:55,585 INFO L225 Difference]: With dead ends: 806 [2025-03-04 01:02:55,585 INFO L226 Difference]: Without dead ends: 478 [2025-03-04 01:02:55,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:02:55,586 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 124 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:55,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1243 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:02:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-04 01:02:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 222. [2025-03-04 01:02:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 187 states have (on average 1.2941176470588236) internal successors, (242), 188 states have internal predecessors, (242), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:02:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 302 transitions. [2025-03-04 01:02:55,618 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 302 transitions. Word has length 134 [2025-03-04 01:02:55,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:55,619 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 302 transitions. [2025-03-04 01:02:55,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.2) internal successors, (52), 12 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:55,619 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 302 transitions. [2025-03-04 01:02:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:02:55,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:55,620 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:55,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:02:55,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:55,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1997951451, now seen corresponding path program 1 times [2025-03-04 01:02:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803312238] [2025-03-04 01:02:55,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:55,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:55,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:55,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:55,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:02:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803312238] [2025-03-04 01:02:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803312238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056494489] [2025-03-04 01:02:55,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:55,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:55,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:55,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:55,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:02:56,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:56,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:56,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:56,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:56,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:02:56,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:56,105 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 27 treesize of output 11 [2025-03-04 01:02:56,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:02:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-04 01:02:56,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:02:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056494489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:02:56,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:02:56,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 01:02:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621965936] [2025-03-04 01:02:56,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:02:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:02:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:02:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:02:56,361 INFO L87 Difference]: Start difference. First operand 222 states and 302 transitions. Second operand has 13 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-04 01:02:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:56,696 INFO L93 Difference]: Finished difference Result 457 states and 615 transitions. [2025-03-04 01:02:56,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:02:56,696 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 135 [2025-03-04 01:02:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:56,698 INFO L225 Difference]: With dead ends: 457 [2025-03-04 01:02:56,698 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 01:02:56,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:02:56,701 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 325 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:56,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 373 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 01:02:56,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2025-03-04 01:02:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 193 states have (on average 1.2746113989637307) internal successors, (246), 194 states have internal predecessors, (246), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:02:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 306 transitions. [2025-03-04 01:02:56,720 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 306 transitions. Word has length 135 [2025-03-04 01:02:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:56,720 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 306 transitions. [2025-03-04 01:02:56,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.2) internal successors, (72), 13 states have internal predecessors, (72), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-04 01:02:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 306 transitions. [2025-03-04 01:02:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:02:56,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:56,723 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:56,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:02:56,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:56,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:56,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1888191620, now seen corresponding path program 1 times [2025-03-04 01:02:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927712147] [2025-03-04 01:02:56,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:56,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:56,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:56,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:56,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:57,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927712147] [2025-03-04 01:02:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927712147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:57,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:02:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020792437] [2025-03-04 01:02:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:57,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:02:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:57,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:02:57,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:02:57,171 INFO L87 Difference]: Start difference. First operand 230 states and 306 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:57,301 INFO L93 Difference]: Finished difference Result 501 states and 665 transitions. [2025-03-04 01:02:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:02:57,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:02:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:57,303 INFO L225 Difference]: With dead ends: 501 [2025-03-04 01:02:57,303 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 01:02:57,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:02:57,304 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 62 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:57,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 572 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 01:02:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2025-03-04 01:02:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 231 states have (on average 1.277056277056277) internal successors, (295), 233 states have internal predecessors, (295), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:02:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 359 transitions. [2025-03-04 01:02:57,324 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 359 transitions. Word has length 135 [2025-03-04 01:02:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 359 transitions. [2025-03-04 01:02:57,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:57,324 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 359 transitions. [2025-03-04 01:02:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:02:57,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:57,325 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:57,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:02:57,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:57,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1594788613, now seen corresponding path program 1 times [2025-03-04 01:02:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:57,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991023358] [2025-03-04 01:02:57,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:57,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:57,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:57,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:02:57,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991023358] [2025-03-04 01:02:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991023358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:02:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880066639] [2025-03-04 01:02:57,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:57,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:02:57,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:57,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:02:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:02:57,950 INFO L87 Difference]: Start difference. First operand 271 states and 359 transitions. Second operand has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:58,868 INFO L93 Difference]: Finished difference Result 657 states and 857 transitions. [2025-03-04 01:02:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:02:58,869 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-04 01:02:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:58,871 INFO L225 Difference]: With dead ends: 657 [2025-03-04 01:02:58,871 INFO L226 Difference]: Without dead ends: 389 [2025-03-04 01:02:58,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 01:02:58,872 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 304 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:58,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1470 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:02:58,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-04 01:02:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 352. [2025-03-04 01:02:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 302 states have internal predecessors, (377), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:02:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 459 transitions. [2025-03-04 01:02:58,901 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 459 transitions. Word has length 135 [2025-03-04 01:02:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 459 transitions. [2025-03-04 01:02:58,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 16 states have internal predecessors, (56), 2 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:02:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 459 transitions. [2025-03-04 01:02:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:02:58,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:58,904 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:02:58,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1087059219, now seen corresponding path program 1 times [2025-03-04 01:02:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392170581] [2025-03-04 01:02:58,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:58,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:58,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:58,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:58,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:58,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:02:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392170581] [2025-03-04 01:02:59,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392170581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:59,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:02:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925384381] [2025-03-04 01:02:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:02:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:59,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:02:59,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:02:59,337 INFO L87 Difference]: Start difference. First operand 352 states and 459 transitions. Second operand has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:59,665 INFO L93 Difference]: Finished difference Result 914 states and 1187 transitions. [2025-03-04 01:02:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:02:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-04 01:02:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:59,668 INFO L225 Difference]: With dead ends: 914 [2025-03-04 01:02:59,668 INFO L226 Difference]: Without dead ends: 560 [2025-03-04 01:02:59,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:02:59,669 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 85 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:59,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 962 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:02:59,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-04 01:02:59,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 345. [2025-03-04 01:02:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 292 states have (on average 1.2465753424657535) internal successors, (364), 295 states have internal predecessors, (364), 41 states have call successors, (41), 11 states have call predecessors, (41), 11 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:02:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 446 transitions. [2025-03-04 01:02:59,701 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 446 transitions. Word has length 135 [2025-03-04 01:02:59,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:59,701 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 446 transitions. [2025-03-04 01:02:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 8.833333333333334) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-04 01:02:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 446 transitions. [2025-03-04 01:02:59,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:02:59,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:59,702 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:59,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:02:59,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2098882743, now seen corresponding path program 1 times [2025-03-04 01:02:59,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082527326] [2025-03-04 01:02:59,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:59,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:59,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:02:59,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:02:59,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:59,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:03:00,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082527326] [2025-03-04 01:03:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082527326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994057246] [2025-03-04 01:03:00,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:00,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:00,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:00,007 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:00,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:03:00,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:03:00,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:03:00,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:00,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:00,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:03:00,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:00,155 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 27 treesize of output 11 [2025-03-04 01:03:00,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2025-03-04 01:03:00,259 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 59 treesize of output 45 [2025-03-04 01:03:00,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2025-03-04 01:03:00,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-04 01:03:00,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:00,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 29 [2025-03-04 01:03:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 132 proven. 42 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-04 01:03:00,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:00,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2025-03-04 01:03:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-04 01:03:00,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994057246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:03:00,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:03:00,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2025-03-04 01:03:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010073508] [2025-03-04 01:03:00,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:00,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:03:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:00,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:03:00,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:03:00,552 INFO L87 Difference]: Start difference. First operand 345 states and 446 transitions. Second operand has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-04 01:03:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:01,086 INFO L93 Difference]: Finished difference Result 708 states and 908 transitions. [2025-03-04 01:03:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 01:03:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) Word has length 135 [2025-03-04 01:03:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:01,088 INFO L225 Difference]: With dead ends: 708 [2025-03-04 01:03:01,089 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 01:03:01,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 266 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:03:01,090 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 386 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:01,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 428 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:03:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 01:03:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 349. [2025-03-04 01:03:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 295 states have (on average 1.2372881355932204) internal successors, (365), 298 states have internal predecessors, (365), 41 states have call successors, (41), 12 states have call predecessors, (41), 12 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-04 01:03:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 447 transitions. [2025-03-04 01:03:01,135 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 447 transitions. Word has length 135 [2025-03-04 01:03:01,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:01,135 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 447 transitions. [2025-03-04 01:03:01,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.6) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 3 states have call predecessors, (35), 6 states have call successors, (35) [2025-03-04 01:03:01,136 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 447 transitions. [2025-03-04 01:03:01,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:03:01,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:01,137 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:01,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:03:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:01,338 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1805479736, now seen corresponding path program 1 times [2025-03-04 01:03:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427723370] [2025-03-04 01:03:01,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:01,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:03:01,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:03:01,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:01,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:03:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525860027] [2025-03-04 01:03:01,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:01,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:01,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:01,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:01,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:03:01,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:03:01,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:03:01,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:01,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:01,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-04 01:03:01,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:01,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:03:02,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-04 01:03:02,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:02,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2025-03-04 01:03:02,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 34 treesize of output 16 [2025-03-04 01:03:02,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:03:03,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:03,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 56 [2025-03-04 01:03:03,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2025-03-04 01:03:03,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:03,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 104 [2025-03-04 01:03:04,454 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 172 treesize of output 148 [2025-03-04 01:03:04,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:04,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 170 [2025-03-04 01:03:04,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 84 [2025-03-04 01:03:05,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:05,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 230 [2025-03-04 01:03:06,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:06,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 217 [2025-03-04 01:03:07,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:07,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 234 [2025-03-04 01:03:08,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:08,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 108 [2025-03-04 01:03:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 219 proven. 263 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 01:03:08,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:12,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-03-04 01:03:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427723370] [2025-03-04 01:03:14,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525860027] [2025-03-04 01:03:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525860027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:14,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:14,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2025-03-04 01:03:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037281074] [2025-03-04 01:03:14,381 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:14,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-04 01:03:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:14,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-04 01:03:14,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=3033, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 01:03:14,384 INFO L87 Difference]: Start difference. First operand 349 states and 447 transitions. Second operand has 38 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 35 states have internal predecessors, (80), 10 states have call successors, (17), 6 states have call predecessors, (17), 10 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-04 01:03:23,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:03:39,140 WARN L286 SmtUtils]: Spent 14.84s on a formula simplification. DAG size of input: 134 DAG size of output: 127 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 01:03:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:47,772 INFO L93 Difference]: Finished difference Result 1668 states and 2116 transitions. [2025-03-04 01:03:47,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 01:03:47,775 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 35 states have internal predecessors, (80), 10 states have call successors, (17), 6 states have call predecessors, (17), 10 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) Word has length 135 [2025-03-04 01:03:47,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:47,781 INFO L225 Difference]: With dead ends: 1668 [2025-03-04 01:03:47,781 INFO L226 Difference]: Without dead ends: 1322 [2025-03-04 01:03:47,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=1365, Invalid=7755, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 01:03:47,784 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 766 mSDsluCounter, 2324 mSDsCounter, 0 mSdLazyCounter, 3885 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 4040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 3885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:47,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 2463 Invalid, 4040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 3885 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2025-03-04 01:03:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-03-04 01:03:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 457. [2025-03-04 01:03:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 378 states have (on average 1.2328042328042328) internal successors, (466), 381 states have internal predecessors, (466), 58 states have call successors, (58), 20 states have call predecessors, (58), 20 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-04 01:03:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 582 transitions. [2025-03-04 01:03:47,833 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 582 transitions. Word has length 135 [2025-03-04 01:03:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:47,833 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 582 transitions. [2025-03-04 01:03:47,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 33 states have (on average 2.4242424242424243) internal successors, (80), 35 states have internal predecessors, (80), 10 states have call successors, (17), 6 states have call predecessors, (17), 10 states have return successors, (17), 8 states have call predecessors, (17), 10 states have call successors, (17) [2025-03-04 01:03:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 582 transitions. [2025-03-04 01:03:47,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:03:47,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:47,835 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:47,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 01:03:48,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 961007865, now seen corresponding path program 1 times [2025-03-04 01:03:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:03:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480529922] [2025-03-04 01:03:48,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:03:48,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:03:48,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:03:48,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:48,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:03:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071468028] [2025-03-04 01:03:48,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:48,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:03:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:03:48,087 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:03:48,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:03:48,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:03:48,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:03:48,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:48,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:48,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-04 01:03:48,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:48,423 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 23 treesize of output 3 [2025-03-04 01:03:48,491 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 27 treesize of output 11 [2025-03-04 01:03:48,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:48,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 21 [2025-03-04 01:03:48,675 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 15 treesize of output 1 [2025-03-04 01:03:48,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:03:49,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:49,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 56 [2025-03-04 01:03:49,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2025-03-04 01:03:49,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:49,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 110 [2025-03-04 01:03:50,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 72 [2025-03-04 01:03:51,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:51,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 85 [2025-03-04 01:03:51,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:03:51,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:51,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 41 [2025-03-04 01:03:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 146 proven. 335 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-04 01:03:51,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:03:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480529922] [2025-03-04 01:03:53,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:03:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071468028] [2025-03-04 01:03:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071468028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:53,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:03:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2025-03-04 01:03:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114427843] [2025-03-04 01:03:53,832 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:53,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 01:03:53,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:03:53,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 01:03:53,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1871, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 01:03:53,834 INFO L87 Difference]: Start difference. First operand 457 states and 582 transitions. Second operand has 33 states, 29 states have (on average 2.6551724137931036) internal successors, (77), 31 states have internal predecessors, (77), 9 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (17), 7 states have call predecessors, (17), 9 states have call successors, (17) [2025-03-04 01:03:59,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:04:04,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:04:09,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-04 01:04:17,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]