./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.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 d77ef1cde99f31e501c7f2ed1a61629f500b31c9ca09ddc7e86fabeb2ad18e8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:11:24,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:11:24,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:11:24,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:11:24,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:11:24,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:11:24,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:11:24,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:11:24,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:11:24,816 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:11:24,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:11:24,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:11:24,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:11:24,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:11:24,817 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:11:24,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:11:24,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:11:24,817 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:11:24,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:11:24,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:24,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:11:24,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:11:24,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:11:24,820 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 -> d77ef1cde99f31e501c7f2ed1a61629f500b31c9ca09ddc7e86fabeb2ad18e8e [2025-03-04 01:11:25,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:11:25,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:11:25,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:11:25,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:11:25,083 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:11:25,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.i [2025-03-04 01:11:26,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b314badb6/48303ad0400a42e29f3b484711f00c63/FLAG73bfaa318 [2025-03-04 01:11:26,467 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:11:26,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.i [2025-03-04 01:11:26,473 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b314badb6/48303ad0400a42e29f3b484711f00c63/FLAG73bfaa318 [2025-03-04 01:11:26,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b314badb6/48303ad0400a42e29f3b484711f00c63 [2025-03-04 01:11:26,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:11:26,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:11:26,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:26,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:11:26,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:11:26,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:26,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158ae3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26, skipping insertion in model container [2025-03-04 01:11:26,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:26,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:11:26,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.i[916,929] [2025-03-04 01:11:26,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:26,934 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:11:26,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-87.i[916,929] [2025-03-04 01:11:26,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:11:26,984 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:11:26,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26 WrapperNode [2025-03-04 01:11:26,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:11:26,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:26,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:11:26,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:11:26,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,025 INFO L138 Inliner]: procedures = 26, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2025-03-04 01:11:27,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:11:27,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:11:27,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:11:27,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:11:27,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,057 INFO L175 MemorySlicer]: Split 119 memory accesses to 5 slices as follows [2, 11, 57, 13, 36]. 48 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 5, 2, 4]. The 17 writes are split as follows [0, 2, 7, 4, 4]. [2025-03-04 01:11:27,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:11:27,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:11:27,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:11:27,083 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:11:27,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (1/1) ... [2025-03-04 01:11:27,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:11:27,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:27,115 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:11:27,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:11:27,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:11:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:11:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:11:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:11:27,210 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:11:27,212 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:11:27,493 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L92: havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite67#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~ite88#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-03-04 01:11:27,521 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 01:11:27,521 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:11:27,532 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:11:27,533 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:11:27,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:27 BoogieIcfgContainer [2025-03-04 01:11:27,533 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:11:27,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:11:27,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:11:27,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:11:27,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:11:26" (1/3) ... [2025-03-04 01:11:27,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6781d89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:27, skipping insertion in model container [2025-03-04 01:11:27,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:11:26" (2/3) ... [2025-03-04 01:11:27,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6781d89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:11:27, skipping insertion in model container [2025-03-04 01:11:27,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:27" (3/3) ... [2025-03-04 01:11:27,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-87.i [2025-03-04 01:11:27,551 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:11:27,552 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-87.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:11:27,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:11:27,593 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;@7c37c1c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:11:27,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:11:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:11:27,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:27,604 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:27,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:27,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:27,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1009210463, now seen corresponding path program 1 times [2025-03-04 01:11:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:27,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-03-04 01:11:27,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:27,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:27,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:11:27,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:27,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889480201] [2025-03-04 01:11:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889480201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496636795] [2025-03-04 01:11:27,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:27,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:27,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:11:27,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:28,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:28,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:28,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:28,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:11:28,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:28,035 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:11:28,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:28,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496636795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:28,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:28,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:11:28,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937570924] [2025-03-04 01:11:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:11:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:11:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:11:28,057 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:28,072 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2025-03-04 01:11:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:11:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-04 01:11:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:28,078 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:11:28,078 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:11:28,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:11:28,082 INFO L435 NwaCegarLoop]: 115 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, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:28,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:11:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:11:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2025-03-04 01:11:28,118 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2025-03-04 01:11:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:28,118 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2025-03-04 01:11:28,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2025-03-04 01:11:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:11:28,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:28,122 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:28,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:11:28,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1016029293, now seen corresponding path program 1 times [2025-03-04 01:11:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017502421] [2025-03-04 01:11:28,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:28,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:28,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:28,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:28,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017502421] [2025-03-04 01:11:28,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017502421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:28,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543253786] [2025-03-04 01:11:28,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:28,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:28,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:28,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:11:28,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:28,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:28,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:11:28,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:28,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:28,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543253786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:28,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:11:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438688333] [2025-03-04 01:11:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:28,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:28,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:28,840 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:28,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:28,880 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2025-03-04 01:11:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:28,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:11:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:28,882 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:11:28,883 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 01:11:28,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:28,885 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:28,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 01:11:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-04 01:11:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-03-04 01:11:28,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2025-03-04 01:11:28,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:28,896 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-03-04 01:11:28,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-03-04 01:11:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:11:28,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:28,898 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:28,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:11:29,098 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,SelfDestructingSolverStorable1 [2025-03-04 01:11:29,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1471483540, now seen corresponding path program 1 times [2025-03-04 01:11:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842667638] [2025-03-04 01:11:29,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:29,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:29,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:29,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:29,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842667638] [2025-03-04 01:11:29,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842667638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211013736] [2025-03-04 01:11:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:29,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:29,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:29,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:11:29,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:29,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:29,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:11:29,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:29,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:29,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211013736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:29,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:11:29,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838936418] [2025-03-04 01:11:29,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:29,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:29,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:29,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:29,408 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:29,439 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2025-03-04 01:11:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:11:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:29,441 INFO L225 Difference]: With dead ends: 170 [2025-03-04 01:11:29,442 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:11:29,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:29,443 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:29,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:11:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-04 01:11:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-04 01:11:29,449 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 111 [2025-03-04 01:11:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:29,449 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-04 01:11:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-04 01:11:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:11:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:29,451 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:29,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:29,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:29,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:29,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1935980075, now seen corresponding path program 1 times [2025-03-04 01:11:29,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:29,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-04 01:11:29,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:29,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:29,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:29,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:29,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:29,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654155000] [2025-03-04 01:11:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654155000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019329411] [2025-03-04 01:11:29,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:29,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:29,838 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:29,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:11:29,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:11:29,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:29,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:29,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019329411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:29,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:29,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:11:29,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150488530] [2025-03-04 01:11:29,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:29,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:29,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:29,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:29,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:29,986 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:30,004 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2025-03-04 01:11:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:11:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:30,006 INFO L225 Difference]: With dead ends: 174 [2025-03-04 01:11:30,006 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 01:11:30,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:30,010 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:30,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 01:11:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-04 01:11:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-03-04 01:11:30,025 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 111 [2025-03-04 01:11:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:30,025 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-03-04 01:11:30,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-03-04 01:11:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:11:30,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:30,027 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:30,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:30,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:30,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1935056554, now seen corresponding path program 1 times [2025-03-04 01:11:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-03-04 01:11:30,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:30,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:30,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:30,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670249202] [2025-03-04 01:11:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670249202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858507983] [2025-03-04 01:11:30,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:30,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:30,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:11:30,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:11:30,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:11:30,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:30,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:30,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:11:30,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:30,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858507983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:11:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668464272] [2025-03-04 01:11:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:30,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:11:30,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:30,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:11:30,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:30,523 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:30,543 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2025-03-04 01:11:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:11:30,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:11:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:30,546 INFO L225 Difference]: With dead ends: 177 [2025-03-04 01:11:30,546 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:11:30,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:30,548 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:30,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:11:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 01:11:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-03-04 01:11:30,556 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 111 [2025-03-04 01:11:30,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:30,557 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-03-04 01:11:30,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-03-04 01:11:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:11:30,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:30,558 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:30,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:30,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:30,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:30,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1005939091, now seen corresponding path program 1 times [2025-03-04 01:11:30,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:30,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327055020] [2025-03-04 01:11:30,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:30,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:11:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:11:30,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:30,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:31,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327055020] [2025-03-04 01:11:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327055020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:31,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:31,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:31,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942678817] [2025-03-04 01:11:31,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:31,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:31,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:31,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:31,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:31,035 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:31,125 INFO L93 Difference]: Finished difference Result 260 states and 354 transitions. [2025-03-04 01:11:31,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:11:31,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:31,127 INFO L225 Difference]: With dead ends: 260 [2025-03-04 01:11:31,127 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 01:11:31,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:31,128 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 98 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:31,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 537 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 01:11:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2025-03-04 01:11:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:11:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2025-03-04 01:11:31,133 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 113 [2025-03-04 01:11:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2025-03-04 01:11:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2025-03-04 01:11:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:11:31,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:31,135 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:11:31,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash 404143562, now seen corresponding path program 1 times [2025-03-04 01:11:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:31,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796343486] [2025-03-04 01:11:31,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:31,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:31,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:11:31,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:11:31,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:31,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796343486] [2025-03-04 01:11:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796343486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:31,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:31,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404602151] [2025-03-04 01:11:31,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:31,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:31,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:31,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:31,368 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:31,523 INFO L93 Difference]: Finished difference Result 268 states and 364 transitions. [2025-03-04 01:11:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:31,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:11:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:31,525 INFO L225 Difference]: With dead ends: 268 [2025-03-04 01:11:31,525 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 01:11:31,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:31,526 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 61 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:31,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 533 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:31,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 01:11:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2025-03-04 01:11:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 144 states have (on average 1.2986111111111112) internal successors, (187), 145 states have internal predecessors, (187), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:11:31,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2025-03-04 01:11:31,539 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 223 transitions. Word has length 113 [2025-03-04 01:11:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:31,540 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-04 01:11:31,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 223 transitions. [2025-03-04 01:11:31,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:11:31,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:31,544 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:11:31,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:31,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1637551347, now seen corresponding path program 1 times [2025-03-04 01:11:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357393681] [2025-03-04 01:11:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:31,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:11:31,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:11:31,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:31,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:32,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:32,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357393681] [2025-03-04 01:11:32,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357393681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:32,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:32,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418975723] [2025-03-04 01:11:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:32,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:32,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:32,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:32,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:32,072 INFO L87 Difference]: Start difference. First operand 165 states and 223 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:32,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:32,237 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2025-03-04 01:11:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:32,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-04 01:11:32,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:32,241 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:11:32,241 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 01:11:32,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:32,242 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 84 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:32,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 729 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 01:11:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2025-03-04 01:11:32,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 158 states have (on average 1.2658227848101267) internal successors, (200), 160 states have internal predecessors, (200), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:32,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2025-03-04 01:11:32,260 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 114 [2025-03-04 01:11:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:32,260 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2025-03-04 01:11:32,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2025-03-04 01:11:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:32,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:32,261 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:32,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:11:32,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:32,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2022829360, now seen corresponding path program 1 times [2025-03-04 01:11:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:32,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-03-04 01:11:32,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:32,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:32,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:33,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:33,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314789530] [2025-03-04 01:11:33,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314789530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:33,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:33,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:11:33,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374924755] [2025-03-04 01:11:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:33,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:11:33,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:33,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:11:33,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:11:33,048 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:11:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:33,355 INFO L93 Difference]: Finished difference Result 492 states and 657 transitions. [2025-03-04 01:11:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:11:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-04 01:11:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:33,357 INFO L225 Difference]: With dead ends: 492 [2025-03-04 01:11:33,357 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 01:11:33,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:11:33,358 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 89 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:33,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1401 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 01:11:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 250. [2025-03-04 01:11:33,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 206 states have (on average 1.2475728155339805) internal successors, (257), 209 states have internal predecessors, (257), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:11:33,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 333 transitions. [2025-03-04 01:11:33,373 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 333 transitions. Word has length 115 [2025-03-04 01:11:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:33,373 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 333 transitions. [2025-03-04 01:11:33,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.0) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:11:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 333 transitions. [2025-03-04 01:11:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:33,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:33,374 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:33,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:11:33,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:33,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1274361267, now seen corresponding path program 1 times [2025-03-04 01:11:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:33,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-03-04 01:11:33,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:33,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:33,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:33,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110036482] [2025-03-04 01:11:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110036482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:33,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943847886] [2025-03-04 01:11:33,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:33,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:33,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:33,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:33,533 INFO L87 Difference]: Start difference. First operand 250 states and 333 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:33,639 INFO L93 Difference]: Finished difference Result 473 states and 625 transitions. [2025-03-04 01:11:33,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:33,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:11:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:33,640 INFO L225 Difference]: With dead ends: 473 [2025-03-04 01:11:33,640 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 01:11:33,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:33,641 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:33,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 361 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 01:11:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 207. [2025-03-04 01:11:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 173 states have (on average 1.2369942196531791) internal successors, (214), 175 states have internal predecessors, (214), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:11:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 270 transitions. [2025-03-04 01:11:33,657 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 270 transitions. Word has length 115 [2025-03-04 01:11:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:33,658 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 270 transitions. [2025-03-04 01:11:33,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 270 transitions. [2025-03-04 01:11:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:33,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:33,660 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:33,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:11:33,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:33,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2097341599, now seen corresponding path program 1 times [2025-03-04 01:11:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:33,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286952717] [2025-03-04 01:11:33,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:33,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:33,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:33,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:33,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286952717] [2025-03-04 01:11:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286952717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267047492] [2025-03-04 01:11:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:34,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:34,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:34,220 INFO L87 Difference]: Start difference. First operand 207 states and 270 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:34,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:34,355 INFO L93 Difference]: Finished difference Result 236 states and 300 transitions. [2025-03-04 01:11:34,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:34,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:11:34,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:34,357 INFO L225 Difference]: With dead ends: 236 [2025-03-04 01:11:34,358 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 01:11:34,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:34,358 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 53 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:34,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 363 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 01:11:34,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2025-03-04 01:11:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.211340206185567) internal successors, (235), 197 states have internal predecessors, (235), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:11:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 295 transitions. [2025-03-04 01:11:34,373 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 295 transitions. Word has length 115 [2025-03-04 01:11:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:34,373 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 295 transitions. [2025-03-04 01:11:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2025-03-04 01:11:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:34,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:34,374 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:11:34,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2096418078, now seen corresponding path program 1 times [2025-03-04 01:11:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-04 01:11:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:34,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:34,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:34,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:34,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167406220] [2025-03-04 01:11:34,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167406220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:34,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:34,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:34,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81044858] [2025-03-04 01:11:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:34,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:34,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:34,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:34,811 INFO L87 Difference]: Start difference. First operand 233 states and 295 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:34,892 INFO L93 Difference]: Finished difference Result 497 states and 628 transitions. [2025-03-04 01:11:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-04 01:11:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:34,894 INFO L225 Difference]: With dead ends: 497 [2025-03-04 01:11:34,894 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 01:11:34,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:34,895 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 41 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 628 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 01:11:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 255. [2025-03-04 01:11:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 216 states have (on average 1.2222222222222223) internal successors, (264), 219 states have internal predecessors, (264), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:11:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 324 transitions. [2025-03-04 01:11:34,913 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 324 transitions. Word has length 115 [2025-03-04 01:11:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 324 transitions. [2025-03-04 01:11:34,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 324 transitions. [2025-03-04 01:11:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:34,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:34,916 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:34,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:11:34,916 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:34,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:34,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1208914397, now seen corresponding path program 1 times [2025-03-04 01:11:34,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:34,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-04 01:11:34,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:34,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:34,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:34,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:34,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:34,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:35,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123873065] [2025-03-04 01:11:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123873065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:35,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433386668] [2025-03-04 01:11:35,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:35,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:35,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:35,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:35,139 INFO L87 Difference]: Start difference. First operand 255 states and 324 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:35,256 INFO L93 Difference]: Finished difference Result 506 states and 641 transitions. [2025-03-04 01:11:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:35,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:11:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:35,258 INFO L225 Difference]: With dead ends: 506 [2025-03-04 01:11:35,258 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 01:11:35,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:35,259 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 61 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:35,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 252 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 01:11:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 215. [2025-03-04 01:11:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 188 states have (on average 1.2287234042553192) internal successors, (231), 190 states have internal predecessors, (231), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:11:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 271 transitions. [2025-03-04 01:11:35,276 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 271 transitions. Word has length 115 [2025-03-04 01:11:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:35,276 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 271 transitions. [2025-03-04 01:11:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 271 transitions. [2025-03-04 01:11:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:11:35,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:35,280 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:35,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:11:35,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1278598436, now seen corresponding path program 1 times [2025-03-04 01:11:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51636460] [2025-03-04 01:11:35,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:35,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:11:35,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:11:35,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:35,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51636460] [2025-03-04 01:11:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51636460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775969466] [2025-03-04 01:11:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:35,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:35,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:35,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:35,426 INFO L87 Difference]: Start difference. First operand 215 states and 271 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:35,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:35,587 INFO L93 Difference]: Finished difference Result 591 states and 735 transitions. [2025-03-04 01:11:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:35,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:11:35,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:35,590 INFO L225 Difference]: With dead ends: 591 [2025-03-04 01:11:35,590 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 01:11:35,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:35,591 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 58 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:35,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 510 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 01:11:35,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 327. [2025-03-04 01:11:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 291 states have (on average 1.2096219931271477) internal successors, (352), 294 states have internal predecessors, (352), 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-04 01:11:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 404 transitions. [2025-03-04 01:11:35,615 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 404 transitions. Word has length 115 [2025-03-04 01:11:35,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:35,615 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 404 transitions. [2025-03-04 01:11:35,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 404 transitions. [2025-03-04 01:11:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:11:35,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:35,616 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:35,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:11:35,616 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:35,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:35,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2005607990, now seen corresponding path program 1 times [2025-03-04 01:11:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652532899] [2025-03-04 01:11:35,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:35,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:35,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:11:35,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:11:35,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:35,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:35,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652532899] [2025-03-04 01:11:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652532899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:35,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984922518] [2025-03-04 01:11:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:35,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:35,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:35,778 INFO L87 Difference]: Start difference. First operand 327 states and 404 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:36,009 INFO L93 Difference]: Finished difference Result 891 states and 1106 transitions. [2025-03-04 01:11:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:36,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:11:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:36,012 INFO L225 Difference]: With dead ends: 891 [2025-03-04 01:11:36,012 INFO L226 Difference]: Without dead ends: 572 [2025-03-04 01:11:36,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:36,013 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 100 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:36,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 906 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-04 01:11:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 383. [2025-03-04 01:11:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 347 states have (on average 1.2219020172910662) internal successors, (424), 350 states have internal predecessors, (424), 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-04 01:11:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 476 transitions. [2025-03-04 01:11:36,036 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 476 transitions. Word has length 116 [2025-03-04 01:11:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:36,037 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 476 transitions. [2025-03-04 01:11:36,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 476 transitions. [2025-03-04 01:11:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:11:36,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:36,038 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:36,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:11:36,038 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:36,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -278250307, now seen corresponding path program 1 times [2025-03-04 01:11:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:36,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609797767] [2025-03-04 01:11:36,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:11:36,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:11:36,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609797767] [2025-03-04 01:11:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609797767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:36,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240293658] [2025-03-04 01:11:36,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:36,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:36,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:36,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:36,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:11:36,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:11:36,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:11:36,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:36,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:11:36,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:36,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 01:11:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:11:36,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:36,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240293658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:11:36,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:11:36,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-04 01:11:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682412634] [2025-03-04 01:11:36,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:11:36,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:11:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:36,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:11:36,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:11:36,824 INFO L87 Difference]: Start difference. First operand 383 states and 476 transitions. Second operand has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 1 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 01:11:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:37,001 INFO L93 Difference]: Finished difference Result 661 states and 809 transitions. [2025-03-04 01:11:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:11:37,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 1 states have call predecessors, (28), 3 states have call successors, (28) Word has length 116 [2025-03-04 01:11:37,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:37,004 INFO L225 Difference]: With dead ends: 661 [2025-03-04 01:11:37,004 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 01:11:37,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 225 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:11:37,005 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 64 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:37,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 428 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 01:11:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-04 01:11:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 244 states have (on average 1.180327868852459) internal successors, (288), 247 states have internal predecessors, (288), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:11:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 340 transitions. [2025-03-04 01:11:37,032 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 340 transitions. Word has length 116 [2025-03-04 01:11:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:37,033 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 340 transitions. [2025-03-04 01:11:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.375) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (28), 1 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-04 01:11:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 340 transitions. [2025-03-04 01:11:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:11:37,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:37,034 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:37,041 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-04 01:11:37,238 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-04 01:11:37,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:37,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash -755072801, now seen corresponding path program 1 times [2025-03-04 01:11:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:37,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-04 01:11:37,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:37,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:11:37,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:11:37,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:37,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:37,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:37,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686042935] [2025-03-04 01:11:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686042935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:11:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989612537] [2025-03-04 01:11:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:37,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:37,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:37,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:37,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:11:37,350 INFO L87 Difference]: Start difference. First operand 284 states and 340 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:37,443 INFO L93 Difference]: Finished difference Result 556 states and 667 transitions. [2025-03-04 01:11:37,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-04 01:11:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:37,445 INFO L225 Difference]: With dead ends: 556 [2025-03-04 01:11:37,445 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 01:11:37,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:37,446 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 102 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:37,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 284 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 01:11:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-04 01:11:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 244 states have (on average 1.1557377049180328) internal successors, (282), 247 states have internal predecessors, (282), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:11:37,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 334 transitions. [2025-03-04 01:11:37,470 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 334 transitions. Word has length 117 [2025-03-04 01:11:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:37,470 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 334 transitions. [2025-03-04 01:11:37,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 334 transitions. [2025-03-04 01:11:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:11:37,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:37,472 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:37,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:11:37,472 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1086756700, now seen corresponding path program 1 times [2025-03-04 01:11:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:37,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817139450] [2025-03-04 01:11:37,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:37,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:11:37,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:11:37,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817139450] [2025-03-04 01:11:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817139450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:37,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745315431] [2025-03-04 01:11:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:37,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:37,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:37,866 INFO L87 Difference]: Start difference. First operand 284 states and 334 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:37,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:37,948 INFO L93 Difference]: Finished difference Result 556 states and 655 transitions. [2025-03-04 01:11:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:37,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-04 01:11:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:37,951 INFO L225 Difference]: With dead ends: 556 [2025-03-04 01:11:37,951 INFO L226 Difference]: Without dead ends: 284 [2025-03-04 01:11:37,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:37,952 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 41 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:37,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 465 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:11:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-04 01:11:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2025-03-04 01:11:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 244 states have (on average 1.1434426229508197) internal successors, (279), 247 states have internal predecessors, (279), 26 states have call successors, (26), 13 states have call predecessors, (26), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:11:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 331 transitions. [2025-03-04 01:11:37,974 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 331 transitions. Word has length 119 [2025-03-04 01:11:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:37,975 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 331 transitions. [2025-03-04 01:11:37,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 331 transitions. [2025-03-04 01:11:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:11:37,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:37,976 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:37,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:11:37,976 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:37,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2077552925, now seen corresponding path program 1 times [2025-03-04 01:11:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764734187] [2025-03-04 01:11:37,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:37,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:11:38,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:11:38,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:38,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:38,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081776405] [2025-03-04 01:11:38,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:38,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:38,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:38,035 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-04 01:11:38,040 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-04 01:11:38,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:11:38,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:11:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:38,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:11:38,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:38,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:11:38,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:11:38,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:11:38,371 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-04 01:11:38,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:38,476 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 42 treesize of output 18 [2025-03-04 01:11:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:38,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764734187] [2025-03-04 01:11:38,491 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081776405] [2025-03-04 01:11:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081776405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97338912] [2025-03-04 01:11:38,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:38,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:38,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:38,492 INFO L87 Difference]: Start difference. First operand 284 states and 331 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:38,794 INFO L93 Difference]: Finished difference Result 829 states and 973 transitions. [2025-03-04 01:11:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:11:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-03-04 01:11:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:38,797 INFO L225 Difference]: With dead ends: 829 [2025-03-04 01:11:38,797 INFO L226 Difference]: Without dead ends: 557 [2025-03-04 01:11:38,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:38,798 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 123 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:38,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 621 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:38,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-04 01:11:38,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 361. [2025-03-04 01:11:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 313 states have (on average 1.1533546325878594) internal successors, (361), 314 states have internal predecessors, (361), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 429 transitions. [2025-03-04 01:11:38,835 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 429 transitions. Word has length 120 [2025-03-04 01:11:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:38,835 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 429 transitions. [2025-03-04 01:11:38,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 429 transitions. [2025-03-04 01:11:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:11:38,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:38,836 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:38,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:39,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:39,041 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:39,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash -60592032, now seen corresponding path program 1 times [2025-03-04 01:11:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828169559] [2025-03-04 01:11:39,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:39,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:39,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:11:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:11:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:39,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:39,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633325535] [2025-03-04 01:11:39,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:39,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:39,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:39,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:11:39,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:11:39,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:11:39,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:39,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:11:39,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:39,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:39,375 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 19 treesize of output 7 [2025-03-04 01:11:39,471 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-04 01:11:39,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:11:39,497 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-04 01:11:39,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:39,583 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 44 treesize of output 20 [2025-03-04 01:11:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:39,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:39,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828169559] [2025-03-04 01:11:39,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633325535] [2025-03-04 01:11:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633325535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67765440] [2025-03-04 01:11:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:39,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:39,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:39,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:39,599 INFO L87 Difference]: Start difference. First operand 361 states and 429 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:39,832 INFO L93 Difference]: Finished difference Result 688 states and 805 transitions. [2025-03-04 01:11:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:11:39,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:11:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:39,834 INFO L225 Difference]: With dead ends: 688 [2025-03-04 01:11:39,834 INFO L226 Difference]: Without dead ends: 468 [2025-03-04 01:11:39,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:39,835 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 135 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:39,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 511 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-03-04 01:11:39,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 397. [2025-03-04 01:11:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 349 states have (on average 1.151862464183381) internal successors, (402), 350 states have internal predecessors, (402), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 470 transitions. [2025-03-04 01:11:39,858 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 470 transitions. Word has length 121 [2025-03-04 01:11:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:39,858 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 470 transitions. [2025-03-04 01:11:39,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 470 transitions. [2025-03-04 01:11:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:11:39,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:39,859 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:39,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:11:40,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:40,060 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:40,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash -2078720993, now seen corresponding path program 1 times [2025-03-04 01:11:40,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:40,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992206417] [2025-03-04 01:11:40,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:40,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:40,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:40,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:40,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992206417] [2025-03-04 01:11:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992206417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:40,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158980719] [2025-03-04 01:11:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:40,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:40,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:40,404 INFO L87 Difference]: Start difference. First operand 397 states and 470 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:40,583 INFO L93 Difference]: Finished difference Result 623 states and 734 transitions. [2025-03-04 01:11:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:11:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:40,585 INFO L225 Difference]: With dead ends: 623 [2025-03-04 01:11:40,585 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 01:11:40,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:40,586 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:40,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 707 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 01:11:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2025-03-04 01:11:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 353 states have (on average 1.1501416430594902) internal successors, (406), 354 states have internal predecessors, (406), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 474 transitions. [2025-03-04 01:11:40,608 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 474 transitions. Word has length 122 [2025-03-04 01:11:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:40,608 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 474 transitions. [2025-03-04 01:11:40,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 474 transitions. [2025-03-04 01:11:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:11:40,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:40,609 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:40,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:11:40,609 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1922843296, now seen corresponding path program 1 times [2025-03-04 01:11:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668144221] [2025-03-04 01:11:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:40,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:40,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:40,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:40,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400418156] [2025-03-04 01:11:40,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:40,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:40,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:40,662 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:40,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:11:40,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:40,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:40,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:40,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:40,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:11:40,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:40,899 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-04 01:11:40,905 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-04 01:11:40,908 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-04 01:11:40,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-04 01:11:41,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2025-03-04 01:11:41,043 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:41,044 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 53 treesize of output 21 [2025-03-04 01:11:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:41,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:41,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668144221] [2025-03-04 01:11:41,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:41,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400418156] [2025-03-04 01:11:41,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400418156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:41,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:11:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18052262] [2025-03-04 01:11:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:11:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:41,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:11:41,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:11:41,056 INFO L87 Difference]: Start difference. First operand 401 states and 474 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:41,292 INFO L93 Difference]: Finished difference Result 739 states and 858 transitions. [2025-03-04 01:11:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:11:41,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:11:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:41,295 INFO L225 Difference]: With dead ends: 739 [2025-03-04 01:11:41,295 INFO L226 Difference]: Without dead ends: 515 [2025-03-04 01:11:41,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:41,298 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 78 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:41,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 471 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-04 01:11:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 410. [2025-03-04 01:11:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 362 states have (on average 1.149171270718232) internal successors, (416), 363 states have internal predecessors, (416), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2025-03-04 01:11:41,330 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 122 [2025-03-04 01:11:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:41,331 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2025-03-04 01:11:41,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2025-03-04 01:11:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:11:41,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:41,332 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:41,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:41,532 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:41,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash 139036960, now seen corresponding path program 1 times [2025-03-04 01:11:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479844534] [2025-03-04 01:11:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:41,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:41,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:41,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:41,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:41,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731596932] [2025-03-04 01:11:41,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:41,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:41,573 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:41,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:11:41,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:41,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:41,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:41,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:11:41,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:41,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:11:41,838 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-04 01:11:41,841 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-04 01:11:41,846 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-04 01:11:41,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:11:41,863 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 31 treesize of output 15 [2025-03-04 01:11:41,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:41,877 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 31 treesize of output 33 [2025-03-04 01:11:42,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2025-03-04 01:11:42,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:42,028 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 66 treesize of output 26 [2025-03-04 01:11:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:42,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:11:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479844534] [2025-03-04 01:11:42,044 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731596932] [2025-03-04 01:11:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731596932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597383573] [2025-03-04 01:11:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:42,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:42,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:42,045 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:42,324 INFO L93 Difference]: Finished difference Result 776 states and 897 transitions. [2025-03-04 01:11:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:42,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:11:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:42,326 INFO L225 Difference]: With dead ends: 776 [2025-03-04 01:11:42,326 INFO L226 Difference]: Without dead ends: 547 [2025-03-04 01:11:42,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:42,327 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 169 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:42,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 434 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:11:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-04 01:11:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 426. [2025-03-04 01:11:42,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 378 states have (on average 1.1455026455026456) internal successors, (433), 379 states have internal predecessors, (433), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 501 transitions. [2025-03-04 01:11:42,351 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 501 transitions. Word has length 122 [2025-03-04 01:11:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:42,351 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 501 transitions. [2025-03-04 01:11:42,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 501 transitions. [2025-03-04 01:11:42,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:11:42,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:42,352 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:42,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 01:11:42,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 01:11:42,553 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash -154366047, now seen corresponding path program 1 times [2025-03-04 01:11:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:42,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708880695] [2025-03-04 01:11:42,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:11:42,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:11:42,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:42,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:42,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:42,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708880695] [2025-03-04 01:11:42,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708880695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:11:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124621872] [2025-03-04 01:11:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:42,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:11:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:42,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:11:42,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:42,688 INFO L87 Difference]: Start difference. First operand 426 states and 501 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:42,840 INFO L93 Difference]: Finished difference Result 674 states and 789 transitions. [2025-03-04 01:11:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:11:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:11:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:42,843 INFO L225 Difference]: With dead ends: 674 [2025-03-04 01:11:42,843 INFO L226 Difference]: Without dead ends: 433 [2025-03-04 01:11:42,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:42,843 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 55 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:42,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 616 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:11:42,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-04 01:11:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2025-03-04 01:11:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 379 states have (on average 1.1451187335092348) internal successors, (434), 380 states have internal predecessors, (434), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 502 transitions. [2025-03-04 01:11:42,865 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 502 transitions. Word has length 122 [2025-03-04 01:11:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 502 transitions. [2025-03-04 01:11:42,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 502 transitions. [2025-03-04 01:11:42,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:11:42,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:42,867 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:42,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:11:42,867 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:42,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1494540851, now seen corresponding path program 1 times [2025-03-04 01:11:42,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:42,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947243473] [2025-03-04 01:11:42,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:42,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:11:42,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:11:42,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:42,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:43,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947243473] [2025-03-04 01:11:43,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947243473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:43,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:43,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:11:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212475511] [2025-03-04 01:11:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:43,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:11:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:43,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:11:43,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:43,759 INFO L87 Difference]: Start difference. First operand 427 states and 502 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:44,969 INFO L93 Difference]: Finished difference Result 850 states and 998 transitions. [2025-03-04 01:11:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:11:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2025-03-04 01:11:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:44,973 INFO L225 Difference]: With dead ends: 850 [2025-03-04 01:11:44,973 INFO L226 Difference]: Without dead ends: 593 [2025-03-04 01:11:44,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:11:44,974 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 237 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 650 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:11:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-04 01:11:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 427. [2025-03-04 01:11:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 379 states have (on average 1.1319261213720317) internal successors, (429), 380 states have internal predecessors, (429), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 497 transitions. [2025-03-04 01:11:45,006 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 497 transitions. Word has length 124 [2025-03-04 01:11:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:45,006 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 497 transitions. [2025-03-04 01:11:45,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 497 transitions. [2025-03-04 01:11:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:11:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:45,008 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:45,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:11:45,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:45,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1535311757, now seen corresponding path program 1 times [2025-03-04 01:11:45,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839001312] [2025-03-04 01:11:45,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:11:45,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:11:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:11:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839001312] [2025-03-04 01:11:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839001312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:11:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:11:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:11:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242682556] [2025-03-04 01:11:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:45,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:11:45,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:45,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:11:45,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:11:45,898 INFO L87 Difference]: Start difference. First operand 427 states and 497 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:46,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:46,408 INFO L93 Difference]: Finished difference Result 905 states and 1046 transitions. [2025-03-04 01:11:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:11:46,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2025-03-04 01:11:46,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:46,411 INFO L225 Difference]: With dead ends: 905 [2025-03-04 01:11:46,411 INFO L226 Difference]: Without dead ends: 636 [2025-03-04 01:11:46,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:46,412 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 129 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:46,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 880 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:11:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-04 01:11:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 509. [2025-03-04 01:11:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 446 states have (on average 1.109865470852018) internal successors, (495), 448 states have internal predecessors, (495), 44 states have call successors, (44), 18 states have call predecessors, (44), 18 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:11:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 583 transitions. [2025-03-04 01:11:46,471 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 583 transitions. Word has length 124 [2025-03-04 01:11:46,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:46,471 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 583 transitions. [2025-03-04 01:11:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:11:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 583 transitions. [2025-03-04 01:11:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:11:46,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:46,472 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:46,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:11:46,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:46,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1862553728, now seen corresponding path program 1 times [2025-03-04 01:11:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477157841] [2025-03-04 01:11:46,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:46,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:11:46,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:11:46,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:46,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477157841] [2025-03-04 01:11:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477157841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006320230] [2025-03-04 01:11:46,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:46,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:46,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:46,813 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:46,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 01:11:46,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:11:46,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:11:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:46,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 01:11:46,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:47,029 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 31 treesize of output 15 [2025-03-04 01:11:47,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 01:11:47,065 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 31 treesize of output 15 [2025-03-04 01:11:47,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-04 01:11:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 01:11:47,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:11:47,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006320230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:11:47,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:11:47,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-03-04 01:11:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893629580] [2025-03-04 01:11:47,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:11:47,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:11:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:47,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:11:47,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:11:47,286 INFO L87 Difference]: Start difference. First operand 509 states and 583 transitions. Second operand has 17 states, 14 states have (on average 8.285714285714286) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 01:11:47,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:47,955 INFO L93 Difference]: Finished difference Result 727 states and 822 transitions. [2025-03-04 01:11:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:11:47,956 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.285714285714286) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) Word has length 125 [2025-03-04 01:11:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:47,957 INFO L225 Difference]: With dead ends: 727 [2025-03-04 01:11:47,957 INFO L226 Difference]: Without dead ends: 286 [2025-03-04 01:11:47,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 01:11:47,959 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 332 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:47,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 302 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:11:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-04 01:11:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2025-03-04 01:11:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 229 states have (on average 1.0524017467248907) internal successors, (241), 230 states have internal predecessors, (241), 34 states have call successors, (34), 18 states have call predecessors, (34), 18 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:47,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 309 transitions. [2025-03-04 01:11:47,992 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 309 transitions. Word has length 125 [2025-03-04 01:11:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:47,992 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 309 transitions. [2025-03-04 01:11:47,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.285714285714286) internal successors, (116), 17 states have internal predecessors, (116), 7 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 01:11:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 309 transitions. [2025-03-04 01:11:47,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 01:11:47,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:47,994 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 01:11:48,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:11:48,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 01:11:48,194 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:48,195 INFO L85 PathProgramCache]: Analyzing trace with hash -832669454, now seen corresponding path program 1 times [2025-03-04 01:11:48,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:48,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772828532] [2025-03-04 01:11:48,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:48,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 01:11:48,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 01:11:48,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:48,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:48,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365872511] [2025-03-04 01:11:48,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:48,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:48,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:48,305 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:48,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 01:11:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 01:11:48,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 01:11:48,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:48,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 01:11:48,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:48,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-04 01:11:48,895 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 15 [2025-03-04 01:11:48,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 01:11:48,954 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 25 treesize of output 13 [2025-03-04 01:11:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-04 01:11:48,985 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 3 [2025-03-04 01:11:48,989 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-04 01:11:48,991 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-04 01:11:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:11:49,005 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 31 treesize of output 15 [2025-03-04 01:11:49,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:49,012 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 31 treesize of output 33 [2025-03-04 01:11:49,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:49,109 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 27 treesize of output 11 [2025-03-04 01:11:49,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:49,173 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 40 treesize of output 16 [2025-03-04 01:11:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 367 proven. 203 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2025-03-04 01:11:49,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-04 01:11:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772828532] [2025-03-04 01:11:49,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365872511] [2025-03-04 01:11:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365872511] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-04 01:11:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565263100] [2025-03-04 01:11:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:49,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:49,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:11:49,457 INFO L87 Difference]: Start difference. First operand 282 states and 309 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:49,767 INFO L93 Difference]: Finished difference Result 468 states and 510 transitions. [2025-03-04 01:11:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:49,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-03-04 01:11:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:49,769 INFO L225 Difference]: With dead ends: 468 [2025-03-04 01:11:49,769 INFO L226 Difference]: Without dead ends: 285 [2025-03-04 01:11:49,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 459 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:11:49,769 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 17 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:49,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 338 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:11:49,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-04 01:11:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2025-03-04 01:11:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 196 states have (on average 1.0357142857142858) internal successors, (203), 197 states have internal predecessors, (203), 34 states have call successors, (34), 18 states have call predecessors, (34), 18 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:11:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 271 transitions. [2025-03-04 01:11:49,802 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 271 transitions. Word has length 236 [2025-03-04 01:11:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:49,802 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 271 transitions. [2025-03-04 01:11:49,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 271 transitions. [2025-03-04 01:11:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 01:11:49,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:11:49,803 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 01:11:49,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 01:11:50,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 01:11:50,004 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:11:50,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:11:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -83172565, now seen corresponding path program 1 times [2025-03-04 01:11:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:11:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551319057] [2025-03-04 01:11:50,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:50,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:11:50,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:11:50,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:11:50,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:50,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:11:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661955937] [2025-03-04 01:11:50,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:11:50,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:11:50,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:11:50,098 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:11:50,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 01:11:50,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:11:50,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:11:50,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:11:50,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:11:50,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:11:50,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:11:50,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-03-04 01:11:50,672 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-04 01:11:50,676 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-04 01:11:50,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-04 01:11:50,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:50,689 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 35 treesize of output 17 [2025-03-04 01:11:50,691 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-04 01:11:50,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-04 01:11:50,699 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-04 01:11:50,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:11:50,709 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-04 01:11:50,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:11:50,773 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 42 treesize of output 18 [2025-03-04 01:11:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1548 trivial. 0 not checked. [2025-03-04 01:11:50,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:11:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-04 01:11:51,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:11:51,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551319057] [2025-03-04 01:11:51,002 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:11:51,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661955937] [2025-03-04 01:11:51,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661955937] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:11:51,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:11:51,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-03-04 01:11:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187034625] [2025-03-04 01:11:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:11:51,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:11:51,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:11:51,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:11:51,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:11:51,003 INFO L87 Difference]: Start difference. First operand 249 states and 271 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:11:51,845 INFO L93 Difference]: Finished difference Result 420 states and 453 transitions. [2025-03-04 01:11:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:11:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2025-03-04 01:11:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:11:51,847 INFO L225 Difference]: With dead ends: 420 [2025-03-04 01:11:51,847 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:11:51,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 465 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:11:51,848 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 30 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:11:51,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 215 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:11:51,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:11:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:11:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:11:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:11:51,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2025-03-04 01:11:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:11:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:11:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:11:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:11:51,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:11:51,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:11:51,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 01:11:52,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 01:11:52,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:11:52,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 01:11:59,418 WARN L286 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 206 DAG size of output: 202 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-04 01:12:09,026 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:12:09,034 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,034 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,034 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,035 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,035 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,035 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,036 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,037 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,037 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,037 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,037 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,038 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,039 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,040 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,041 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,042 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,043 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#4 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,044 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2025-03-04 01:12:09,045 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,047 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,048 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2025-03-04 01:12:09,048 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2025-03-04 01:12:09,048 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] [2025-03-04 01:12:09,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:12:09 BoogieIcfgContainer [2025-03-04 01:12:09,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:12:09,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:12:09,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:12:09,049 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:12:09,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:11:27" (3/4) ... [2025-03-04 01:12:09,052 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 01:12:09,056 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 01:12:09,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 01:12:09,066 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 01:12:09,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 01:12:09,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 01:12:09,151 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 01:12:09,151 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 01:12:09,151 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:12:09,152 INFO L158 Benchmark]: Toolchain (without parser) took 42357.20ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 104.7MB in the beginning and 100.5MB in the end (delta: 4.3MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,152 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:12:09,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.27ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.27ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:12:09,153 INFO L158 Benchmark]: Boogie Preprocessor took 55.95ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,153 INFO L158 Benchmark]: IcfgBuilder took 450.60ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 56.8MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,154 INFO L158 Benchmark]: TraceAbstraction took 41513.10ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 109.8MB in the end (delta: -53.1MB). Peak memory consumption was 710.2MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,154 INFO L158 Benchmark]: Witness Printer took 102.75ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 100.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:12:09,154 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.91ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.27ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 90.3MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.27ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.95ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.2MB in the end (delta: 3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 450.60ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 56.8MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41513.10ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 56.8MB in the beginning and 109.8MB in the end (delta: -53.1MB). Peak memory consumption was 710.2MB. Max. memory is 16.1GB. * Witness Printer took 102.75ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 100.5MB in the end (delta: 9.4MB). 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#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~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[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#4 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#4,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#4,GLOBAL],[IdentifierExpression[~#unsigned_long_int_Array_0~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[~#BOOL_unsigned_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[~#signed_long_int_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#signed_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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[~#BOOL_unsigned_char_Array_0~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, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 29, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2281 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2273 mSDsluCounter, 14564 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11131 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5107 IncrementalHoareTripleChecker+Invalid, 5414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 3433 mSDtfsCounter, 5107 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2731 GetRequests, 2491 SyntacticMatches, 9 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=26, InterpolantAutomatonStates: 200, 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, 29 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 5382 NumberOfCodeBlocks, 5382 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 5098 ConstructedInterpolants, 0 QuantifiedInterpolants, 16803 SizeOfPredicates, 62 NumberOfNonLiveVariables, 5602 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 40 InterpolantComputations, 27 PerfectInterpolantSequences, 18965/19388 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-04 01:12:09,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE