./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.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 62cd8631d3c7dbcc2748663d6a0cde2e3de4d2e71baf8db333c770b90174d49b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:36:00,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:36:00,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:36:00,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:36:00,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:36:00,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:36:00,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:36:00,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:36:00,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:36:00,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:36:00,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:36:00,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:36:00,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:36:00,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:36:00,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:36:00,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:00,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:36:00,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:36:00,731 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 -> 62cd8631d3c7dbcc2748663d6a0cde2e3de4d2e71baf8db333c770b90174d49b [2025-03-17 05:36:01,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:36:01,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:36:01,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:36:01,075 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:36:01,075 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:36:01,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.i [2025-03-17 05:36:02,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc1b9b72/5fd26a8acd4e4046a3c336b5aa9fd878/FLAG111f007d1 [2025-03-17 05:36:02,475 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:36:02,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-53.i [2025-03-17 05:36:02,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc1b9b72/5fd26a8acd4e4046a3c336b5aa9fd878/FLAG111f007d1 [2025-03-17 05:36:02,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc1b9b72/5fd26a8acd4e4046a3c336b5aa9fd878 [2025-03-17 05:36:02,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:36:02,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:36:02,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:02,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:36:02,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:36:02,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:02" (1/1) ... [2025-03-17 05:36:02,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9aec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:02, skipping insertion in model container [2025-03-17 05:36:02,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:02" (1/1) ... [2025-03-17 05:36:02,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:36:02,917 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-ap_file-53.i[917,930] [2025-03-17 05:36:02,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:02,971 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:36:02,978 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-ap_file-53.i[917,930] [2025-03-17 05:36:03,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:03,026 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:36:03,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03 WrapperNode [2025-03-17 05:36:03,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:03,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:03,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:36:03,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:36:03,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,087 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 503 [2025-03-17 05:36:03,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:03,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:36:03,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:36:03,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:36:03,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,122 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2025-03-17 05:36:03,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,137 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:36:03,156 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:36:03,156 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:36:03,156 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:36:03,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (1/1) ... [2025-03-17 05:36:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:03,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:03,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:36:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:36:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:36:03,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:36:03,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:36:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:36:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:36:03,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:36:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:36:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:36:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:36:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:36:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:36:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:36:03,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:36:03,325 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:36:03,327 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:36:03,682 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-03-17 05:36:03,728 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-17 05:36:03,728 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:36:03,738 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:36:03,739 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:36:03,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:03 BoogieIcfgContainer [2025-03-17 05:36:03,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:36:03,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:36:03,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:36:03,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:36:03,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:36:02" (1/3) ... [2025-03-17 05:36:03,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5060fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:03, skipping insertion in model container [2025-03-17 05:36:03,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:03" (2/3) ... [2025-03-17 05:36:03,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5060fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:03, skipping insertion in model container [2025-03-17 05:36:03,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:03" (3/3) ... [2025-03-17 05:36:03,745 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-53.i [2025-03-17 05:36:03,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:36:03,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-53.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:36:03,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:36:03,810 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;@2509ba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:36:03,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:36:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:36:03,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:03,824 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:03,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:03,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1859638921, now seen corresponding path program 1 times [2025-03-17 05:36:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290506422] [2025-03-17 05:36:03,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:03,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:03,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:03,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:36:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290506422] [2025-03-17 05:36:04,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290506422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:04,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420955806] [2025-03-17 05:36:04,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:04,104 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-17 05:36:04,106 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-17 05:36:04,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:04,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:04,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:04,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:04,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:36:04,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 05:36:04,365 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:04,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420955806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:04,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:04,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:36:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034617830] [2025-03-17 05:36:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:04,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:36:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:04,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:36:04,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:04,393 INFO L87 Difference]: Start difference. First operand has 106 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:04,413 INFO L93 Difference]: Finished difference Result 209 states and 330 transitions. [2025-03-17 05:36:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:36:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:36:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:04,419 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:36:04,419 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:36:04,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:04,423 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:04,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:36:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:36:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2025-03-17 05:36:04,459 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 136 [2025-03-17 05:36:04,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:04,459 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2025-03-17 05:36:04,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2025-03-17 05:36:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:36:04,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:04,465 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:04,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:04,666 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-17 05:36:04,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash 989962695, now seen corresponding path program 1 times [2025-03-17 05:36:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608629128] [2025-03-17 05:36:04,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:04,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:04,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:04,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:04,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:05,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:05,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608629128] [2025-03-17 05:36:05,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608629128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:05,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:05,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:36:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773614612] [2025-03-17 05:36:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:05,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:36:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:05,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:36:05,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:05,125 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:05,149 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2025-03-17 05:36:05,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:36:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2025-03-17 05:36:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:05,152 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:36:05,152 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:36:05,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:05,155 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:05,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:36:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:36:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2025-03-17 05:36:05,169 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 136 [2025-03-17 05:36:05,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:05,170 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2025-03-17 05:36:05,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2025-03-17 05:36:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:36:05,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:05,173 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:05,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:36:05,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 479428518, now seen corresponding path program 1 times [2025-03-17 05:36:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-03-17 05:36:05,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:05,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:05,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-03-17 05:36:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969585244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:06,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:36:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964573291] [2025-03-17 05:36:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:36:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:36:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:06,599 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:06,890 INFO L93 Difference]: Finished difference Result 209 states and 302 transitions. [2025-03-17 05:36:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:36:06,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:36:06,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:06,892 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:36:06,892 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:36:06,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:06,893 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 277 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:06,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 418 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:36:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-17 05:36:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2025-03-17 05:36:06,910 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 136 [2025-03-17 05:36:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:06,910 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2025-03-17 05:36:06,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2025-03-17 05:36:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:36:06,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:06,912 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:36:06,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1317522841, now seen corresponding path program 1 times [2025-03-17 05:36:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005447529] [2025-03-17 05:36:06,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:06,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:07,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:07,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:07,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:09,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005447529] [2025-03-17 05:36:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005447529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:09,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:09,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221471139] [2025-03-17 05:36:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:09,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:09,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:09,434 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:10,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:10,312 INFO L93 Difference]: Finished difference Result 383 states and 548 transitions. [2025-03-17 05:36:10,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:10,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:36:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:10,317 INFO L225 Difference]: With dead ends: 383 [2025-03-17 05:36:10,317 INFO L226 Difference]: Without dead ends: 278 [2025-03-17 05:36:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:36:10,320 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 209 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:10,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1323 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:36:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-17 05:36:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 271. [2025-03-17 05:36:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 223 states have (on average 1.358744394618834) internal successors, (303), 224 states have internal predecessors, (303), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:36:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 391 transitions. [2025-03-17 05:36:10,364 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 391 transitions. Word has length 136 [2025-03-17 05:36:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:10,365 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 391 transitions. [2025-03-17 05:36:10,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 391 transitions. [2025-03-17 05:36:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:36:10,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:10,368 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:10,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:36:10,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1823081466, now seen corresponding path program 1 times [2025-03-17 05:36:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884961809] [2025-03-17 05:36:10,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:10,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:36:10,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:36:10,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:10,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:11,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884961809] [2025-03-17 05:36:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884961809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:36:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820774784] [2025-03-17 05:36:11,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:11,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:36:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:11,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:36:11,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:11,479 INFO L87 Difference]: Start difference. First operand 271 states and 391 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:12,008 INFO L93 Difference]: Finished difference Result 574 states and 825 transitions. [2025-03-17 05:36:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-17 05:36:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:12,012 INFO L225 Difference]: With dead ends: 574 [2025-03-17 05:36:12,012 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 05:36:12,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:12,013 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 274 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:12,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 940 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 05:36:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 235. [2025-03-17 05:36:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 187 states have (on average 1.3422459893048129) internal successors, (251), 188 states have internal predecessors, (251), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:36:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 339 transitions. [2025-03-17 05:36:12,040 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 339 transitions. Word has length 136 [2025-03-17 05:36:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:12,040 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 339 transitions. [2025-03-17 05:36:12,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 339 transitions. [2025-03-17 05:36:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:36:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:12,041 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:36:12,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1807333398, now seen corresponding path program 1 times [2025-03-17 05:36:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39429655] [2025-03-17 05:36:12,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:36:12,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:36:12,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:12,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:13,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39429655] [2025-03-17 05:36:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39429655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:13,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109879050] [2025-03-17 05:36:13,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:13,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:13,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:13,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:13,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:13,146 INFO L87 Difference]: Start difference. First operand 235 states and 339 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:13,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:13,806 INFO L93 Difference]: Finished difference Result 462 states and 661 transitions. [2025-03-17 05:36:13,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:36:13,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-17 05:36:13,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:13,809 INFO L225 Difference]: With dead ends: 462 [2025-03-17 05:36:13,809 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 05:36:13,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:36:13,810 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 326 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:13,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1256 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:13,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 05:36:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 352. [2025-03-17 05:36:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 277 states have (on average 1.3285198555956679) internal successors, (368), 279 states have internal predecessors, (368), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 504 transitions. [2025-03-17 05:36:13,853 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 504 transitions. Word has length 138 [2025-03-17 05:36:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:13,853 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 504 transitions. [2025-03-17 05:36:13,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2025-03-17 05:36:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:36:13,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:13,855 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:13,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:36:13,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:13,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:13,855 INFO L85 PathProgramCache]: Analyzing trace with hash 630600946, now seen corresponding path program 1 times [2025-03-17 05:36:13,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:13,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886702272] [2025-03-17 05:36:13,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:13,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:13,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:36:13,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:36:13,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:13,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886702272] [2025-03-17 05:36:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886702272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:36:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900392914] [2025-03-17 05:36:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:14,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:36:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:14,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:36:14,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:14,004 INFO L87 Difference]: Start difference. First operand 352 states and 504 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:14,059 INFO L93 Difference]: Finished difference Result 657 states and 940 transitions. [2025-03-17 05:36:14,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:36:14,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:36:14,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:14,062 INFO L225 Difference]: With dead ends: 657 [2025-03-17 05:36:14,062 INFO L226 Difference]: Without dead ends: 352 [2025-03-17 05:36:14,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:36:14,063 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:14,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:14,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-17 05:36:14,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2025-03-17 05:36:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 277 states have (on average 1.3176895306859207) internal successors, (365), 279 states have internal predecessors, (365), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2025-03-17 05:36:14,095 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 141 [2025-03-17 05:36:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:14,096 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2025-03-17 05:36:14,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2025-03-17 05:36:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:36:14,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:14,097 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:14,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:36:14,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:14,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:14,098 INFO L85 PathProgramCache]: Analyzing trace with hash 337197939, now seen corresponding path program 1 times [2025-03-17 05:36:14,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376950571] [2025-03-17 05:36:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:14,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:36:14,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:36:14,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:14,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:14,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:14,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376950571] [2025-03-17 05:36:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376950571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:14,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232992486] [2025-03-17 05:36:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:14,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:14,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:14,308 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:14,435 INFO L93 Difference]: Finished difference Result 875 states and 1242 transitions. [2025-03-17 05:36:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:36:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:14,438 INFO L225 Difference]: With dead ends: 875 [2025-03-17 05:36:14,439 INFO L226 Difference]: Without dead ends: 570 [2025-03-17 05:36:14,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:14,440 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 95 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:14,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 519 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-17 05:36:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 453. [2025-03-17 05:36:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 368 states have (on average 1.3315217391304348) internal successors, (490), 371 states have internal predecessors, (490), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:36:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 642 transitions. [2025-03-17 05:36:14,493 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 642 transitions. Word has length 141 [2025-03-17 05:36:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:14,495 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 642 transitions. [2025-03-17 05:36:14,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 642 transitions. [2025-03-17 05:36:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:36:14,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:14,496 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:14,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:36:14,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:14,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2134149298, now seen corresponding path program 1 times [2025-03-17 05:36:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:14,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-03-17 05:36:14,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:14,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:36:14,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:36:14,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:14,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:14,844 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-03-17 05:36:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732473965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:36:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418477345] [2025-03-17 05:36:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:14,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:14,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:14,846 INFO L87 Difference]: Start difference. First operand 453 states and 642 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:15,061 INFO L93 Difference]: Finished difference Result 1023 states and 1435 transitions. [2025-03-17 05:36:15,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:15,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-03-17 05:36:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:15,064 INFO L225 Difference]: With dead ends: 1023 [2025-03-17 05:36:15,065 INFO L226 Difference]: Without dead ends: 621 [2025-03-17 05:36:15,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:15,066 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 174 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:15,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 642 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-17 05:36:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 515. [2025-03-17 05:36:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 430 states have (on average 1.3093023255813954) internal successors, (563), 433 states have internal predecessors, (563), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:36:15,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 715 transitions. [2025-03-17 05:36:15,112 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 715 transitions. Word has length 141 [2025-03-17 05:36:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:15,113 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 715 transitions. [2025-03-17 05:36:15,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:15,113 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 715 transitions. [2025-03-17 05:36:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:36:15,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:15,114 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:15,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:36:15,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:15,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:15,115 INFO L85 PathProgramCache]: Analyzing trace with hash 505282669, now seen corresponding path program 1 times [2025-03-17 05:36:15,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:15,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092994412] [2025-03-17 05:36:15,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:15,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:36:15,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:36:15,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:15,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092994412] [2025-03-17 05:36:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092994412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:15,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:15,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778119117] [2025-03-17 05:36:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:15,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:15,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:15,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:15,645 INFO L87 Difference]: Start difference. First operand 515 states and 715 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:16,319 INFO L93 Difference]: Finished difference Result 1042 states and 1444 transitions. [2025-03-17 05:36:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-17 05:36:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:16,325 INFO L225 Difference]: With dead ends: 1042 [2025-03-17 05:36:16,325 INFO L226 Difference]: Without dead ends: 578 [2025-03-17 05:36:16,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:36:16,327 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 310 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:16,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1151 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-17 05:36:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 516. [2025-03-17 05:36:16,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 431 states have (on average 1.308584686774942) internal successors, (564), 434 states have internal predecessors, (564), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:36:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 716 transitions. [2025-03-17 05:36:16,394 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 716 transitions. Word has length 142 [2025-03-17 05:36:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:16,394 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 716 transitions. [2025-03-17 05:36:16,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 716 transitions. [2025-03-17 05:36:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:36:16,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:16,397 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:16,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:36:16,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:16,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:16,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492915, now seen corresponding path program 1 times [2025-03-17 05:36:16,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:16,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801705495] [2025-03-17 05:36:16,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:16,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:16,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:36:16,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:36:16,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:16,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801705495] [2025-03-17 05:36:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801705495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:16,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:16,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061489216] [2025-03-17 05:36:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:16,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:16,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:16,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:16,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:16,928 INFO L87 Difference]: Start difference. First operand 516 states and 716 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:17,453 INFO L93 Difference]: Finished difference Result 1044 states and 1446 transitions. [2025-03-17 05:36:17,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:17,453 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 142 [2025-03-17 05:36:17,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:17,456 INFO L225 Difference]: With dead ends: 1044 [2025-03-17 05:36:17,456 INFO L226 Difference]: Without dead ends: 579 [2025-03-17 05:36:17,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:36:17,458 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 215 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:17,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1232 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-03-17 05:36:17,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 516. [2025-03-17 05:36:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 431 states have (on average 1.308584686774942) internal successors, (564), 434 states have internal predecessors, (564), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:36:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 716 transitions. [2025-03-17 05:36:17,500 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 716 transitions. Word has length 142 [2025-03-17 05:36:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:17,500 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 716 transitions. [2025-03-17 05:36:17,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 716 transitions. [2025-03-17 05:36:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 05:36:17,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:17,501 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:17,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:36:17,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash 96458444, now seen corresponding path program 1 times [2025-03-17 05:36:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656190044] [2025-03-17 05:36:17,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:17,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 05:36:17,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 05:36:17,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:17,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:17,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:17,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656190044] [2025-03-17 05:36:17,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656190044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:17,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:17,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877466492] [2025-03-17 05:36:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:17,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:17,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:17,667 INFO L87 Difference]: Start difference. First operand 516 states and 716 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:17,796 INFO L93 Difference]: Finished difference Result 1109 states and 1535 transitions. [2025-03-17 05:36:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-17 05:36:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:17,802 INFO L225 Difference]: With dead ends: 1109 [2025-03-17 05:36:17,802 INFO L226 Difference]: Without dead ends: 644 [2025-03-17 05:36:17,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:17,804 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 94 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:17,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 811 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-17 05:36:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 459. [2025-03-17 05:36:17,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 384 states have internal predecessors, (490), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 626 transitions. [2025-03-17 05:36:17,844 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 626 transitions. Word has length 142 [2025-03-17 05:36:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:17,845 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 626 transitions. [2025-03-17 05:36:17,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 626 transitions. [2025-03-17 05:36:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:36:17,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:17,846 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:17,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:36:17,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:17,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:17,847 INFO L85 PathProgramCache]: Analyzing trace with hash 458439550, now seen corresponding path program 1 times [2025-03-17 05:36:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434974774] [2025-03-17 05:36:17,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:17,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:36:17,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:36:17,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:17,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:36:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434974774] [2025-03-17 05:36:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434974774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:17,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251395395] [2025-03-17 05:36:17,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:17,962 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-17 05:36:17,973 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-17 05:36:18,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:36:18,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:36:18,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:18,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:18,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:36:18,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:18,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251395395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:18,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:36:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060521222] [2025-03-17 05:36:18,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:36:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:18,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:36:18,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:18,189 INFO L87 Difference]: Start difference. First operand 459 states and 626 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:18,257 INFO L93 Difference]: Finished difference Result 879 states and 1196 transitions. [2025-03-17 05:36:18,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:36:18,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:36:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:18,260 INFO L225 Difference]: With dead ends: 879 [2025-03-17 05:36:18,260 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 05:36:18,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:18,261 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:18,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 714 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 05:36:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 462. [2025-03-17 05:36:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 385 states have (on average 1.2805194805194806) internal successors, (493), 387 states have internal predecessors, (493), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 629 transitions. [2025-03-17 05:36:18,304 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 629 transitions. Word has length 143 [2025-03-17 05:36:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:18,305 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 629 transitions. [2025-03-17 05:36:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 629 transitions. [2025-03-17 05:36:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 05:36:18,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:18,307 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:18,314 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-17 05:36:18,512 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,SelfDestructingSolverStorable12 [2025-03-17 05:36:18,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash -654496980, now seen corresponding path program 1 times [2025-03-17 05:36:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185056657] [2025-03-17 05:36:18,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:18,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:36:18,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:36:18,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:18,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:36:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185056657] [2025-03-17 05:36:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185056657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343941335] [2025-03-17 05:36:18,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:18,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:18,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:18,627 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-17 05:36:18,629 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-17 05:36:18,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 05:36:18,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 05:36:18,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:18,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:18,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:36:18,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:18,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343941335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:18,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:36:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149211236] [2025-03-17 05:36:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:18,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:18,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:18,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:18,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:18,831 INFO L87 Difference]: Start difference. First operand 462 states and 629 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:18,880 INFO L93 Difference]: Finished difference Result 882 states and 1199 transitions. [2025-03-17 05:36:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 05:36:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:18,883 INFO L225 Difference]: With dead ends: 882 [2025-03-17 05:36:18,883 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 05:36:18,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:18,884 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:18,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 05:36:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2025-03-17 05:36:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 394 states have (on average 1.2741116751269035) internal successors, (502), 396 states have internal predecessors, (502), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 638 transitions. [2025-03-17 05:36:18,938 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 638 transitions. Word has length 143 [2025-03-17 05:36:18,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:18,938 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 638 transitions. [2025-03-17 05:36:18,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 638 transitions. [2025-03-17 05:36:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:36:18,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:18,940 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:18,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:19,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:19,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:19,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:19,142 INFO L85 PathProgramCache]: Analyzing trace with hash 588818352, now seen corresponding path program 1 times [2025-03-17 05:36:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470913269] [2025-03-17 05:36:19,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:19,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:19,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:36:19,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:36:19,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:19,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:19,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:19,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470913269] [2025-03-17 05:36:19,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470913269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:19,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:19,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451879302] [2025-03-17 05:36:19,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:19,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:19,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:19,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:19,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:19,766 INFO L87 Difference]: Start difference. First operand 471 states and 638 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:20,371 INFO L93 Difference]: Finished difference Result 823 states and 1112 transitions. [2025-03-17 05:36:20,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:36:20,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 05:36:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:20,374 INFO L225 Difference]: With dead ends: 823 [2025-03-17 05:36:20,374 INFO L226 Difference]: Without dead ends: 541 [2025-03-17 05:36:20,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:20,376 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 247 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:20,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1694 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-17 05:36:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 472. [2025-03-17 05:36:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 395 states have (on average 1.2734177215189872) internal successors, (503), 397 states have internal predecessors, (503), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 639 transitions. [2025-03-17 05:36:20,411 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 639 transitions. Word has length 144 [2025-03-17 05:36:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 639 transitions. [2025-03-17 05:36:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 639 transitions. [2025-03-17 05:36:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 05:36:20,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:20,413 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:36:20,414 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1616957232, now seen corresponding path program 1 times [2025-03-17 05:36:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961025716] [2025-03-17 05:36:20,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:20,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:20,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 05:36:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 05:36:20,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961025716] [2025-03-17 05:36:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961025716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:21,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:36:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420037778] [2025-03-17 05:36:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:36:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:21,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:36:21,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:21,718 INFO L87 Difference]: Start difference. First operand 472 states and 639 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:23,404 INFO L93 Difference]: Finished difference Result 824 states and 1112 transitions. [2025-03-17 05:36:23,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:36:23,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 05:36:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:23,407 INFO L225 Difference]: With dead ends: 824 [2025-03-17 05:36:23,407 INFO L226 Difference]: Without dead ends: 541 [2025-03-17 05:36:23,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:36:23,409 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 426 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:23,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 2237 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:36:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-17 05:36:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 471. [2025-03-17 05:36:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 394 states have (on average 1.2715736040609138) internal successors, (501), 396 states have internal predecessors, (501), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 637 transitions. [2025-03-17 05:36:23,449 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 637 transitions. Word has length 144 [2025-03-17 05:36:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:23,450 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 637 transitions. [2025-03-17 05:36:23,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 637 transitions. [2025-03-17 05:36:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:36:23,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:23,451 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:23,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:36:23,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:23,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1206984971, now seen corresponding path program 1 times [2025-03-17 05:36:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732455201] [2025-03-17 05:36:23,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:23,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:36:23,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:36:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:36:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732455201] [2025-03-17 05:36:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732455201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777939733] [2025-03-17 05:36:23,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:23,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:23,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:23,586 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-17 05:36:23,587 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-17 05:36:23,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:36:23,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:36:23,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:23,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:23,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:36:23,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:23,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:23,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777939733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:23,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:23,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-17 05:36:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388090989] [2025-03-17 05:36:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:23,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:36:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:23,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:36:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:23,809 INFO L87 Difference]: Start difference. First operand 471 states and 637 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:23,876 INFO L93 Difference]: Finished difference Result 915 states and 1230 transitions. [2025-03-17 05:36:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:36:23,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:36:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:23,880 INFO L225 Difference]: With dead ends: 915 [2025-03-17 05:36:23,880 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 05:36:23,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:23,882 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:23,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 852 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:23,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 05:36:23,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 474. [2025-03-17 05:36:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 397 states have (on average 1.269521410579345) internal successors, (504), 399 states have internal predecessors, (504), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 640 transitions. [2025-03-17 05:36:23,921 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 640 transitions. Word has length 145 [2025-03-17 05:36:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:23,921 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 640 transitions. [2025-03-17 05:36:23,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 640 transitions. [2025-03-17 05:36:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:36:23,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:23,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:23,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:24,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 05:36:24,123 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:24,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:24,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1603621233, now seen corresponding path program 1 times [2025-03-17 05:36:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:24,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68124690] [2025-03-17 05:36:24,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:24,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:24,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:36:24,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:36:24,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:24,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:25,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68124690] [2025-03-17 05:36:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68124690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326600807] [2025-03-17 05:36:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:25,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:25,210 INFO L87 Difference]: Start difference. First operand 474 states and 640 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:36:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:25,713 INFO L93 Difference]: Finished difference Result 893 states and 1204 transitions. [2025-03-17 05:36:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:36:25,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 145 [2025-03-17 05:36:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:25,716 INFO L225 Difference]: With dead ends: 893 [2025-03-17 05:36:25,716 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 05:36:25,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:25,718 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 350 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:25,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 845 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:36:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 05:36:25,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2025-03-17 05:36:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 391 states have (on average 1.2685421994884911) internal successors, (496), 393 states have internal predecessors, (496), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2025-03-17 05:36:25,764 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 145 [2025-03-17 05:36:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2025-03-17 05:36:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:36:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2025-03-17 05:36:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 05:36:25,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:25,766 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:25,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:36:25,767 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:25,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1562195530, now seen corresponding path program 1 times [2025-03-17 05:36:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565600359] [2025-03-17 05:36:25,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:25,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 05:36:25,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 05:36:25,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:25,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565600359] [2025-03-17 05:36:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565600359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:36:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413554730] [2025-03-17 05:36:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:26,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:36:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:26,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:36:26,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:26,591 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:27,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:27,057 INFO L93 Difference]: Finished difference Result 836 states and 1104 transitions. [2025-03-17 05:36:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:36:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 05:36:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:27,060 INFO L225 Difference]: With dead ends: 836 [2025-03-17 05:36:27,060 INFO L226 Difference]: Without dead ends: 834 [2025-03-17 05:36:27,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:36:27,061 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 257 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:27,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 902 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-17 05:36:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 698. [2025-03-17 05:36:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 621 states have (on average 1.2769726247987117) internal successors, (793), 623 states have internal predecessors, (793), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 929 transitions. [2025-03-17 05:36:27,112 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 929 transitions. Word has length 145 [2025-03-17 05:36:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:27,113 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 929 transitions. [2025-03-17 05:36:27,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 929 transitions. [2025-03-17 05:36:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:27,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:27,114 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:27,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:36:27,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:27,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash 221846636, now seen corresponding path program 1 times [2025-03-17 05:36:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:27,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029889420] [2025-03-17 05:36:27,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:27,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:27,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:27,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:27,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:27,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029889420] [2025-03-17 05:36:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029889420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:27,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:27,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:36:27,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8548452] [2025-03-17 05:36:27,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:27,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:36:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:27,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:36:27,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:27,685 INFO L87 Difference]: Start difference. First operand 698 states and 929 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:36:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:28,290 INFO L93 Difference]: Finished difference Result 1143 states and 1521 transitions. [2025-03-17 05:36:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:36:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2025-03-17 05:36:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:28,293 INFO L225 Difference]: With dead ends: 1143 [2025-03-17 05:36:28,293 INFO L226 Difference]: Without dead ends: 705 [2025-03-17 05:36:28,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:36:28,295 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 289 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:28,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 2051 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-17 05:36:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 696. [2025-03-17 05:36:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 619 states have (on average 1.2778675282714056) internal successors, (791), 621 states have internal predecessors, (791), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 927 transitions. [2025-03-17 05:36:28,356 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 927 transitions. Word has length 147 [2025-03-17 05:36:28,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:28,357 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 927 transitions. [2025-03-17 05:36:28,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 05:36:28,357 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 927 transitions. [2025-03-17 05:36:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:28,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:28,358 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:28,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:36:28,358 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:28,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2108989701, now seen corresponding path program 1 times [2025-03-17 05:36:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:28,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459541004] [2025-03-17 05:36:28,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:28,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:28,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:28,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:28,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:28,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:28,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459541004] [2025-03-17 05:36:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459541004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:36:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937202507] [2025-03-17 05:36:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:28,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:36:28,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:28,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:36:28,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:28,854 INFO L87 Difference]: Start difference. First operand 696 states and 927 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:29,369 INFO L93 Difference]: Finished difference Result 1437 states and 1908 transitions. [2025-03-17 05:36:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:36:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 05:36:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:29,372 INFO L225 Difference]: With dead ends: 1437 [2025-03-17 05:36:29,372 INFO L226 Difference]: Without dead ends: 792 [2025-03-17 05:36:29,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:36:29,374 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 345 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:29,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 816 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:36:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-17 05:36:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 704. [2025-03-17 05:36:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 627 states have (on average 1.2838915470494419) internal successors, (805), 629 states have internal predecessors, (805), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 941 transitions. [2025-03-17 05:36:29,440 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 941 transitions. Word has length 147 [2025-03-17 05:36:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:29,440 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 941 transitions. [2025-03-17 05:36:29,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 941 transitions. [2025-03-17 05:36:29,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:29,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:29,442 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:29,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:36:29,442 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:29,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:29,443 INFO L85 PathProgramCache]: Analyzing trace with hash -835097849, now seen corresponding path program 1 times [2025-03-17 05:36:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018692574] [2025-03-17 05:36:29,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:29,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:29,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:29,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:29,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:36:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018692574] [2025-03-17 05:36:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018692574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:30,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554995579] [2025-03-17 05:36:30,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:30,268 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-17 05:36:30,269 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-17 05:36:30,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:30,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:30,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:30,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:30,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-17 05:36:30,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:31,044 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-17 05:36:31,200 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 25 treesize of output 13 [2025-03-17 05:36:31,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:31,367 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 25 treesize of output 13 [2025-03-17 05:36:31,436 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 17 treesize of output 9 [2025-03-17 05:36:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 85 proven. 227 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-17 05:36:31,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:36:31,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554995579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:31,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:36:31,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2025-03-17 05:36:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232668448] [2025-03-17 05:36:31,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:36:31,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:36:31,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:31,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:36:31,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:36:31,626 INFO L87 Difference]: Start difference. First operand 704 states and 941 transitions. Second operand has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-17 05:36:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:32,923 INFO L93 Difference]: Finished difference Result 1339 states and 1778 transitions. [2025-03-17 05:36:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 05:36:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) Word has length 147 [2025-03-17 05:36:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:32,929 INFO L225 Difference]: With dead ends: 1339 [2025-03-17 05:36:32,929 INFO L226 Difference]: Without dead ends: 686 [2025-03-17 05:36:32,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=376, Invalid=1976, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 05:36:32,932 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 332 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:32,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1413 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:36:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-03-17 05:36:33,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 666. [2025-03-17 05:36:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 585 states have (on average 1.2769230769230768) internal successors, (747), 587 states have internal predecessors, (747), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 883 transitions. [2025-03-17 05:36:33,010 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 883 transitions. Word has length 147 [2025-03-17 05:36:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 883 transitions. [2025-03-17 05:36:33,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 5.190476190476191) internal successors, (109), 23 states have internal predecessors, (109), 9 states have call successors, (36), 4 states have call predecessors, (36), 6 states have return successors, (36), 7 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-17 05:36:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 883 transitions. [2025-03-17 05:36:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:33,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:33,014 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:33,023 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-17 05:36:33,214 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,SelfDestructingSolverStorable21 [2025-03-17 05:36:33,215 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1462077949, now seen corresponding path program 1 times [2025-03-17 05:36:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:33,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127414730] [2025-03-17 05:36:33,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:33,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:33,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:33,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:33,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:33,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:33,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127414730] [2025-03-17 05:36:33,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127414730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:33,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:33,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:36:33,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151953468] [2025-03-17 05:36:33,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:33,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:36:33,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:33,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:36:33,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:33,657 INFO L87 Difference]: Start difference. First operand 666 states and 883 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:34,101 INFO L93 Difference]: Finished difference Result 1371 states and 1813 transitions. [2025-03-17 05:36:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:36:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 05:36:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:34,104 INFO L225 Difference]: With dead ends: 1371 [2025-03-17 05:36:34,104 INFO L226 Difference]: Without dead ends: 760 [2025-03-17 05:36:34,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:36:34,106 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 199 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:34,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1145 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:36:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-17 05:36:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 672. [2025-03-17 05:36:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 591 states have (on average 1.2808798646362098) internal successors, (757), 593 states have internal predecessors, (757), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 05:36:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 893 transitions. [2025-03-17 05:36:34,178 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 893 transitions. Word has length 147 [2025-03-17 05:36:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:34,179 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 893 transitions. [2025-03-17 05:36:34,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 05:36:34,179 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 893 transitions. [2025-03-17 05:36:34,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:34,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:34,180 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:34,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:36:34,180 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:34,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:34,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1558997495, now seen corresponding path program 1 times [2025-03-17 05:36:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555622005] [2025-03-17 05:36:34,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:34,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:34,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:34,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:34,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 87 proven. 48 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-17 05:36:35,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555622005] [2025-03-17 05:36:35,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555622005] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:35,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908220601] [2025-03-17 05:36:35,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:35,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:35,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:35,507 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-17 05:36:35,509 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-17 05:36:35,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:35,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:35,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:35,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:35,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:36:35,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:35,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 05:36:36,346 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-17 05:36:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:36,555 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 25 treesize of output 13 [2025-03-17 05:36:36,642 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 17 treesize of output 9 [2025-03-17 05:36:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 233 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-17 05:36:36,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:36:36,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908220601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:36,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:36:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 24 [2025-03-17 05:36:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958603037] [2025-03-17 05:36:36,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:36:36,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:36:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:36:36,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:36:36,811 INFO L87 Difference]: Start difference. First operand 672 states and 893 transitions. Second operand has 24 states, 19 states have (on average 6.0) internal successors, (114), 20 states have internal predecessors, (114), 10 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 8 states have call predecessors, (36), 10 states have call successors, (36) [2025-03-17 05:36:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:38,890 INFO L93 Difference]: Finished difference Result 939 states and 1216 transitions. [2025-03-17 05:36:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 05:36:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 6.0) internal successors, (114), 20 states have internal predecessors, (114), 10 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 8 states have call predecessors, (36), 10 states have call successors, (36) Word has length 147 [2025-03-17 05:36:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:38,892 INFO L225 Difference]: With dead ends: 939 [2025-03-17 05:36:38,892 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 05:36:38,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=571, Invalid=2621, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 05:36:38,894 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 792 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:38,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1063 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 05:36:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 212. [2025-03-17 05:36:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 185 states have (on average 1.2486486486486486) internal successors, (231), 185 states have internal predecessors, (231), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2025-03-17 05:36:38,942 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 147 [2025-03-17 05:36:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2025-03-17 05:36:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 6.0) internal successors, (114), 20 states have internal predecessors, (114), 10 states have call successors, (36), 4 states have call predecessors, (36), 5 states have return successors, (36), 8 states have call predecessors, (36), 10 states have call successors, (36) [2025-03-17 05:36:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2025-03-17 05:36:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:38,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:38,943 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:38,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:36:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:39,144 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:39,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:39,144 INFO L85 PathProgramCache]: Analyzing trace with hash -904924006, now seen corresponding path program 1 times [2025-03-17 05:36:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854103797] [2025-03-17 05:36:39,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:39,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:39,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:39,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:39,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 05:36:39,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:39,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854103797] [2025-03-17 05:36:39,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854103797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:39,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:39,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:36:39,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310027661] [2025-03-17 05:36:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:39,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:36:39,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:39,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:36:39,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:39,463 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:39,675 INFO L93 Difference]: Finished difference Result 533 states and 673 transitions. [2025-03-17 05:36:39,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-17 05:36:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:39,677 INFO L225 Difference]: With dead ends: 533 [2025-03-17 05:36:39,677 INFO L226 Difference]: Without dead ends: 322 [2025-03-17 05:36:39,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:39,678 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 77 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:39,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 796 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:36:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-17 05:36:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 234. [2025-03-17 05:36:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 207 states have (on average 1.2415458937198067) internal successors, (257), 207 states have internal predecessors, (257), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:36:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2025-03-17 05:36:39,711 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 149 [2025-03-17 05:36:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:39,711 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2025-03-17 05:36:39,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 05:36:39,712 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2025-03-17 05:36:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:36:39,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:39,712 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:36:39,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:36:39,713 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash 579848057, now seen corresponding path program 1 times [2025-03-17 05:36:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:39,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402657531] [2025-03-17 05:36:39,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:39,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:39,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:36:39,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:36:39,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:39,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 05:36:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402657531] [2025-03-17 05:36:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402657531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7463560] [2025-03-17 05:36:40,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:40,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:40,606 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:36:40,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:36:40,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:36:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:36:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 05:36:40,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:40,894 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-17 05:36:41,133 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 25 treesize of output 13 [2025-03-17 05:36:41,281 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 25 treesize of output 13 [2025-03-17 05:36:42,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,113 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 25 treesize of output 20 [2025-03-17 05:36:42,218 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-17 05:36:42,219 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 2 case distinctions, treesize of input 71 treesize of output 66 [2025-03-17 05:36:42,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2025-03-17 05:36:42,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,302 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 28 treesize of output 33 [2025-03-17 05:36:42,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,400 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2025-03-17 05:36:42,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 97 [2025-03-17 05:36:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:42,491 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2025-03-17 05:36:42,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 109 [2025-03-17 05:36:44,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:36:44,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 247 treesize of output 265 [2025-03-17 05:36:44,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:44,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:44,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:44,282 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 05:36:44,283 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 3 case distinctions, treesize of input 28 treesize of output 38 [2025-03-17 05:36:45,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:45,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:45,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:45,158 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 05:36:45,158 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 3 case distinctions, treesize of input 29 treesize of output 39 [2025-03-17 05:36:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:36:45,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:36:45,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 1 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 90 case distinctions, treesize of input 237 treesize of output 877