./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.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 c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:19:38,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:19:38,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:19:38,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:19:38,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:19:38,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:19:38,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:19:38,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:19:38,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:19:38,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:19:38,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:19:38,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:19:38,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:19:38,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:19:38,116 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:19:38,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:19:38,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:19:38,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:19:38,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:19:38,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:19:38,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:19:38,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:19:38,118 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 -> c9ea8f5132fafef47c5cde74633ce85a3773c3d65cff180ef26fe244a046ff77 [2025-03-04 01:19:38,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:19:38,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:19:38,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:19:38,356 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:19:38,357 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:19:38,357 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-62.i [2025-03-04 01:19:39,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb77ea93f/00f8a26bc3484b72a5d2dbd9e39443e5/FLAG51c6c360f [2025-03-04 01:19:39,790 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:19:39,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-62.i [2025-03-04 01:19:39,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb77ea93f/00f8a26bc3484b72a5d2dbd9e39443e5/FLAG51c6c360f [2025-03-04 01:19:39,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb77ea93f/00f8a26bc3484b72a5d2dbd9e39443e5 [2025-03-04 01:19:39,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:19:39,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:19:39,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:19:39,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:19:39,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:19:39,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:19:39" (1/1) ... [2025-03-04 01:19:39,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9abcb44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:39, skipping insertion in model container [2025-03-04 01:19:39,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:19:39" (1/1) ... [2025-03-04 01:19:39,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:19:39,923 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-62.i[917,930] [2025-03-04 01:19:39,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:19:39,984 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:19:39,993 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-62.i[917,930] [2025-03-04 01:19:40,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:19:40,038 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:19:40,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40 WrapperNode [2025-03-04 01:19:40,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:19:40,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:19:40,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:19:40,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:19:40,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,073 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 337 [2025-03-04 01:19:40,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:19:40,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:19:40,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:19:40,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:19:40,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,108 INFO L175 MemorySlicer]: Split 87 memory accesses to 6 slices as follows [2, 10, 29, 26, 4, 16]. 33 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 3, 1, 2]. The 14 writes are split as follows [0, 1, 4, 6, 1, 2]. [2025-03-04 01:19:40,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:19:40,133 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:19:40,133 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:19:40,133 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:19:40,134 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (1/1) ... [2025-03-04 01:19:40,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:19:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:19:40,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:19:40,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:19:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:19:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:19:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:19:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:19:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:19:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:19:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:19:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:19:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:19:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:19:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:19:40,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:19:40,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:19:40,496 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem40#1;havoc property_#t~mem41#1;havoc property_#t~ite48#1;havoc property_#t~mem42#1;havoc property_#t~mem47#1;havoc property_#t~mem43#1;havoc property_#t~ite46#1;havoc property_#t~mem44#1;havoc property_#t~mem45#1;havoc property_#t~short49#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~ite59#1;havoc property_#t~mem52#1;havoc property_#t~ite58#1;havoc property_#t~mem53#1;havoc property_#t~mem54#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~short60#1;havoc property_#t~mem61#1;havoc property_#t~ite75#1;havoc property_#t~mem62#1;havoc property_#t~ite71#1;havoc property_#t~mem65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem66#1;havoc property_#t~ite70#1;havoc property_#t~mem67#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~short76#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~short82#1; [2025-03-04 01:19:40,526 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-04 01:19:40,526 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:19:40,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:19:40,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:19:40,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:19:40 BoogieIcfgContainer [2025-03-04 01:19:40,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:19:40,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:19:40,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:19:40,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:19:40,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:19:39" (1/3) ... [2025-03-04 01:19:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57916e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:19:40, skipping insertion in model container [2025-03-04 01:19:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:19:40" (2/3) ... [2025-03-04 01:19:40,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57916e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:19:40, skipping insertion in model container [2025-03-04 01:19:40,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:19:40" (3/3) ... [2025-03-04 01:19:40,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-62.i [2025-03-04 01:19:40,549 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:19:40,551 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-62.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:19:40,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:19:40,598 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;@79c47fb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:19:40,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:19:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:19:40,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:40,607 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:40,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash 796589395, now seen corresponding path program 1 times [2025-03-04 01:19:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:40,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145526177] [2025-03-04 01:19:40,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:40,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:19:40,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:19:40,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:40,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 01:19:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145526177] [2025-03-04 01:19:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145526177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547807547] [2025-03-04 01:19:40,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:40,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:40,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:19:40,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:19:40,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:19:40,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:19:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:19:40,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:40,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:40,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:19:41,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-04 01:19:41,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:19:41,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547807547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:41,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:19:41,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:19:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19783816] [2025-03-04 01:19:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:41,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:19:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:41,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:19:41,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:19:41,036 INFO L87 Difference]: Start difference. First operand has 72 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:41,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:41,051 INFO L93 Difference]: Finished difference Result 138 states and 207 transitions. [2025-03-04 01:19:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:19:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-04 01:19:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:41,057 INFO L225 Difference]: With dead ends: 138 [2025-03-04 01:19:41,057 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 01:19:41,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:19:41,061 INFO L435 NwaCegarLoop]: 97 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, 97 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-04 01:19:41,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 01:19:41,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 01:19:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-03-04 01:19:41,089 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 73 [2025-03-04 01:19:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:41,089 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-03-04 01:19:41,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-03-04 01:19:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:19:41,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:41,091 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:41,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:19:41,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:19:41,293 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:41,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:41,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1810307403, now seen corresponding path program 1 times [2025-03-04 01:19:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:41,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990106316] [2025-03-04 01:19:41,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:41,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:19:41,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:19:41,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:41,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:41,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990106316] [2025-03-04 01:19:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990106316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:19:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936025649] [2025-03-04 01:19:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:41,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:19:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:41,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:19:41,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:19:41,502 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:41,536 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2025-03-04 01:19:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:19:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-04 01:19:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:41,539 INFO L225 Difference]: With dead ends: 138 [2025-03-04 01:19:41,539 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 01:19:41,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:19:41,541 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:41,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 01:19:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2025-03-04 01:19:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-03-04 01:19:41,550 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 73 [2025-03-04 01:19:41,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:41,552 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-03-04 01:19:41,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-03-04 01:19:41,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:19:41,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:41,554 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:41,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:19:41,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:41,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1597156212, now seen corresponding path program 1 times [2025-03-04 01:19:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:41,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403917451] [2025-03-04 01:19:41,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:41,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:19:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:19:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403917451] [2025-03-04 01:19:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403917451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:19:41,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433796297] [2025-03-04 01:19:41,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:41,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:19:41,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:41,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:19:41,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:19:41,707 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:41,733 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2025-03-04 01:19:41,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:19:41,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-04 01:19:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:41,737 INFO L225 Difference]: With dead ends: 142 [2025-03-04 01:19:41,737 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 01:19:41,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:19:41,738 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:41,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 274 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 01:19:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-04 01:19:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2025-03-04 01:19:41,747 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 73 [2025-03-04 01:19:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:41,748 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2025-03-04 01:19:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2025-03-04 01:19:41,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 01:19:41,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:41,749 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:41,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:19:41,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:41,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1596232691, now seen corresponding path program 1 times [2025-03-04 01:19:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362692533] [2025-03-04 01:19:41,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:41,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 01:19:41,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 01:19:41,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:41,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362692533] [2025-03-04 01:19:42,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362692533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:42,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:42,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:19:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316137695] [2025-03-04 01:19:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:42,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:19:42,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:42,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:19:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:19:42,094 INFO L87 Difference]: Start difference. First operand 73 states and 101 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:42,192 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2025-03-04 01:19:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2025-03-04 01:19:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:42,194 INFO L225 Difference]: With dead ends: 153 [2025-03-04 01:19:42,194 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:19:42,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:19:42,195 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 194 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:42,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 187 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:19:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2025-03-04 01:19:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 70 states have internal predecessors, (90), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2025-03-04 01:19:42,202 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 73 [2025-03-04 01:19:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:42,202 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2025-03-04 01:19:42,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2025-03-04 01:19:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 01:19:42,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:42,203 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:42,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:19:42,203 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:42,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1207500789, now seen corresponding path program 1 times [2025-03-04 01:19:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:42,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006026328] [2025-03-04 01:19:42,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:42,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 01:19:42,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 01:19:42,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:42,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:42,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:42,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006026328] [2025-03-04 01:19:42,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006026328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:42,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:42,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:19:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361213484] [2025-03-04 01:19:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:42,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:19:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:42,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:19:42,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:19:42,419 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:42,525 INFO L93 Difference]: Finished difference Result 209 states and 280 transitions. [2025-03-04 01:19:42,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:19:42,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 75 [2025-03-04 01:19:42,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:42,528 INFO L225 Difference]: With dead ends: 209 [2025-03-04 01:19:42,528 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 01:19:42,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:19:42,529 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 60 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:42,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 522 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 01:19:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2025-03-04 01:19:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 80 states have internal predecessors, (104), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2025-03-04 01:19:42,539 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 75 [2025-03-04 01:19:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2025-03-04 01:19:42,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2025-03-04 01:19:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 01:19:42,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:42,540 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:19:42,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:42,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1976622418, now seen corresponding path program 1 times [2025-03-04 01:19:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054240999] [2025-03-04 01:19:42,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:42,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 01:19:42,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 01:19:42,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054240999] [2025-03-04 01:19:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054240999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:42,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940434875] [2025-03-04 01:19:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:42,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:42,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:42,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:42,777 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:42,867 INFO L93 Difference]: Finished difference Result 211 states and 284 transitions. [2025-03-04 01:19:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-04 01:19:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:42,870 INFO L225 Difference]: With dead ends: 211 [2025-03-04 01:19:42,871 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:19:42,872 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-04 01:19:42,873 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:42,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 481 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:42,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:19:42,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2025-03-04 01:19:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 80 states have internal predecessors, (103), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2025-03-04 01:19:42,895 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 77 [2025-03-04 01:19:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2025-03-04 01:19:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2025-03-04 01:19:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 01:19:42,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:42,897 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:42,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:19:42,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:42,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1791990686, now seen corresponding path program 1 times [2025-03-04 01:19:42,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:42,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724874660] [2025-03-04 01:19:42,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:42,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 01:19:42,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 01:19:42,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:42,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:19:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724874660] [2025-03-04 01:19:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724874660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976780281] [2025-03-04 01:19:43,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:19:43,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:19:43,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:19:43,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 01:19:43,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 01:19:43,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:43,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:43,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:19:43,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:43,249 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:43,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:19:43,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976780281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:43,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:19:43,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:19:43,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599718087] [2025-03-04 01:19:43,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:43,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:43,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:43,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:19:43,252 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:43,290 INFO L93 Difference]: Finished difference Result 179 states and 240 transitions. [2025-03-04 01:19:43,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-04 01:19:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:43,291 INFO L225 Difference]: With dead ends: 179 [2025-03-04 01:19:43,292 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:19:43,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 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-04 01:19:43,292 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:43,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:19:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:19:43,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 83 states have internal predecessors, (106), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2025-03-04 01:19:43,305 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 77 [2025-03-04 01:19:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2025-03-04 01:19:43,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2025-03-04 01:19:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 01:19:43,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:43,309 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:43,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:19:43,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 01:19:43,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:43,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2110753112, now seen corresponding path program 1 times [2025-03-04 01:19:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:43,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674507657] [2025-03-04 01:19:43,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:43,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 01:19:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 01:19:43,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:43,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:43,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674507657] [2025-03-04 01:19:43,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674507657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:43,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:43,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:43,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310881792] [2025-03-04 01:19:43,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:43,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:43,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:43,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:43,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:43,690 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:43,742 INFO L93 Difference]: Finished difference Result 215 states and 284 transitions. [2025-03-04 01:19:43,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:43,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 77 [2025-03-04 01:19:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:43,743 INFO L225 Difference]: With dead ends: 215 [2025-03-04 01:19:43,743 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:19:43,744 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-04 01:19:43,745 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:43,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 367 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:19:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2025-03-04 01:19:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2025-03-04 01:19:43,762 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 77 [2025-03-04 01:19:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2025-03-04 01:19:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2025-03-04 01:19:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 01:19:43,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:43,763 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:19:43,763 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:43,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1792703627, now seen corresponding path program 1 times [2025-03-04 01:19:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694764986] [2025-03-04 01:19:43,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 01:19:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 01:19:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694764986] [2025-03-04 01:19:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694764986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:45,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:19:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565714636] [2025-03-04 01:19:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:45,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:19:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:45,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:19:45,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:19:45,008 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:19:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:45,972 INFO L93 Difference]: Finished difference Result 240 states and 314 transitions. [2025-03-04 01:19:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:19:45,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 79 [2025-03-04 01:19:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:45,973 INFO L225 Difference]: With dead ends: 240 [2025-03-04 01:19:45,973 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 01:19:45,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:19:45,974 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:45,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 930 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:19:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 01:19:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 105. [2025-03-04 01:19:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 93 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 01:19:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2025-03-04 01:19:45,982 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 79 [2025-03-04 01:19:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:45,982 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2025-03-04 01:19:45,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:19:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2025-03-04 01:19:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 01:19:45,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:45,983 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:45,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:19:45,984 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:45,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:45,984 INFO L85 PathProgramCache]: Analyzing trace with hash -994711860, now seen corresponding path program 1 times [2025-03-04 01:19:45,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:45,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687680473] [2025-03-04 01:19:45,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:45,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 01:19:46,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 01:19:46,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:46,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:46,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:46,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687680473] [2025-03-04 01:19:46,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687680473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:19:46,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659806613] [2025-03-04 01:19:46,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:19:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:46,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:19:46,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:19:46,223 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:46,400 INFO L93 Difference]: Finished difference Result 250 states and 325 transitions. [2025-03-04 01:19:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:19:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2025-03-04 01:19:46,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:46,402 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:19:46,402 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 01:19:46,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:19:46,402 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 130 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:46,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 515 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 01:19:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2025-03-04 01:19:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2921348314606742) internal successors, (115), 89 states have internal predecessors, (115), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-03-04 01:19:46,412 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 79 [2025-03-04 01:19:46,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:46,412 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-03-04 01:19:46,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-03-04 01:19:46,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 01:19:46,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:46,413 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:46,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:19:46,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:46,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:46,414 INFO L85 PathProgramCache]: Analyzing trace with hash -245352662, now seen corresponding path program 1 times [2025-03-04 01:19:46,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:46,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944889719] [2025-03-04 01:19:46,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:46,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:46,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 01:19:46,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 01:19:46,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:46,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:46,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944889719] [2025-03-04 01:19:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944889719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:46,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:19:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310566304] [2025-03-04 01:19:46,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:46,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:19:46,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:46,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:19:46,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:19:46,621 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:46,785 INFO L93 Difference]: Finished difference Result 238 states and 310 transitions. [2025-03-04 01:19:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:19:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-04 01:19:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:46,786 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:19:46,787 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 01:19:46,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:19:46,788 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 263 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:46,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 406 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 01:19:46,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2025-03-04 01:19:46,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2025-03-04 01:19:46,796 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 79 [2025-03-04 01:19:46,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:46,796 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2025-03-04 01:19:46,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2025-03-04 01:19:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 01:19:46,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:46,797 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:46,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:19:46,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:46,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1262199147, now seen corresponding path program 1 times [2025-03-04 01:19:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:46,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354569531] [2025-03-04 01:19:46,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:46,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 01:19:46,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 01:19:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:19:47,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354569531] [2025-03-04 01:19:47,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354569531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:47,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960484518] [2025-03-04 01:19:47,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:47,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:19:47,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:19:47,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:19:47,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 01:19:47,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 01:19:47,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:47,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:47,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 01:19:47,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:48,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:19:48,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:19:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:19:49,356 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 23 treesize of output 11 [2025-03-04 01:19:49,415 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 23 treesize of output 11 [2025-03-04 01:19:49,483 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 23 treesize of output 11 [2025-03-04 01:19:49,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:19:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 01:19:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 3 proven. 92 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 01:19:49,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:19:49,716 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 60 treesize of output 56 [2025-03-04 01:19:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960484518] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:50,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:19:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2025-03-04 01:19:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199915923] [2025-03-04 01:19:50,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:19:50,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 01:19:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:50,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 01:19:50,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:19:50,892 INFO L87 Difference]: Start difference. First operand 100 states and 130 transitions. Second operand has 26 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 01:19:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:51,604 INFO L93 Difference]: Finished difference Result 205 states and 264 transitions. [2025-03-04 01:19:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:19:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) Word has length 79 [2025-03-04 01:19:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:51,605 INFO L225 Difference]: With dead ends: 205 [2025-03-04 01:19:51,605 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:19:51,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=327, Invalid=1313, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 01:19:51,606 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 525 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:51,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 356 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:19:51,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:19:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2025-03-04 01:19:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 01:19:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2025-03-04 01:19:51,614 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 79 [2025-03-04 01:19:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:51,615 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2025-03-04 01:19:51,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.375) internal successors, (81), 24 states have internal predecessors, (81), 8 states have call successors, (16), 5 states have call predecessors, (16), 7 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-04 01:19:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2025-03-04 01:19:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 01:19:51,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:51,616 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:51,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:19:51,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:51,816 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 550814871, now seen corresponding path program 1 times [2025-03-04 01:19:51,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:51,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738384469] [2025-03-04 01:19:51,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 01:19:51,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 01:19:51,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:51,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:52,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:52,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738384469] [2025-03-04 01:19:52,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738384469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:52,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:52,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:19:52,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670840849] [2025-03-04 01:19:52,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:52,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:19:52,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:52,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:19:52,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:19:52,716 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:53,817 INFO L93 Difference]: Finished difference Result 576 states and 714 transitions. [2025-03-04 01:19:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:19:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-04 01:19:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:53,820 INFO L225 Difference]: With dead ends: 576 [2025-03-04 01:19:53,820 INFO L226 Difference]: Without dead ends: 475 [2025-03-04 01:19:53,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:19:53,821 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 882 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:53,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1111 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:19:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-04 01:19:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 219. [2025-03-04 01:19:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 196 states have (on average 1.2448979591836735) internal successors, (244), 196 states have internal predecessors, (244), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:19:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 276 transitions. [2025-03-04 01:19:53,838 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 276 transitions. Word has length 80 [2025-03-04 01:19:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:53,838 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 276 transitions. [2025-03-04 01:19:53,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 276 transitions. [2025-03-04 01:19:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 01:19:53,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:53,839 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:53,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:19:53,839 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:53,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1952889544, now seen corresponding path program 1 times [2025-03-04 01:19:53,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:53,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743875915] [2025-03-04 01:19:53,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:53,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 01:19:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 01:19:53,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:53,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:19:53,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743875915] [2025-03-04 01:19:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743875915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:19:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081310557] [2025-03-04 01:19:53,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:53,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:53,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:19:53,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:19:53,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:19:53,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 01:19:54,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 01:19:54,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:54,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:54,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:19:54,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:19:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:54,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:19:54,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081310557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:54,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:19:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-04 01:19:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922858758] [2025-03-04 01:19:54,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:54,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:19:54,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:54,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:19:54,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:19:54,051 INFO L87 Difference]: Start difference. First operand 219 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:54,089 INFO L93 Difference]: Finished difference Result 443 states and 559 transitions. [2025-03-04 01:19:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:19:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-04 01:19:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:54,090 INFO L225 Difference]: With dead ends: 443 [2025-03-04 01:19:54,090 INFO L226 Difference]: Without dead ends: 227 [2025-03-04 01:19:54,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 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-04 01:19:54,091 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:54,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-04 01:19:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2025-03-04 01:19:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 198 states have (on average 1.2424242424242424) internal successors, (246), 198 states have internal predecessors, (246), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:19:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 278 transitions. [2025-03-04 01:19:54,109 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 278 transitions. Word has length 80 [2025-03-04 01:19:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:54,110 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 278 transitions. [2025-03-04 01:19:54,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 278 transitions. [2025-03-04 01:19:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 01:19:54,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:54,111 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:54,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:19:54,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:19:54,315 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:54,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 735479975, now seen corresponding path program 1 times [2025-03-04 01:19:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:54,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135150875] [2025-03-04 01:19:54,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:54,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:54,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 01:19:54,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 01:19:54,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:54,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:54,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135150875] [2025-03-04 01:19:54,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135150875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:54,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:54,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834220417] [2025-03-04 01:19:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:54,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:54,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:54,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:54,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:54,391 INFO L87 Difference]: Start difference. First operand 221 states and 278 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:54,480 INFO L93 Difference]: Finished difference Result 439 states and 553 transitions. [2025-03-04 01:19:54,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 80 [2025-03-04 01:19:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:54,482 INFO L225 Difference]: With dead ends: 439 [2025-03-04 01:19:54,482 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 01:19:54,482 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-04 01:19:54,483 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 53 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:54,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 218 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 01:19:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-04 01:19:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 198 states have (on average 1.2323232323232323) internal successors, (244), 198 states have internal predecessors, (244), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:19:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 276 transitions. [2025-03-04 01:19:54,500 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 276 transitions. Word has length 80 [2025-03-04 01:19:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:54,502 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 276 transitions. [2025-03-04 01:19:54,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:54,502 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 276 transitions. [2025-03-04 01:19:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 01:19:54,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:54,503 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:54,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:19:54,503 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:54,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:54,503 INFO L85 PathProgramCache]: Analyzing trace with hash -788634455, now seen corresponding path program 1 times [2025-03-04 01:19:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193420472] [2025-03-04 01:19:54,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:54,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 01:19:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 01:19:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193420472] [2025-03-04 01:19:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193420472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:55,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:19:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920198929] [2025-03-04 01:19:55,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:19:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:55,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:19:55,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:19:55,303 INFO L87 Difference]: Start difference. First operand 221 states and 276 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:56,535 INFO L93 Difference]: Finished difference Result 677 states and 833 transitions. [2025-03-04 01:19:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:19:56,536 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-03-04 01:19:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:56,538 INFO L225 Difference]: With dead ends: 677 [2025-03-04 01:19:56,538 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 01:19:56,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2025-03-04 01:19:56,539 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 598 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:56,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1411 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:19:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 01:19:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 208. [2025-03-04 01:19:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.227027027027027) internal successors, (227), 185 states have internal predecessors, (227), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:19:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 259 transitions. [2025-03-04 01:19:56,556 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 259 transitions. Word has length 81 [2025-03-04 01:19:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:56,557 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 259 transitions. [2025-03-04 01:19:56,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 259 transitions. [2025-03-04 01:19:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 01:19:56,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:56,558 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:56,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:19:56,558 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:56,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:56,558 INFO L85 PathProgramCache]: Analyzing trace with hash -858535626, now seen corresponding path program 1 times [2025-03-04 01:19:56,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:56,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949406953] [2025-03-04 01:19:56,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:56,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:56,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 01:19:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 01:19:56,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:56,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:56,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949406953] [2025-03-04 01:19:56,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949406953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:56,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:56,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:56,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309601681] [2025-03-04 01:19:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:56,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:56,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:56,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:56,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:56,646 INFO L87 Difference]: Start difference. First operand 208 states and 259 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:56,696 INFO L93 Difference]: Finished difference Result 485 states and 604 transitions. [2025-03-04 01:19:56,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:56,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 82 [2025-03-04 01:19:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:56,698 INFO L225 Difference]: With dead ends: 485 [2025-03-04 01:19:56,700 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:19:56,700 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-04 01:19:56,700 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:56,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 329 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:19:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 208. [2025-03-04 01:19:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.2162162162162162) internal successors, (225), 185 states have internal predecessors, (225), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:19:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 257 transitions. [2025-03-04 01:19:56,719 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 257 transitions. Word has length 82 [2025-03-04 01:19:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:56,719 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 257 transitions. [2025-03-04 01:19:56,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 257 transitions. [2025-03-04 01:19:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 01:19:56,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:56,721 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:56,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:19:56,721 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1378705283, now seen corresponding path program 1 times [2025-03-04 01:19:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919062365] [2025-03-04 01:19:56,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:56,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 01:19:56,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 01:19:56,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:56,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:57,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919062365] [2025-03-04 01:19:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919062365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:57,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:19:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507533677] [2025-03-04 01:19:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:57,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:19:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:57,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:19:57,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:19:57,048 INFO L87 Difference]: Start difference. First operand 208 states and 257 transitions. Second operand has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:19:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:57,380 INFO L93 Difference]: Finished difference Result 528 states and 644 transitions. [2025-03-04 01:19:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:19:57,380 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-03-04 01:19:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:57,382 INFO L225 Difference]: With dead ends: 528 [2025-03-04 01:19:57,382 INFO L226 Difference]: Without dead ends: 323 [2025-03-04 01:19:57,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:19:57,383 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 171 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:57,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 597 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-04 01:19:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 307. [2025-03-04 01:19:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 266 states have (on average 1.1879699248120301) internal successors, (316), 268 states have internal predecessors, (316), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:19:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 372 transitions. [2025-03-04 01:19:57,420 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 372 transitions. Word has length 83 [2025-03-04 01:19:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:57,420 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 372 transitions. [2025-03-04 01:19:57,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.181818181818182) internal successors, (46), 12 states have internal predecessors, (46), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:19:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 372 transitions. [2025-03-04 01:19:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 01:19:57,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:57,421 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:57,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:19:57,421 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1622723162, now seen corresponding path program 1 times [2025-03-04 01:19:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534828110] [2025-03-04 01:19:57,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:57,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:57,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 01:19:57,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 01:19:57,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:57,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:57,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:57,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534828110] [2025-03-04 01:19:57,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534828110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362874919] [2025-03-04 01:19:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:57,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:57,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:57,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:57,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:57,527 INFO L87 Difference]: Start difference. First operand 307 states and 372 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:57,624 INFO L93 Difference]: Finished difference Result 689 states and 841 transitions. [2025-03-04 01:19:57,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:57,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-03-04 01:19:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:57,626 INFO L225 Difference]: With dead ends: 689 [2025-03-04 01:19:57,626 INFO L226 Difference]: Without dead ends: 410 [2025-03-04 01:19:57,627 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-04 01:19:57,627 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:57,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 328 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:19:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-04 01:19:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2025-03-04 01:19:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.1779359430604983) internal successors, (331), 283 states have internal predecessors, (331), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:19:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 387 transitions. [2025-03-04 01:19:57,687 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 387 transitions. Word has length 83 [2025-03-04 01:19:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:57,687 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 387 transitions. [2025-03-04 01:19:57,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 387 transitions. [2025-03-04 01:19:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 01:19:57,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:57,689 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:57,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:19:57,689 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1671497532, now seen corresponding path program 1 times [2025-03-04 01:19:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914345973] [2025-03-04 01:19:57,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 01:19:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 01:19:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:57,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914345973] [2025-03-04 01:19:57,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914345973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:57,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:57,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:19:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825328178] [2025-03-04 01:19:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:57,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:19:57,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:57,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:19:57,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:19:57,770 INFO L87 Difference]: Start difference. First operand 322 states and 387 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:57,889 INFO L93 Difference]: Finished difference Result 718 states and 864 transitions. [2025-03-04 01:19:57,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:19:57,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 83 [2025-03-04 01:19:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:57,891 INFO L225 Difference]: With dead ends: 718 [2025-03-04 01:19:57,891 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 01:19:57,891 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-04 01:19:57,892 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 45 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:57,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 433 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 01:19:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 356. [2025-03-04 01:19:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 315 states have (on average 1.1682539682539683) internal successors, (368), 317 states have internal predecessors, (368), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:19:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 424 transitions. [2025-03-04 01:19:57,935 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 424 transitions. Word has length 83 [2025-03-04 01:19:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:57,935 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 424 transitions. [2025-03-04 01:19:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 424 transitions. [2025-03-04 01:19:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 01:19:57,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:57,937 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:57,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:19:57,937 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1297475480, now seen corresponding path program 1 times [2025-03-04 01:19:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787152390] [2025-03-04 01:19:57,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:57,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 01:19:57,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 01:19:57,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:57,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:58,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787152390] [2025-03-04 01:19:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787152390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:19:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070440789] [2025-03-04 01:19:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:19:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:58,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:19:58,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:19:58,504 INFO L87 Difference]: Start difference. First operand 356 states and 424 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:58,690 INFO L93 Difference]: Finished difference Result 379 states and 446 transitions. [2025-03-04 01:19:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:19:58,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 85 [2025-03-04 01:19:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:58,692 INFO L225 Difference]: With dead ends: 379 [2025-03-04 01:19:58,692 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:19:58,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:19:58,693 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 87 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:58,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 396 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:19:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-04 01:19:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.1591591591591592) internal successors, (386), 335 states have internal predecessors, (386), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:19:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 442 transitions. [2025-03-04 01:19:58,732 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 442 transitions. Word has length 85 [2025-03-04 01:19:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:58,733 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 442 transitions. [2025-03-04 01:19:58,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:19:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 442 transitions. [2025-03-04 01:19:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 01:19:58,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:58,733 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:58,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:19:58,734 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:58,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1298399001, now seen corresponding path program 1 times [2025-03-04 01:19:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:58,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136565847] [2025-03-04 01:19:58,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:58,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:58,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 01:19:58,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 01:19:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136565847] [2025-03-04 01:19:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136565847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:58,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:58,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:19:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014213911] [2025-03-04 01:19:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:58,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:19:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:58,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:19:58,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:19:58,873 INFO L87 Difference]: Start difference. First operand 377 states and 442 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:19:59,024 INFO L93 Difference]: Finished difference Result 726 states and 853 transitions. [2025-03-04 01:19:59,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:19:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-04 01:19:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:19:59,028 INFO L225 Difference]: With dead ends: 726 [2025-03-04 01:19:59,028 INFO L226 Difference]: Without dead ends: 377 [2025-03-04 01:19:59,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:19:59,030 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 180 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:19:59,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 303 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:19:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-04 01:19:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-03-04 01:19:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 333 states have (on average 1.15015015015015) internal successors, (383), 335 states have internal predecessors, (383), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:19:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 439 transitions. [2025-03-04 01:19:59,069 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 439 transitions. Word has length 85 [2025-03-04 01:19:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:19:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 439 transitions. [2025-03-04 01:19:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 01:19:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 439 transitions. [2025-03-04 01:19:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 01:19:59,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:19:59,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:19:59,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:19:59,070 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:19:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:19:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2109064614, now seen corresponding path program 1 times [2025-03-04 01:19:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:19:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502409671] [2025-03-04 01:19:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:19:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:19:59,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 01:19:59,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 01:19:59,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:19:59,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:19:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:19:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:19:59,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502409671] [2025-03-04 01:19:59,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502409671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:19:59,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:19:59,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:19:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124861959] [2025-03-04 01:19:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:19:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:19:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:19:59,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:19:59,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:19:59,858 INFO L87 Difference]: Start difference. First operand 377 states and 439 transitions. Second operand has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:20:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:00,365 INFO L93 Difference]: Finished difference Result 968 states and 1130 transitions. [2025-03-04 01:20:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:20:00,366 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-04 01:20:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:00,368 INFO L225 Difference]: With dead ends: 968 [2025-03-04 01:20:00,368 INFO L226 Difference]: Without dead ends: 619 [2025-03-04 01:20:00,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:20:00,369 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 529 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:00,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 540 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:20:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-04 01:20:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 552. [2025-03-04 01:20:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 508 states have (on average 1.1535433070866141) internal successors, (586), 510 states have internal predecessors, (586), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:20:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 642 transitions. [2025-03-04 01:20:00,413 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 642 transitions. Word has length 85 [2025-03-04 01:20:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 642 transitions. [2025-03-04 01:20:00,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:20:00,414 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 642 transitions. [2025-03-04 01:20:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:20:00,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:00,415 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:00,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:20:00,415 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:00,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1299644720, now seen corresponding path program 1 times [2025-03-04 01:20:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752367546] [2025-03-04 01:20:00,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:00,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:20:00,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:20:00,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:00,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:20:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:00,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752367546] [2025-03-04 01:20:00,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752367546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:20:00,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:20:00,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:20:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528202035] [2025-03-04 01:20:00,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:20:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:00,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:20:00,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:20:00,496 INFO L87 Difference]: Start difference. First operand 552 states and 642 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:00,584 INFO L93 Difference]: Finished difference Result 1155 states and 1343 transitions. [2025-03-04 01:20:00,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:20:00,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 86 [2025-03-04 01:20:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:00,590 INFO L225 Difference]: With dead ends: 1155 [2025-03-04 01:20:00,590 INFO L226 Difference]: Without dead ends: 631 [2025-03-04 01:20:00,590 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-04 01:20:00,591 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 35 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:00,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 424 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:20:00,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-04 01:20:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 470. [2025-03-04 01:20:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 426 states have (on average 1.1408450704225352) internal successors, (486), 428 states have internal predecessors, (486), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:20:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 542 transitions. [2025-03-04 01:20:00,660 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 542 transitions. Word has length 86 [2025-03-04 01:20:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:00,661 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 542 transitions. [2025-03-04 01:20:00,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 542 transitions. [2025-03-04 01:20:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 01:20:00,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:00,662 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:00,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:20:00,662 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:00,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:00,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1440258089, now seen corresponding path program 1 times [2025-03-04 01:20:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:00,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698312919] [2025-03-04 01:20:00,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:00,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:00,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 01:20:00,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 01:20:00,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:00,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:20:00,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:00,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698312919] [2025-03-04 01:20:00,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698312919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:20:00,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:20:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:20:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829270285] [2025-03-04 01:20:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:20:00,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:20:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:20:00,735 INFO L87 Difference]: Start difference. First operand 470 states and 542 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:00,821 INFO L93 Difference]: Finished difference Result 782 states and 902 transitions. [2025-03-04 01:20:00,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:20:00,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 87 [2025-03-04 01:20:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:00,823 INFO L225 Difference]: With dead ends: 782 [2025-03-04 01:20:00,823 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 01:20:00,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:20:00,824 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:00,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:20:00,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 01:20:00,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-04 01:20:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 296 states have (on average 1.125) internal successors, (333), 298 states have internal predecessors, (333), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:20:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 389 transitions. [2025-03-04 01:20:00,865 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 389 transitions. Word has length 87 [2025-03-04 01:20:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:00,865 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 389 transitions. [2025-03-04 01:20:00,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 389 transitions. [2025-03-04 01:20:00,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 01:20:00,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:00,867 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:00,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:20:00,867 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:00,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 664147580, now seen corresponding path program 1 times [2025-03-04 01:20:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:00,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762649470] [2025-03-04 01:20:00,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:00,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:00,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 01:20:00,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 01:20:00,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:00,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:20:01,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762649470] [2025-03-04 01:20:01,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762649470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:20:01,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:20:01,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:20:01,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173105728] [2025-03-04 01:20:01,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:01,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:20:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:01,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:20:01,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:20:01,159 INFO L87 Difference]: Start difference. First operand 340 states and 389 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:20:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:01,435 INFO L93 Difference]: Finished difference Result 823 states and 937 transitions. [2025-03-04 01:20:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:20:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-04 01:20:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:01,437 INFO L225 Difference]: With dead ends: 823 [2025-03-04 01:20:01,437 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 01:20:01,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:20:01,438 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 277 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:01,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 372 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:20:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 01:20:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 465. [2025-03-04 01:20:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 421 states have (on average 1.1235154394299287) internal successors, (473), 423 states have internal predecessors, (473), 28 states have call successors, (28), 15 states have call predecessors, (28), 15 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:20:01,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 529 transitions. [2025-03-04 01:20:01,478 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 529 transitions. Word has length 87 [2025-03-04 01:20:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:01,479 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 529 transitions. [2025-03-04 01:20:01,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 01:20:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 529 transitions. [2025-03-04 01:20:01,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 01:20:01,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:01,480 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:01,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:20:01,481 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:01,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:01,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1322410454, now seen corresponding path program 1 times [2025-03-04 01:20:01,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:01,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553823085] [2025-03-04 01:20:01,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:01,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:01,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 01:20:01,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 01:20:01,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:01,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-04 01:20:02,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553823085] [2025-03-04 01:20:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553823085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:20:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:20:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:20:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749249487] [2025-03-04 01:20:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:02,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:20:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:02,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:20:02,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:20:02,356 INFO L87 Difference]: Start difference. First operand 465 states and 529 transitions. Second operand has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 01:20:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:03,286 INFO L93 Difference]: Finished difference Result 936 states and 1061 transitions. [2025-03-04 01:20:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:20:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-03-04 01:20:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:03,289 INFO L225 Difference]: With dead ends: 936 [2025-03-04 01:20:03,289 INFO L226 Difference]: Without dead ends: 499 [2025-03-04 01:20:03,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1018, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:20:03,290 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 365 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:03,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 570 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:20:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-04 01:20:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 371. [2025-03-04 01:20:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 335 states have (on average 1.128358208955224) internal successors, (378), 336 states have internal predecessors, (378), 22 states have call successors, (22), 13 states have call predecessors, (22), 13 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:20:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 422 transitions. [2025-03-04 01:20:03,324 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 422 transitions. Word has length 88 [2025-03-04 01:20:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:03,324 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 422 transitions. [2025-03-04 01:20:03,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.375) internal successors, (54), 17 states have internal predecessors, (54), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 01:20:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 422 transitions. [2025-03-04 01:20:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:20:03,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:03,325 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:03,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:20:03,326 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1729681267, now seen corresponding path program 1 times [2025-03-04 01:20:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625312588] [2025-03-04 01:20:03,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:03,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:20:03,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:20:03,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:03,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:03,392 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:20:03,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625312588] [2025-03-04 01:20:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625312588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:20:03,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:20:03,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:20:03,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68755659] [2025-03-04 01:20:03,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:03,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:20:03,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:03,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:20:03,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:20:03,394 INFO L87 Difference]: Start difference. First operand 371 states and 422 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:03,466 INFO L93 Difference]: Finished difference Result 697 states and 791 transitions. [2025-03-04 01:20:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:20:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90 [2025-03-04 01:20:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:03,468 INFO L225 Difference]: With dead ends: 697 [2025-03-04 01:20:03,468 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 01:20:03,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:20:03,469 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:03,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:20:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 01:20:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2025-03-04 01:20:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 318 states have (on average 1.1132075471698113) internal successors, (354), 319 states have internal predecessors, (354), 22 states have call successors, (22), 13 states have call predecessors, (22), 13 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:20:03,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 398 transitions. [2025-03-04 01:20:03,501 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 398 transitions. Word has length 90 [2025-03-04 01:20:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:03,501 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 398 transitions. [2025-03-04 01:20:03,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 398 transitions. [2025-03-04 01:20:03,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-04 01:20:03,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:20:03,502 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:03,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:20:03,502 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:20:03,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:20:03,503 INFO L85 PathProgramCache]: Analyzing trace with hash -523491007, now seen corresponding path program 1 times [2025-03-04 01:20:03,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:20:03,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360227784] [2025-03-04 01:20:03,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:03,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:20:03,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:20:03,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:20:03,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:03,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-04 01:20:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:20:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360227784] [2025-03-04 01:20:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360227784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:20:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269602765] [2025-03-04 01:20:04,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:20:04,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:20:04,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:20:04,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:20:04,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:20:04,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-04 01:20:04,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-04 01:20:04,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:20:04,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:20:04,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 01:20:04,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:20:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:20:05,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:20:05,961 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 65 treesize of output 41 [2025-03-04 01:20:06,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:20:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:20:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 9 proven. 273 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-04 01:20:06,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:20:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-04 01:20:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269602765] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:20:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:20:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 13] total 29 [2025-03-04 01:20:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042662227] [2025-03-04 01:20:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:20:06,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:20:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:20:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:20:06,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:20:06,536 INFO L87 Difference]: Start difference. First operand 354 states and 398 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:20:06,823 INFO L93 Difference]: Finished difference Result 604 states and 675 transitions. [2025-03-04 01:20:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:20:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 162 [2025-03-04 01:20:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:20:06,825 INFO L225 Difference]: With dead ends: 604 [2025-03-04 01:20:06,825 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:20:06,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:20:06,830 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 39 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:20:06,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 742 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:20:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:20:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:20:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:20:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:20:06,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2025-03-04 01:20:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:20:06,831 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:20:06,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 01:20:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:20:06,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:20:06,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:20:06,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 01:20:07,033 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,SelfDestructingSolverStorable28 [2025-03-04 01:20:07,036 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:20:07,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.