./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_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 bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:59:43,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:59:43,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:59:43,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:59:43,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:59:43,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:59:43,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:59:43,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:59:43,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:59:43,826 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:59:43,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:59:43,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:59:43,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:59:43,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:59:43,828 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:59:43,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:59:43,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:59:43,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:59:43,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:59:43,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:59:43,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:59:43,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:59:43,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:59:43,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:59:43,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:43,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:59:43,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:59:43,831 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 -> bb431c15a53fac0c4e22be07227ce83ff2546829e87bec0102c153438eba00d8 [2025-03-17 05:59:44,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:59:44,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:59:44,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:59:44,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:59:44,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:59:44,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2025-03-17 05:59:45,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb91160c/84bde95d1afd49ffad8bae7bd3adcf90/FLAGbc535bb43 [2025-03-17 05:59:45,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:59:45,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-62.i [2025-03-17 05:59:45,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb91160c/84bde95d1afd49ffad8bae7bd3adcf90/FLAGbc535bb43 [2025-03-17 05:59:45,891 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb91160c/84bde95d1afd49ffad8bae7bd3adcf90 [2025-03-17 05:59:45,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:59:45,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:59:45,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:45,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:59:45,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:59:45,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:45" (1/1) ... [2025-03-17 05:59:45,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559bdf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:45, skipping insertion in model container [2025-03-17 05:59:45,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:59:45" (1/1) ... [2025-03-17 05:59:45,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:59:46,008 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-s_file-62.i[916,929] [2025-03-17 05:59:46,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:46,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:59:46,051 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-s_file-62.i[916,929] [2025-03-17 05:59:46,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:59:46,093 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:59:46,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46 WrapperNode [2025-03-17 05:59:46,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:59:46,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:46,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:59:46,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:59:46,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,120 INFO L138 Inliner]: procedures = 27, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 320 [2025-03-17 05:59:46,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:59:46,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:59:46,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:59:46,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:59:46,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,154 INFO L175 MemorySlicer]: Split 88 memory accesses to 2 slices as follows [2, 86]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 25 writes are split as follows [0, 25]. [2025-03-17 05:59:46,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:59:46,184 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:59:46,184 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:59:46,184 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:59:46,187 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (1/1) ... [2025-03-17 05:59:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:59:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:46,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:59:46,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:59:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:59:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:59:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:59:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:59:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:59:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:59:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:59:46,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:59:46,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:59:46,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:59:46,542 INFO L1322 $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-17 05:59:46,568 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-03-17 05:59:46,568 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:59:46,577 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:59:46,577 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:59:46,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:46 BoogieIcfgContainer [2025-03-17 05:59:46,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:59:46,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:59:46,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:59:46,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:59:46,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:59:45" (1/3) ... [2025-03-17 05:59:46,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b87879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:46, skipping insertion in model container [2025-03-17 05:59:46,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:59:46" (2/3) ... [2025-03-17 05:59:46,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b87879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:59:46, skipping insertion in model container [2025-03-17 05:59:46,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:46" (3/3) ... [2025-03-17 05:59:46,586 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-62.i [2025-03-17 05:59:46,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:59:46,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-62.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:59:46,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:59:46,654 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;@31e7ded0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:59:46,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:59:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 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-17 05:59:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:59:46,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:46,664 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] [2025-03-17 05:59:46,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash -507155582, now seen corresponding path program 1 times [2025-03-17 05:59:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-17 05:59:46,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:46,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:59:46,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:59:46,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:46,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:46,892 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-17 05:59:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-17 05:59:46,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274432791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:46,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393345377] [2025-03-17 05:59:46,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:46,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:46,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:46,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:59:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:59:47,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:59:47,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:47,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:47,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:59:47,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:47,076 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-17 05:59:47,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393345377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:47,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:59:47,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416631200] [2025-03-17 05:59:47,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:47,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:59:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:47,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:59:47,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:47,101 INFO L87 Difference]: Start difference. First operand has 67 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 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) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-17 05:59:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:47,120 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-17 05:59:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:59:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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 69 [2025-03-17 05:59:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:47,128 INFO L225 Difference]: With dead ends: 131 [2025-03-17 05:59:47,129 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 05:59:47,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:59:47,134 INFO L435 NwaCegarLoop]: 93 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, 93 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:47,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:47,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 05:59:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 05:59:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 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-17 05:59:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2025-03-17 05:59:47,163 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 69 [2025-03-17 05:59:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:47,163 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2025-03-17 05:59:47,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-17 05:59:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2025-03-17 05:59:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:59:47,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:47,166 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] [2025-03-17 05:59:47,173 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-17 05:59:47,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:59:47,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1444286326, now seen corresponding path program 1 times [2025-03-17 05:59:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:47,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-17 05:59:47,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:47,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:59:47,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:59:47,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:47,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:47,606 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-17 05:59:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814029216] [2025-03-17 05:59:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814029216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822197414] [2025-03-17 05:59:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:47,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:47,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:47,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:47,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:47,609 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:47,644 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2025-03-17 05:59:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:47,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 69 [2025-03-17 05:59:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:47,647 INFO L225 Difference]: With dead ends: 132 [2025-03-17 05:59:47,647 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 05:59:47,648 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-17 05:59:47,649 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 259 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-17 05:59:47,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 259 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 05:59:47,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-17 05:59:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 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-17 05:59:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2025-03-17 05:59:47,660 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 69 [2025-03-17 05:59:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:47,661 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2025-03-17 05:59:47,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2025-03-17 05:59:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:59:47,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:47,664 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] [2025-03-17 05:59:47,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:59:47,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -556782645, now seen corresponding path program 1 times [2025-03-17 05:59:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:47,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-17 05:59:47,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:47,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:59:47,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:59:47,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:47,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:47,823 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-17 05:59:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968121297] [2025-03-17 05:59:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968121297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:47,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:47,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449379927] [2025-03-17 05:59:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:47,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:47,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:47,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:47,825 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:47,863 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2025-03-17 05:59:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 69 [2025-03-17 05:59:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:47,865 INFO L225 Difference]: With dead ends: 136 [2025-03-17 05:59:47,865 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 05:59:47,865 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-17 05:59:47,866 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 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-17 05:59:47,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 05:59:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-17 05:59:47,874 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-17 05:59:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2025-03-17 05:59:47,875 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 69 [2025-03-17 05:59:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2025-03-17 05:59:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2025-03-17 05:59:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 05:59:47,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:47,877 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] [2025-03-17 05:59:47,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:59:47,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:47,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -555859124, now seen corresponding path program 1 times [2025-03-17 05:59:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439512883] [2025-03-17 05:59:47,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:47,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-17 05:59:47,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 05:59:47,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:47,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:48,230 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-17 05:59:48,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:48,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439512883] [2025-03-17 05:59:48,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439512883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:48,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:48,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:59:48,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680144215] [2025-03-17 05:59:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:48,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:59:48,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:48,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:59:48,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:59:48,233 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:48,377 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2025-03-17 05:59:48,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:59:48,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 69 [2025-03-17 05:59:48,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:48,378 INFO L225 Difference]: With dead ends: 162 [2025-03-17 05:59:48,378 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:59:48,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:59:48,379 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 77 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:48,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 181 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:59:48,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2025-03-17 05:59:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 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-17 05:59:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2025-03-17 05:59:48,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 69 [2025-03-17 05:59:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:48,391 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2025-03-17 05:59:48,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-17 05:59:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2025-03-17 05:59:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 05:59:48,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:48,392 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] [2025-03-17 05:59:48,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:59:48,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:48,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2135883094, now seen corresponding path program 1 times [2025-03-17 05:59:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:48,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-17 05:59:48,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 05:59:48,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 05:59:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:48,774 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-17 05:59:48,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:48,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951240409] [2025-03-17 05:59:48,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951240409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:48,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:59:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458645959] [2025-03-17 05:59:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:59:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:48,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:59:48,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:59:48,777 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-17 05:59:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:49,092 INFO L93 Difference]: Finished difference Result 208 states and 290 transitions. [2025-03-17 05:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:49,093 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 71 [2025-03-17 05:59:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:49,095 INFO L225 Difference]: With dead ends: 208 [2025-03-17 05:59:49,097 INFO L226 Difference]: Without dead ends: 140 [2025-03-17 05:59:49,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:49,098 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 78 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:49,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 629 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-17 05:59:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 79. [2025-03-17 05:59:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 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-17 05:59:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-03-17 05:59:49,110 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 71 [2025-03-17 05:59:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:49,111 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-03-17 05:59:49,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-17 05:59:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2025-03-17 05:59:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:59:49,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:49,112 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-17 05:59:49,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:59:49,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:49,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:49,113 INFO L85 PathProgramCache]: Analyzing trace with hash -614188447, now seen corresponding path program 1 times [2025-03-17 05:59:49,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:49,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-03-17 05:59:49,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:49,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:59:49,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:59:49,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:49,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:49,275 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-17 05:59:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863839597] [2025-03-17 05:59:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863839597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328842575] [2025-03-17 05:59:49,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:49,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:49,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:49,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:49,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:59:49,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:59:49,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:59:49,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:49,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:49,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:59:49,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:49,434 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-17 05:59:49,434 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:49,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328842575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:49,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:49,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:59:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913450309] [2025-03-17 05:59:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:49,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:49,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:49,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:49,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:49,435 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-17 05:59:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:49,464 INFO L93 Difference]: Finished difference Result 160 states and 223 transitions. [2025-03-17 05:59:49,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:59:49,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-17 05:59:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:49,466 INFO L225 Difference]: With dead ends: 160 [2025-03-17 05:59:49,466 INFO L226 Difference]: Without dead ends: 82 [2025-03-17 05:59:49,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:59:49,469 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 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-17 05:59:49,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-17 05:59:49,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-17 05:59:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.3472222222222223) internal successors, (97), 72 states have internal predecessors, (97), 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-17 05:59:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2025-03-17 05:59:49,479 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 73 [2025-03-17 05:59:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:49,480 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2025-03-17 05:59:49,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-17 05:59:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2025-03-17 05:59:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:59:49,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:49,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] [2025-03-17 05:59:49,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:49,681 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,SelfDestructingSolverStorable5 [2025-03-17 05:59:49,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:49,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:49,682 INFO L85 PathProgramCache]: Analyzing trace with hash -932950873, now seen corresponding path program 1 times [2025-03-17 05:59:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-03-17 05:59:49,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:49,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:59:49,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:59:49,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:49,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:50,323 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-17 05:59:50,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:50,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214223870] [2025-03-17 05:59:50,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214223870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:50,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:50,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934234057] [2025-03-17 05:59:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:50,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:50,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:50,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:50,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:50,325 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:50,501 INFO L93 Difference]: Finished difference Result 195 states and 266 transitions. [2025-03-17 05:59:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:50,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:50,503 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:59:50,503 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:59:50,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:50,504 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:50,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 310 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:59:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2025-03-17 05:59:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 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-17 05:59:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2025-03-17 05:59:50,518 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 73 [2025-03-17 05:59:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:50,519 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2025-03-17 05:59:50,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2025-03-17 05:59:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 05:59:50,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:50,519 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-17 05:59:50,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:59:50,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:50,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash -798820179, now seen corresponding path program 1 times [2025-03-17 05:59:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:50,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519359415] [2025-03-17 05:59:50,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:50,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 05:59:50,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 05:59:50,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:50,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:51,003 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-17 05:59:51,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:51,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519359415] [2025-03-17 05:59:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519359415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882171455] [2025-03-17 05:59:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:51,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:51,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:51,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:51,006 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:51,180 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2025-03-17 05:59:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:51,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:51,181 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:59:51,181 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:59:51,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:51,182 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 94 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:51,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 325 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:59:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 82. [2025-03-17 05:59:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 72 states have internal predecessors, (95), 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-17 05:59:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2025-03-17 05:59:51,187 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 73 [2025-03-17 05:59:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:51,187 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2025-03-17 05:59:51,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (8), 1 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-17 05:59:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2025-03-17 05:59:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:51,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:51,187 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-17 05:59:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:59:51,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1006354777, now seen corresponding path program 1 times [2025-03-17 05:59:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195402599] [2025-03-17 05:59:51,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:51,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:51,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:51,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:51,305 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-17 05:59:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195402599] [2025-03-17 05:59:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195402599] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001183320] [2025-03-17 05:59:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:51,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:51,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:51,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:51,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:59:51,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:51,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:51,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:51,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:51,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:59:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:51,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:51,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2025-03-17 05:59:51,506 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-17 05:59:51,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001183320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 05:59:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410511436] [2025-03-17 05:59:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:59:51,508 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:51,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:51,652 INFO L93 Difference]: Finished difference Result 212 states and 280 transitions. [2025-03-17 05:59:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:59:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:51,654 INFO L225 Difference]: With dead ends: 212 [2025-03-17 05:59:51,654 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 05:59:51,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:59:51,655 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 40 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:51,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 251 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:51,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 05:59:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-17 05:59:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 116 states have internal predecessors, (147), 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-17 05:59:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 167 transitions. [2025-03-17 05:59:51,661 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 167 transitions. Word has length 75 [2025-03-17 05:59:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:51,661 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 167 transitions. [2025-03-17 05:59:51,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 167 transitions. [2025-03-17 05:59:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:51,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:51,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] [2025-03-17 05:59:51,668 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-17 05:59:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:51,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:51,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1682014742, now seen corresponding path program 1 times [2025-03-17 05:59:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646694742] [2025-03-17 05:59:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:51,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:51,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:51,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:51,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:52,623 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-17 05:59:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:52,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646694742] [2025-03-17 05:59:52,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646694742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:52,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:52,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184415937] [2025-03-17 05:59:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:52,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:52,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:52,627 INFO L87 Difference]: Start difference. First operand 128 states and 167 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-17 05:59:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:52,811 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2025-03-17 05:59:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:52,812 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-17 05:59:52,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:52,814 INFO L225 Difference]: With dead ends: 160 [2025-03-17 05:59:52,814 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 05:59:52,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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-17 05:59:52,816 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 65 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:52,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 335 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 05:59:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2025-03-17 05:59:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 122 states have internal predecessors, (153), 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-17 05:59:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2025-03-17 05:59:52,830 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 75 [2025-03-17 05:59:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:52,830 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2025-03-17 05:59:52,830 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-17 05:59:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2025-03-17 05:59:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:52,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:52,831 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-17 05:59:52,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:59:52,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:52,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:52,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1682938263, now seen corresponding path program 1 times [2025-03-17 05:59:52,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:52,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-17 05:59:52,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:52,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:52,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:52,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:52,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:52,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:52,959 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-17 05:59:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945476030] [2025-03-17 05:59:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945476030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:52,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:59:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978765827] [2025-03-17 05:59:52,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:59:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:52,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:59:52,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:59:52,961 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:53,066 INFO L93 Difference]: Finished difference Result 284 states and 367 transitions. [2025-03-17 05:59:53,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:59:53,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:53,068 INFO L225 Difference]: With dead ends: 284 [2025-03-17 05:59:53,068 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 05:59:53,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:53,069 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 54 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:53,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 264 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 05:59:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2025-03-17 05:59:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 132 states have internal predecessors, (160), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 192 transitions. [2025-03-17 05:59:53,075 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 192 transitions. Word has length 75 [2025-03-17 05:59:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:53,075 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 192 transitions. [2025-03-17 05:59:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-17 05:59:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 192 transitions. [2025-03-17 05:59:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:53,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:53,076 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-17 05:59:53,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:59:53,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1724525352, now seen corresponding path program 1 times [2025-03-17 05:59:53,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650034023] [2025-03-17 05:59:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:53,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:53,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:53,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:53,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:53,624 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-17 05:59:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650034023] [2025-03-17 05:59:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650034023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:59:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669278584] [2025-03-17 05:59:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:53,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:59:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:53,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:59:53,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:59:53,626 INFO L87 Difference]: Start difference. First operand 150 states and 192 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:59:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:53,918 INFO L93 Difference]: Finished difference Result 396 states and 502 transitions. [2025-03-17 05:59:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:59:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-17 05:59:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:53,920 INFO L225 Difference]: With dead ends: 396 [2025-03-17 05:59:53,920 INFO L226 Difference]: Without dead ends: 259 [2025-03-17 05:59:53,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:59:53,921 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 44 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:53,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 517 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:53,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-17 05:59:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 215. [2025-03-17 05:59:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.2512820512820513) internal successors, (244), 197 states have internal predecessors, (244), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 276 transitions. [2025-03-17 05:59:53,936 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 276 transitions. Word has length 75 [2025-03-17 05:59:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:53,936 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 276 transitions. [2025-03-17 05:59:53,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 11 states have internal predecessors, (38), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 05:59:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 276 transitions. [2025-03-17 05:59:53,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:53,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:53,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] [2025-03-17 05:59:53,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:59:53,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:53,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:53,938 INFO L85 PathProgramCache]: Analyzing trace with hash -210711062, now seen corresponding path program 1 times [2025-03-17 05:59:53,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:53,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034617830] [2025-03-17 05:59:53,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:53,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:53,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:53,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:53,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:53,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:59:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034617830] [2025-03-17 05:59:54,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034617830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:54,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734162914] [2025-03-17 05:59:54,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:54,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:54,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:59:54,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:54,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:54,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:54,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:59:54,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:54,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:59:54,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-17 05:59:54,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:59:54,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-03-17 05:59:54,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:54,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 13 [2025-03-17 05:59:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-17 05:59:54,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:59:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734162914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:54,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-17 05:59:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325495371] [2025-03-17 05:59:54,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:59:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:59:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:59:54,728 INFO L87 Difference]: Start difference. First operand 215 states and 276 transitions. Second operand has 19 states, 16 states have (on average 4.1875) internal successors, (67), 19 states have internal predecessors, (67), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:59:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:55,163 INFO L93 Difference]: Finished difference Result 430 states and 544 transitions. [2025-03-17 05:59:55,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:59:55,163 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.1875) internal successors, (67), 19 states have internal predecessors, (67), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) Word has length 75 [2025-03-17 05:59:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:55,165 INFO L225 Difference]: With dead ends: 430 [2025-03-17 05:59:55,165 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 05:59:55,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=577, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:59:55,166 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 339 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:55,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 305 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:59:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 05:59:55,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2025-03-17 05:59:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 198 states have (on average 1.2373737373737375) internal successors, (245), 200 states have internal predecessors, (245), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2025-03-17 05:59:55,176 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 75 [2025-03-17 05:59:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:55,177 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2025-03-17 05:59:55,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.1875) internal successors, (67), 19 states have internal predecessors, (67), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:59:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2025-03-17 05:59:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:55,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:55,178 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-17 05:59:55,188 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-17 05:59:55,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:55,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1296840747, now seen corresponding path program 1 times [2025-03-17 05:59:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:55,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977221273] [2025-03-17 05:59:55,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:55,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:55,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:55,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:55,628 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-17 05:59:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977221273] [2025-03-17 05:59:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977221273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941853521] [2025-03-17 05:59:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:55,630 INFO L87 Difference]: Start difference. First operand 219 states and 277 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-17 05:59:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:55,794 INFO L93 Difference]: Finished difference Result 521 states and 654 transitions. [2025-03-17 05:59:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:55,794 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-17 05:59:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:55,795 INFO L225 Difference]: With dead ends: 521 [2025-03-17 05:59:55,795 INFO L226 Difference]: Without dead ends: 307 [2025-03-17 05:59:55,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:55,796 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 52 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:55,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 402 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-17 05:59:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 261. [2025-03-17 05:59:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 239 states have (on average 1.2468619246861925) internal successors, (298), 241 states have internal predecessors, (298), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 330 transitions. [2025-03-17 05:59:55,813 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 330 transitions. Word has length 75 [2025-03-17 05:59:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:55,813 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 330 transitions. [2025-03-17 05:59:55,813 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-17 05:59:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 330 transitions. [2025-03-17 05:59:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-17 05:59:55,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:55,814 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-17 05:59:55,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:59:55,815 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:55,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash -741215542, now seen corresponding path program 1 times [2025-03-17 05:59:55,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:55,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977407993] [2025-03-17 05:59:55,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:55,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:55,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:55,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:55,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:59:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977407993] [2025-03-17 05:59:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977407993] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340376917] [2025-03-17 05:59:56,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:56,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:56,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:59:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-17 05:59:56,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-17 05:59:56,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:56,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:56,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:59:56,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 05:59:56,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:59:56,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:59:56,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:56,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-17 05:59:56,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:56,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2025-03-17 05:59:56,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:56,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-17 05:59:56,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:59:56,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2025-03-17 05:59:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 77 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 05:59:56,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:59:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-17 05:59:56,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340376917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:59:56,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:59:56,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-17 05:59:56,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458415229] [2025-03-17 05:59:56,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:59:56,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:59:56,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:56,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:59:56,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:59:56,621 INFO L87 Difference]: Start difference. First operand 261 states and 330 transitions. Second operand has 19 states, 16 states have (on average 4.8125) internal successors, (77), 19 states have internal predecessors, (77), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-17 05:59:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:56,876 INFO L93 Difference]: Finished difference Result 483 states and 614 transitions. [2025-03-17 05:59:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:59:56,876 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.8125) internal successors, (77), 19 states have internal predecessors, (77), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) Word has length 75 [2025-03-17 05:59:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:56,878 INFO L225 Difference]: With dead ends: 483 [2025-03-17 05:59:56,878 INFO L226 Difference]: Without dead ends: 239 [2025-03-17 05:59:56,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:59:56,879 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 222 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:56,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 200 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:59:56,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-17 05:59:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 231. [2025-03-17 05:59:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 211 states have internal predecessors, (262), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 294 transitions. [2025-03-17 05:59:56,893 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 294 transitions. Word has length 75 [2025-03-17 05:59:56,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:56,893 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 294 transitions. [2025-03-17 05:59:56,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.8125) internal successors, (77), 19 states have internal predecessors, (77), 9 states have call successors, (20), 3 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-17 05:59:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 294 transitions. [2025-03-17 05:59:56,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:59:56,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:56,894 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] [2025-03-17 05:59:56,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:57,096 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,SelfDestructingSolverStorable14 [2025-03-17 05:59:57,096 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 365764530, now seen corresponding path program 1 times [2025-03-17 05:59:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-03-17 05:59:57,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:57,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:57,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:59:57,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:59:57,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:57,182 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-17 05:59:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053009511] [2025-03-17 05:59:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053009511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:59:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110373995] [2025-03-17 05:59:57,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:59:57,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:59:57,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:59:57,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:59:57,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:59:57,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:59:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:57,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:57,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:59:57,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:59:57,314 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-17 05:59:57,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:59:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110373995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:57,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:59:57,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-17 05:59:57,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954524139] [2025-03-17 05:59:57,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:57,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:57,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:57,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:57,316 INFO L87 Difference]: Start difference. First operand 231 states and 294 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-17 05:59:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:57,344 INFO L93 Difference]: Finished difference Result 461 states and 586 transitions. [2025-03-17 05:59:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:57,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 76 [2025-03-17 05:59:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:57,347 INFO L225 Difference]: With dead ends: 461 [2025-03-17 05:59:57,347 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 05:59:57,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:59:57,348 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 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-17 05:59:57,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:59:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 05:59:57,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2025-03-17 05:59:57,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 215 states have internal predecessors, (266), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:57,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 298 transitions. [2025-03-17 05:59:57,366 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 298 transitions. Word has length 76 [2025-03-17 05:59:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 298 transitions. [2025-03-17 05:59:57,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-17 05:59:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 298 transitions. [2025-03-17 05:59:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:59:57,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:57,368 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] [2025-03-17 05:59:57,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:59:57,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 05:59:57,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:57,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 117152655, now seen corresponding path program 1 times [2025-03-17 05:59:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:57,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-03-17 05:59:57,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:57,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:57,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:59:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:59:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:58,247 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-17 05:59:58,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:58,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801957202] [2025-03-17 05:59:58,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801957202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:58,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:58,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:59:58,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390173203] [2025-03-17 05:59:58,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:58,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:59:58,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:58,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:59:58,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:59:58,249 INFO L87 Difference]: Start difference. First operand 235 states and 298 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-17 05:59:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:58,943 INFO L93 Difference]: Finished difference Result 456 states and 576 transitions. [2025-03-17 05:59:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:59:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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 76 [2025-03-17 05:59:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:58,946 INFO L225 Difference]: With dead ends: 456 [2025-03-17 05:59:58,946 INFO L226 Difference]: Without dead ends: 238 [2025-03-17 05:59:58,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:59:58,947 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 115 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:58,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 780 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:59:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-17 05:59:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2025-03-17 05:59:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 213 states have (on average 1.2394366197183098) internal successors, (264), 215 states have internal predecessors, (264), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 296 transitions. [2025-03-17 05:59:58,963 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 296 transitions. Word has length 76 [2025-03-17 05:59:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:58,963 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 296 transitions. [2025-03-17 05:59:58,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 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-17 05:59:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 296 transitions. [2025-03-17 05:59:58,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:59:58,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:58,964 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] [2025-03-17 05:59:58,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:59:58,964 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:58,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:58,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1361917136, now seen corresponding path program 1 times [2025-03-17 05:59:58,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:58,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123908814] [2025-03-17 05:59:58,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:58,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:58,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:59:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:59:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:59:59,154 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-17 05:59:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:59:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123908814] [2025-03-17 05:59:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123908814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:59:59,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:59:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:59:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195066169] [2025-03-17 05:59:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:59:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:59:59,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:59:59,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:59:59,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:59:59,158 INFO L87 Difference]: Start difference. First operand 235 states and 296 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-17 05:59:59,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:59:59,296 INFO L93 Difference]: Finished difference Result 513 states and 644 transitions. [2025-03-17 05:59:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:59:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 76 [2025-03-17 05:59:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:59:59,298 INFO L225 Difference]: With dead ends: 513 [2025-03-17 05:59:59,299 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 05:59:59,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:59:59,299 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:59:59,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 370 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:59:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 05:59:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 235. [2025-03-17 05:59:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 213 states have (on average 1.2300469483568075) internal successors, (262), 215 states have internal predecessors, (262), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:59:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 294 transitions. [2025-03-17 05:59:59,309 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 294 transitions. Word has length 76 [2025-03-17 05:59:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:59:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 294 transitions. [2025-03-17 05:59:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-17 05:59:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 294 transitions. [2025-03-17 05:59:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 05:59:59,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:59:59,312 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] [2025-03-17 05:59:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:59:59,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:59:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:59:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1425498351, now seen corresponding path program 1 times [2025-03-17 05:59:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:59:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814924790] [2025-03-17 05:59:59,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:59:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:59:59,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 05:59:59,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 05:59:59,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:59:59,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:00,048 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-17 06:00:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814924790] [2025-03-17 06:00:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814924790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:00,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 06:00:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632622144] [2025-03-17 06:00:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:00,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 06:00:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:00,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 06:00:00,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:00:00,050 INFO L87 Difference]: Start difference. First operand 235 states and 294 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 2 states have call successors, (8), 1 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-17 06:00:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:01,060 INFO L93 Difference]: Finished difference Result 1154 states and 1416 transitions. [2025-03-17 06:00:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 06:00:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 2 states have call successors, (8), 1 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 76 [2025-03-17 06:00:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:01,066 INFO L225 Difference]: With dead ends: 1154 [2025-03-17 06:00:01,066 INFO L226 Difference]: Without dead ends: 936 [2025-03-17 06:00:01,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1110, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 06:00:01,068 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 507 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:01,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1003 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 06:00:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2025-03-17 06:00:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 477. [2025-03-17 06:00:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 441 states have (on average 1.2358276643990929) internal successors, (545), 444 states have internal predecessors, (545), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 597 transitions. [2025-03-17 06:00:01,094 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 597 transitions. Word has length 76 [2025-03-17 06:00:01,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:01,094 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 597 transitions. [2025-03-17 06:00:01,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 2 states have call successors, (8), 1 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-17 06:00:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 597 transitions. [2025-03-17 06:00:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 06:00:01,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:01,096 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-17 06:00:01,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 06:00:01,097 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1924802200, now seen corresponding path program 1 times [2025-03-17 06:00:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-17 06:00:01,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 06:00:01,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 06:00:01,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:01,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:02,062 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-17 06:00:02,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184314546] [2025-03-17 06:00:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184314546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 06:00:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747261294] [2025-03-17 06:00:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:02,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 06:00:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 06:00:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:00:02,065 INFO L87 Difference]: Start difference. First operand 477 states and 597 transitions. Second operand has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 06:00:03,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:03,719 INFO L93 Difference]: Finished difference Result 1175 states and 1452 transitions. [2025-03-17 06:00:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 06:00:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2025-03-17 06:00:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:03,730 INFO L225 Difference]: With dead ends: 1175 [2025-03-17 06:00:03,732 INFO L226 Difference]: Without dead ends: 715 [2025-03-17 06:00:03,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=1302, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 06:00:03,735 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 475 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:03,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1386 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 06:00:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-17 06:00:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 392. [2025-03-17 06:00:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 358 states have (on average 1.223463687150838) internal successors, (438), 360 states have internal predecessors, (438), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:00:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 486 transitions. [2025-03-17 06:00:03,785 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 486 transitions. Word has length 77 [2025-03-17 06:00:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:03,786 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 486 transitions. [2025-03-17 06:00:03,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 19 states have internal predecessors, (40), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 06:00:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 486 transitions. [2025-03-17 06:00:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 06:00:03,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:03,787 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] [2025-03-17 06:00:03,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 06:00:03,787 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:03,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 463268357, now seen corresponding path program 1 times [2025-03-17 06:00:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131904400] [2025-03-17 06:00:03,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:03,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 06:00:03,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 06:00:03,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:03,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:03,902 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-17 06:00:03,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:03,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131904400] [2025-03-17 06:00:03,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131904400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:03,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:03,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:00:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630736858] [2025-03-17 06:00:03,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:03,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:00:03,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:03,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:00:03,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:00:03,903 INFO L87 Difference]: Start difference. First operand 392 states and 486 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-17 06:00:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:04,004 INFO L93 Difference]: Finished difference Result 657 states and 809 transitions. [2025-03-17 06:00:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:00:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 78 [2025-03-17 06:00:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:04,009 INFO L225 Difference]: With dead ends: 657 [2025-03-17 06:00:04,009 INFO L226 Difference]: Without dead ends: 282 [2025-03-17 06:00:04,014 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-17 06:00:04,014 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:04,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-17 06:00:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-17 06:00:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 248 states have (on average 1.189516129032258) internal successors, (295), 250 states have internal predecessors, (295), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:00:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 343 transitions. [2025-03-17 06:00:04,048 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 343 transitions. Word has length 78 [2025-03-17 06:00:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 343 transitions. [2025-03-17 06:00:04,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-17 06:00:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 343 transitions. [2025-03-17 06:00:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 06:00:04,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:04,049 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] [2025-03-17 06:00:04,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 06:00:04,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2069411311, now seen corresponding path program 1 times [2025-03-17 06:00:04,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-17 06:00:04,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 06:00:04,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 06:00:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:04,285 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-17 06:00:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-17 06:00:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723497505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:00:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52275645] [2025-03-17 06:00:04,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:00:04,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:00:04,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 06:00:04,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 06:00:04,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 06:00:04,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:04,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:00:04,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:00:04,566 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-17 06:00:04,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:00:04,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52275645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:04,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:00:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-17 06:00:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101814246] [2025-03-17 06:00:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:04,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:00:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:04,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:00:04,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:00:04,567 INFO L87 Difference]: Start difference. First operand 282 states and 343 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-17 06:00:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:04,657 INFO L93 Difference]: Finished difference Result 562 states and 682 transitions. [2025-03-17 06:00:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 78 [2025-03-17 06:00:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:04,660 INFO L225 Difference]: With dead ends: 562 [2025-03-17 06:00:04,660 INFO L226 Difference]: Without dead ends: 297 [2025-03-17 06:00:04,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:00:04,667 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:04,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 473 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:00:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-17 06:00:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 285. [2025-03-17 06:00:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 251 states have (on average 1.1872509960159363) internal successors, (298), 253 states have internal predecessors, (298), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:00:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 346 transitions. [2025-03-17 06:00:04,715 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 346 transitions. Word has length 78 [2025-03-17 06:00:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:04,716 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 346 transitions. [2025-03-17 06:00:04,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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-17 06:00:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 346 transitions. [2025-03-17 06:00:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 06:00:04,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:04,720 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] [2025-03-17 06:00:04,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 06:00:04,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:00:04,921 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:04,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1719997360, now seen corresponding path program 1 times [2025-03-17 06:00:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-17 06:00:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 06:00:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 06:00:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:05,141 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-17 06:00:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052097086] [2025-03-17 06:00:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052097086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61098678] [2025-03-17 06:00:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:05,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:05,142 INFO L87 Difference]: Start difference. First operand 285 states and 346 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-17 06:00:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:05,289 INFO L93 Difference]: Finished difference Result 683 states and 822 transitions. [2025-03-17 06:00:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 78 [2025-03-17 06:00:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:05,291 INFO L225 Difference]: With dead ends: 683 [2025-03-17 06:00:05,291 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 06:00:05,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:05,292 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:05,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 225 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 06:00:05,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 328. [2025-03-17 06:00:05,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 294 states have (on average 1.1734693877551021) internal successors, (345), 296 states have internal predecessors, (345), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 06:00:05,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 393 transitions. [2025-03-17 06:00:05,309 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 393 transitions. Word has length 78 [2025-03-17 06:00:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:05,310 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 393 transitions. [2025-03-17 06:00:05,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-17 06:00:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 393 transitions. [2025-03-17 06:00:05,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 06:00:05,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:05,311 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] [2025-03-17 06:00:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 06:00:05,311 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:05,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 890884837, now seen corresponding path program 1 times [2025-03-17 06:00:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:05,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298194683] [2025-03-17 06:00:05,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:05,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 06:00:05,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 06:00:05,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:05,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:05,436 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-17 06:00:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298194683] [2025-03-17 06:00:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298194683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513122024] [2025-03-17 06:00:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:05,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:05,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:05,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:05,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:05,441 INFO L87 Difference]: Start difference. First operand 328 states and 393 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-17 06:00:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:05,613 INFO L93 Difference]: Finished difference Result 643 states and 767 transitions. [2025-03-17 06:00:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 78 [2025-03-17 06:00:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:05,616 INFO L225 Difference]: With dead ends: 643 [2025-03-17 06:00:05,616 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 06:00:05,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:05,617 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 48 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 06:00:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 276. [2025-03-17 06:00:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 244 states have (on average 1.151639344262295) internal successors, (281), 245 states have internal predecessors, (281), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 06:00:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2025-03-17 06:00:05,641 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 78 [2025-03-17 06:00:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:05,642 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2025-03-17 06:00:05,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-17 06:00:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2025-03-17 06:00:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 06:00:05,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:05,643 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-17 06:00:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 06:00:05,643 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash 443195298, now seen corresponding path program 1 times [2025-03-17 06:00:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81611945] [2025-03-17 06:00:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 06:00:05,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 06:00:05,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:05,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,058 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-17 06:00:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:06,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81611945] [2025-03-17 06:00:06,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81611945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:06,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:06,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:00:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25357906] [2025-03-17 06:00:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:00:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:06,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:00:06,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:00:06,063 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand has 9 states, 8 states have (on average 5.25) 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), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:00:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:06,415 INFO L93 Difference]: Finished difference Result 488 states and 569 transitions. [2025-03-17 06:00:06,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:00:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) 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), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-17 06:00:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:06,417 INFO L225 Difference]: With dead ends: 488 [2025-03-17 06:00:06,417 INFO L226 Difference]: Without dead ends: 357 [2025-03-17 06:00:06,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:00:06,418 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 50 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:06,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 608 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:00:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-17 06:00:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2025-03-17 06:00:06,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 310 states have (on average 1.1483870967741936) internal successors, (356), 312 states have internal predecessors, (356), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 408 transitions. [2025-03-17 06:00:06,449 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 408 transitions. Word has length 79 [2025-03-17 06:00:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:06,449 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 408 transitions. [2025-03-17 06:00:06,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) 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), 1 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 06:00:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 408 transitions. [2025-03-17 06:00:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 06:00:06,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:06,450 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-17 06:00:06,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 06:00:06,450 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:06,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1687959779, now seen corresponding path program 1 times [2025-03-17 06:00:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244467304] [2025-03-17 06:00:06,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:06,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 06:00:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 06:00:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,530 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-17 06:00:06,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:06,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244467304] [2025-03-17 06:00:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244467304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:06,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:06,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:06,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265033425] [2025-03-17 06:00:06,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:06,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:06,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:06,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:06,533 INFO L87 Difference]: Start difference. First operand 349 states and 408 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-17 06:00:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:06,678 INFO L93 Difference]: Finished difference Result 743 states and 868 transitions. [2025-03-17 06:00:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:06,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-17 06:00:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:06,680 INFO L225 Difference]: With dead ends: 743 [2025-03-17 06:00:06,680 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 06:00:06,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:06,681 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 43 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:06,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 336 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 06:00:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 339. [2025-03-17 06:00:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 300 states have (on average 1.1433333333333333) internal successors, (343), 302 states have internal predecessors, (343), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 395 transitions. [2025-03-17 06:00:06,704 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 395 transitions. Word has length 79 [2025-03-17 06:00:06,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:06,704 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 395 transitions. [2025-03-17 06:00:06,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 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-17 06:00:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 395 transitions. [2025-03-17 06:00:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 06:00:06,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:06,706 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-17 06:00:06,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 06:00:06,706 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:06,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1746346645, now seen corresponding path program 1 times [2025-03-17 06:00:06,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:06,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932160180] [2025-03-17 06:00:06,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:06,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:06,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 06:00:06,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 06:00:06,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:06,962 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-17 06:00:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932160180] [2025-03-17 06:00:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932160180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:00:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91831577] [2025-03-17 06:00:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:06,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:00:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:06,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:00:06,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:06,965 INFO L87 Difference]: Start difference. First operand 339 states and 395 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-17 06:00:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:07,098 INFO L93 Difference]: Finished difference Result 847 states and 980 transitions. [2025-03-17 06:00:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:00:07,100 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-17 06:00:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:07,103 INFO L225 Difference]: With dead ends: 847 [2025-03-17 06:00:07,103 INFO L226 Difference]: Without dead ends: 529 [2025-03-17 06:00:07,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:00:07,104 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:07,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 238 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-17 06:00:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 483. [2025-03-17 06:00:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 444 states have (on average 1.1441441441441442) internal successors, (508), 446 states have internal predecessors, (508), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 560 transitions. [2025-03-17 06:00:07,131 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 560 transitions. Word has length 80 [2025-03-17 06:00:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:07,133 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 560 transitions. [2025-03-17 06:00:07,134 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-17 06:00:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 560 transitions. [2025-03-17 06:00:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-17 06:00:07,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:07,135 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-17 06:00:07,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 06:00:07,135 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1237521474, now seen corresponding path program 1 times [2025-03-17 06:00:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075464150] [2025-03-17 06:00:07,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-17 06:00:07,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-17 06:00:07,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:07,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,208 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-17 06:00:07,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075464150] [2025-03-17 06:00:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075464150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:07,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624442148] [2025-03-17 06:00:07,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:07,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:07,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:07,209 INFO L87 Difference]: Start difference. First operand 483 states and 560 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-17 06:00:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:07,324 INFO L93 Difference]: Finished difference Result 1017 states and 1178 transitions. [2025-03-17 06:00:07,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:07,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 81 [2025-03-17 06:00:07,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:07,327 INFO L225 Difference]: With dead ends: 1017 [2025-03-17 06:00:07,327 INFO L226 Difference]: Without dead ends: 543 [2025-03-17 06:00:07,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:07,328 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 37 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:07,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 300 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-03-17 06:00:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 471. [2025-03-17 06:00:07,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 432 states have (on average 1.1388888888888888) internal successors, (492), 434 states have internal predecessors, (492), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 544 transitions. [2025-03-17 06:00:07,354 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 544 transitions. Word has length 81 [2025-03-17 06:00:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:07,354 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 544 transitions. [2025-03-17 06:00:07,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-17 06:00:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 544 transitions. [2025-03-17 06:00:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 06:00:07,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:07,355 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-17 06:00:07,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 06:00:07,356 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:07,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:07,356 INFO L85 PathProgramCache]: Analyzing trace with hash 623224902, now seen corresponding path program 1 times [2025-03-17 06:00:07,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:07,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813184034] [2025-03-17 06:00:07,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:07,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 06:00:07,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 06:00:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,433 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-17 06:00:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813184034] [2025-03-17 06:00:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813184034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:07,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:07,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287453869] [2025-03-17 06:00:07,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:07,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:07,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:07,436 INFO L87 Difference]: Start difference. First operand 471 states and 544 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-17 06:00:07,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:07,544 INFO L93 Difference]: Finished difference Result 1061 states and 1225 transitions. [2025-03-17 06:00:07,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:07,545 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-17 06:00:07,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:07,547 INFO L225 Difference]: With dead ends: 1061 [2025-03-17 06:00:07,547 INFO L226 Difference]: Without dead ends: 611 [2025-03-17 06:00:07,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:00:07,548 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 30 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:07,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 226 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-17 06:00:07,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 501. [2025-03-17 06:00:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 462 states have (on average 1.12987012987013) internal successors, (522), 464 states have internal predecessors, (522), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 06:00:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 574 transitions. [2025-03-17 06:00:07,576 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 574 transitions. Word has length 82 [2025-03-17 06:00:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:07,576 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 574 transitions. [2025-03-17 06:00:07,577 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-17 06:00:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 574 transitions. [2025-03-17 06:00:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 06:00:07,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:07,577 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] [2025-03-17 06:00:07,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 06:00:07,578 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:07,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1236628157, now seen corresponding path program 1 times [2025-03-17 06:00:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:07,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200409377] [2025-03-17 06:00:07,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:07,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 06:00:07,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 06:00:07,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:07,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:07,751 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-17 06:00:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200409377] [2025-03-17 06:00:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200409377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:07,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:07,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:00:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519868294] [2025-03-17 06:00:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:07,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:00:07,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:07,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:00:07,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:00:07,754 INFO L87 Difference]: Start difference. First operand 501 states and 574 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-17 06:00:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:08,295 INFO L93 Difference]: Finished difference Result 829 states and 948 transitions. [2025-03-17 06:00:08,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:00:08,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 84 [2025-03-17 06:00:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:08,302 INFO L225 Difference]: With dead ends: 829 [2025-03-17 06:00:08,302 INFO L226 Difference]: Without dead ends: 520 [2025-03-17 06:00:08,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:00:08,307 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 198 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:08,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 340 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:00:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-17 06:00:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 513. [2025-03-17 06:00:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 470 states have (on average 1.123404255319149) internal successors, (528), 472 states have internal predecessors, (528), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:00:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 584 transitions. [2025-03-17 06:00:08,357 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 584 transitions. Word has length 84 [2025-03-17 06:00:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:08,357 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 584 transitions. [2025-03-17 06:00:08,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-17 06:00:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 584 transitions. [2025-03-17 06:00:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 06:00:08,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:08,358 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] [2025-03-17 06:00:08,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 06:00:08,358 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash -239555804, now seen corresponding path program 1 times [2025-03-17 06:00:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899205830] [2025-03-17 06:00:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:08,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 06:00:08,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 06:00:08,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:09,686 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-17 06:00:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899205830] [2025-03-17 06:00:09,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899205830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:09,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:09,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:00:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853837766] [2025-03-17 06:00:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:09,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:00:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:09,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:00:09,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:00:09,689 INFO L87 Difference]: Start difference. First operand 513 states and 584 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 06:00:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:10,191 INFO L93 Difference]: Finished difference Result 1007 states and 1147 transitions. [2025-03-17 06:00:10,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:00:10,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-03-17 06:00:10,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:10,194 INFO L225 Difference]: With dead ends: 1007 [2025-03-17 06:00:10,194 INFO L226 Difference]: Without dead ends: 527 [2025-03-17 06:00:10,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-17 06:00:10,195 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 83 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:10,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 569 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:00:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-03-17 06:00:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 516. [2025-03-17 06:00:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 473 states have (on average 1.1226215644820297) internal successors, (531), 475 states have internal predecessors, (531), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:00:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 587 transitions. [2025-03-17 06:00:10,217 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 587 transitions. Word has length 84 [2025-03-17 06:00:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 587 transitions. [2025-03-17 06:00:10,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 06:00:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 587 transitions. [2025-03-17 06:00:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 06:00:10,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:10,219 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-17 06:00:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 06:00:10,219 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:10,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash -488448473, now seen corresponding path program 1 times [2025-03-17 06:00:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926705614] [2025-03-17 06:00:10,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:10,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:10,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 06:00:10,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 06:00:10,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:10,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:10,281 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-17 06:00:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926705614] [2025-03-17 06:00:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926705614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:00:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959164282] [2025-03-17 06:00:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:10,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:00:10,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:10,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:00:10,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:00:10,283 INFO L87 Difference]: Start difference. First operand 516 states and 587 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-17 06:00:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:10,357 INFO L93 Difference]: Finished difference Result 976 states and 1107 transitions. [2025-03-17 06:00:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:00:10,357 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-17 06:00:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:10,359 INFO L225 Difference]: With dead ends: 976 [2025-03-17 06:00:10,359 INFO L226 Difference]: Without dead ends: 493 [2025-03-17 06:00:10,360 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-17 06:00:10,360 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:10,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:00:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-17 06:00:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-17 06:00:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 450 states have (on average 1.1066666666666667) internal successors, (498), 452 states have internal predecessors, (498), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:00:10,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 554 transitions. [2025-03-17 06:00:10,383 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 554 transitions. Word has length 86 [2025-03-17 06:00:10,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:10,383 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 554 transitions. [2025-03-17 06:00:10,383 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-17 06:00:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 554 transitions. [2025-03-17 06:00:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 06:00:10,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:00:10,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:00:10,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 06:00:10,385 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:00:10,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:00:10,386 INFO L85 PathProgramCache]: Analyzing trace with hash 848481361, now seen corresponding path program 1 times [2025-03-17 06:00:10,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:00:10,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294587754] [2025-03-17 06:00:10,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:00:10,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:00:10,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-17 06:00:10,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-17 06:00:10,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:00:10,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:00:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-03-17 06:00:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:00:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294587754] [2025-03-17 06:00:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294587754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:00:11,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:00:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 06:00:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852841420] [2025-03-17 06:00:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:00:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 06:00:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:00:11,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 06:00:11,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:00:11,225 INFO L87 Difference]: Start difference. First operand 493 states and 554 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:00:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:00:11,719 INFO L93 Difference]: Finished difference Result 902 states and 1007 transitions. [2025-03-17 06:00:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:00:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 156 [2025-03-17 06:00:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:00:11,724 INFO L225 Difference]: With dead ends: 902 [2025-03-17 06:00:11,724 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 06:00:11,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:00:11,725 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 93 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:00:11,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 521 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:00:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 06:00:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 06:00:11,725 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-17 06:00:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 06:00:11,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2025-03-17 06:00:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:00:11,726 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 06:00:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:00:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 06:00:11,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 06:00:11,733 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:00:11,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 06:00:11,739 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, 1, 1, 1, 1] [2025-03-17 06:00:11,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 06:00:20,199 WARN L286 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 201 DAG size of output: 261 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-17 06:00:23,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:00:23,936 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,943 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,943 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,944 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,945 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,947 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,949 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,950 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,950 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,951 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,965 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-17 06:00:23,966 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-17 06:00:23,966 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-03-17 06:00:23,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:00:23 BoogieIcfgContainer [2025-03-17 06:00:23,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:00:23,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:00:23,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:00:23,967 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:00:23,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:59:46" (3/4) ... [2025-03-17 06:00:23,981 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 06:00:24,006 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 06:00:24,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-17 06:00:24,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 06:00:24,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 06:00:24,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 06:00:24,430 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:00:24,431 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:00:24,431 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:00:24,432 INFO L158 Benchmark]: Toolchain (without parser) took 38537.68ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 113.2MB in the beginning and 118.2MB in the end (delta: -5.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:24,432 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:24,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.02ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:00:24,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.11ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:24,434 INFO L158 Benchmark]: Boogie Preprocessor took 62.63ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:00:24,434 INFO L158 Benchmark]: IcfgBuilder took 393.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 69.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:00:24,434 INFO L158 Benchmark]: TraceAbstraction took 37386.58ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 868.1MB. Max. memory is 16.1GB. [2025-03-17 06:00:24,437 INFO L158 Benchmark]: Witness Printer took 463.68ms. Allocated memory was 1.5GB in the beginning and 167.8MB in the end (delta: -1.3GB). Free memory was 1.5GB in the beginning and 118.2MB in the end (delta: 1.4GB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:00:24,437 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.02ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 99.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.11ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.63ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 393.68ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 69.7MB in the end (delta: 23.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 37386.58ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.3MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 868.1MB. Max. memory is 16.1GB. * Witness Printer took 463.68ms. Allocated memory was 1.5GB in the beginning and 167.8MB in the end (delta: -1.3GB). Free memory was 1.5GB in the beginning and 118.2MB in the end (delta: 1.4GB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.1s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2925 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2902 mSDsluCounter, 13087 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10397 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10107 IncrementalHoareTripleChecker+Invalid, 10517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 2690 mSDtfsCounter, 10107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1151 GetRequests, 830 SyntacticMatches, 0 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=31, InterpolantAutomatonStates: 264, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 1629 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 3116 NumberOfCodeBlocks, 3116 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3224 ConstructedInterpolants, 0 QuantifiedInterpolants, 12967 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1758 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 42 InterpolantComputations, 31 PerfectInterpolantSequences, 4994/5110 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 06:00:24,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE