./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohendiv-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/recursified_nla-digbench/recursified_cohendiv-ll.c -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 7c6261a52ba91bad3864c182e4633afd262bc5fe07cf18f92cb66db83623b9ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:48:05,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:48:05,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:48:05,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:48:05,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:48:05,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:48:05,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:48:05,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:48:05,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:48:05,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:48:05,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:48:05,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:48:05,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:48:05,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:48:05,998 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:48:05,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:48:05,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:48:06,000 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:48:06,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:48:06,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:48:06,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:48:06,001 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 -> 7c6261a52ba91bad3864c182e4633afd262bc5fe07cf18f92cb66db83623b9ae [2025-03-08 05:48:06,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:48:06,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:48:06,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:48:06,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:48:06,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:48:06,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohendiv-ll.c [2025-03-08 05:48:07,371 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80aae38b2/40f50b1eca704be18091c9fb430bcfd0/FLAGa92bbff5e [2025-03-08 05:48:07,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:48:07,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohendiv-ll.c [2025-03-08 05:48:07,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80aae38b2/40f50b1eca704be18091c9fb430bcfd0/FLAGa92bbff5e [2025-03-08 05:48:07,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80aae38b2/40f50b1eca704be18091c9fb430bcfd0 [2025-03-08 05:48:07,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:48:07,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:48:07,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:48:07,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:48:07,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:48:07,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123b3684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07, skipping insertion in model container [2025-03-08 05:48:07,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:48:07,770 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/recursified_nla-digbench/recursified_cohendiv-ll.c[1136,1149] [2025-03-08 05:48:07,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:48:07,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:48:07,810 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/recursified_nla-digbench/recursified_cohendiv-ll.c[1136,1149] [2025-03-08 05:48:07,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:48:07,831 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:48:07,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07 WrapperNode [2025-03-08 05:48:07,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:48:07,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:48:07,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:48:07,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:48:07,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,866 INFO L138 Inliner]: procedures = 17, calls = 84, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-08 05:48:07,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:48:07,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:48:07,870 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:48:07,870 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:48:07,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,906 INFO L175 MemorySlicer]: Split 49 memory accesses to 7 slices as follows [2, 10, 8, 6, 8, 10, 5]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 12 writes are split as follows [0, 2, 3, 2, 3, 1, 1]. [2025-03-08 05:48:07,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:48:07,926 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:48:07,926 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:48:07,926 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:48:07,927 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (1/1) ... [2025-03-08 05:48:07,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:48:07,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:07,951 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-08 05:48:07,954 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-08 05:48:07,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 05:48:07,970 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_52_0 [2025-03-08 05:48:07,970 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_52_0 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_55_0 [2025-03-08 05:48:07,971 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_55_0 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:48:07,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:48:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:48:07,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:48:07,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:48:08,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:48:08,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:48:08,209 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2025-03-08 05:48:08,233 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 05:48:08,233 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:48:08,240 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:48:08,241 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:48:08,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:48:08 BoogieIcfgContainer [2025-03-08 05:48:08,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:48:08,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:48:08,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:48:08,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:48:08,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:48:07" (1/3) ... [2025-03-08 05:48:08,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115fa2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:48:08, skipping insertion in model container [2025-03-08 05:48:08,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:48:07" (2/3) ... [2025-03-08 05:48:08,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2115fa2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:48:08, skipping insertion in model container [2025-03-08 05:48:08,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:48:08" (3/3) ... [2025-03-08 05:48:08,250 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohendiv-ll.c [2025-03-08 05:48:08,261 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:48:08,263 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohendiv-ll.c that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:48:08,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:48:08,313 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;@35070405, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:48:08,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:48:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 30 states have internal predecessors, (34), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 05:48:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:48:08,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:08,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:08,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:08,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:08,326 INFO L85 PathProgramCache]: Analyzing trace with hash -555318883, now seen corresponding path program 1 times [2025-03-08 05:48:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405969471] [2025-03-08 05:48:08,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:08,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:08,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:48:08,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:48:08,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:08,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:48:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405969471] [2025-03-08 05:48:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405969471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:08,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:08,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:48:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685292503] [2025-03-08 05:48:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:48:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:08,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:48:08,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:48:08,513 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 30 states have internal predecessors, (34), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:48:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:08,527 INFO L93 Difference]: Finished difference Result 83 states and 119 transitions. [2025-03-08 05:48:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:48:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 05:48:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:08,534 INFO L225 Difference]: With dead ends: 83 [2025-03-08 05:48:08,535 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 05:48:08,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-08 05:48:08,541 INFO L435 NwaCegarLoop]: 52 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, 52 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-08 05:48:08,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:48:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 05:48:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-08 05:48:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 05:48:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-08 05:48:08,573 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 11 [2025-03-08 05:48:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:08,574 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-08 05:48:08,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:48:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-08 05:48:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:48:08,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:08,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:08,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:48:08,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:08,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:08,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1932193950, now seen corresponding path program 1 times [2025-03-08 05:48:08,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566575203] [2025-03-08 05:48:08,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:08,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:48:08,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:48:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:08,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [696785053] [2025-03-08 05:48:08,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:08,645 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-08 05:48:08,646 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-08 05:48:08,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:48:08,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:48:08,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:08,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:08,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 05:48:08,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:08,793 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-08 05:48:08,802 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 11 treesize of output 7 [2025-03-08 05:48:08,811 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 11 treesize of output 7 [2025-03-08 05:48:08,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 05:48:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:48:08,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:48:08,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566575203] [2025-03-08 05:48:08,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:08,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696785053] [2025-03-08 05:48:08,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696785053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:08,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:48:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302855641] [2025-03-08 05:48:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:08,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:48:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:08,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:48:08,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:48:08,938 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:48:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:09,069 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-08 05:48:09,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:48:09,070 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 05:48:09,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:09,071 INFO L225 Difference]: With dead ends: 56 [2025-03-08 05:48:09,071 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 05:48:09,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:48:09,072 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:09,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 249 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 05:48:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2025-03-08 05:48:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.121212121212121) internal successors, (37), 36 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-08 05:48:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2025-03-08 05:48:09,079 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2025-03-08 05:48:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:09,079 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2025-03-08 05:48:09,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:48:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2025-03-08 05:48:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 05:48:09,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:09,080 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:09,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:48:09,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:09,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:09,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 140198345, now seen corresponding path program 1 times [2025-03-08 05:48:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936059579] [2025-03-08 05:48:09,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:09,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:48:09,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:48:09,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67018376] [2025-03-08 05:48:09,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:09,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:09,326 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-08 05:48:09,327 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-08 05:48:09,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 05:48:09,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 05:48:09,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:09,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:09,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 05:48:09,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:09,430 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-08 05:48:09,432 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-08 05:48:09,437 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-08 05:48:09,443 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 11 treesize of output 7 [2025-03-08 05:48:09,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 19 treesize of output 11 [2025-03-08 05:48:09,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:48:09,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-08 05:48:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:48:09,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:48:09,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:09,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936059579] [2025-03-08 05:48:09,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:09,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67018376] [2025-03-08 05:48:09,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67018376] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:09,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:09,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2025-03-08 05:48:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560088083] [2025-03-08 05:48:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:09,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:48:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:09,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:48:09,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:48:09,745 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:48:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:09,915 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2025-03-08 05:48:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:48:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-03-08 05:48:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:09,917 INFO L225 Difference]: With dead ends: 61 [2025-03-08 05:48:09,917 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 05:48:09,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:48:09,918 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:09,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 235 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 05:48:09,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2025-03-08 05:48:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 39 states have internal predecessors, (40), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-08 05:48:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2025-03-08 05:48:09,935 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 17 [2025-03-08 05:48:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:09,935 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2025-03-08 05:48:09,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:48:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2025-03-08 05:48:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 05:48:09,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:09,935 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:09,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:48:10,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 05:48:10,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:10,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -57734187, now seen corresponding path program 1 times [2025-03-08 05:48:10,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:10,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-03-08 05:48:10,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:10,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:10,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:48:10,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:48:10,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:10,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:10,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814830546] [2025-03-08 05:48:10,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:10,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:10,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:10,189 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-08 05:48:10,190 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-08 05:48:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:48:10,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:48:10,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:10,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:10,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 05:48:10,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:10,296 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-08 05:48:10,305 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-08 05:48:10,309 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 11 treesize of output 7 [2025-03-08 05:48:10,354 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 19 treesize of output 11 [2025-03-08 05:48:10,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:48:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:48:10,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:48:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068730413] [2025-03-08 05:48:10,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814830546] [2025-03-08 05:48:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814830546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:48:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906704260] [2025-03-08 05:48:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:48:10,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:10,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:48:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:48:10,390 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:48:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:10,552 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2025-03-08 05:48:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:48:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 05:48:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:10,554 INFO L225 Difference]: With dead ends: 77 [2025-03-08 05:48:10,554 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 05:48:10,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:48:10,555 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:10,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:10,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 05:48:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-08 05:48:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.108695652173913) internal successors, (51), 49 states have internal predecessors, (51), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-08 05:48:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2025-03-08 05:48:10,564 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 27 [2025-03-08 05:48:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:10,564 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2025-03-08 05:48:10,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 05:48:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2025-03-08 05:48:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 05:48:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:10,565 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:10,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:48:10,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:10,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:10,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1709502861, now seen corresponding path program 1 times [2025-03-08 05:48:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:10,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071019203] [2025-03-08 05:48:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:10,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:48:10,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:48:10,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:10,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:10,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739140833] [2025-03-08 05:48:10,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:10,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:10,814 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-08 05:48:10,816 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-08 05:48:10,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 05:48:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 05:48:10,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:10,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:10,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 05:48:10,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:10,903 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 11 treesize of output 7 [2025-03-08 05:48:10,907 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-08 05:48:10,919 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 7 [2025-03-08 05:48:10,959 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 19 treesize of output 11 [2025-03-08 05:48:10,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:48:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:48:10,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:48:10,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071019203] [2025-03-08 05:48:10,982 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:10,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739140833] [2025-03-08 05:48:10,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739140833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:10,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:10,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:48:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429303368] [2025-03-08 05:48:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:10,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:48:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:10,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:48:10,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:48:10,983 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:48:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:11,137 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-03-08 05:48:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:48:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-08 05:48:11,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:11,138 INFO L225 Difference]: With dead ends: 81 [2025-03-08 05:48:11,138 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 05:48:11,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:48:11,138 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:11,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 73 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:48:11,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 05:48:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-08 05:48:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 48 states have internal predecessors, (50), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-08 05:48:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2025-03-08 05:48:11,146 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 27 [2025-03-08 05:48:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:11,146 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2025-03-08 05:48:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:48:11,146 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2025-03-08 05:48:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:48:11,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:11,146 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 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-08 05:48:11,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:48:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:11,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1367709379, now seen corresponding path program 1 times [2025-03-08 05:48:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899684823] [2025-03-08 05:48:11,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:48:11,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:48:11,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:11,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830665110] [2025-03-08 05:48:11,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:11,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:11,395 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-08 05:48:11,397 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-08 05:48:11,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:48:11,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:48:11,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:11,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:11,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-08 05:48:11,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:11,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 15 treesize of output 1 [2025-03-08 05:48:11,502 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 11 treesize of output 7 [2025-03-08 05:48:11,505 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-08 05:48:11,742 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 19 treesize of output 11 [2025-03-08 05:48:11,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-08 05:48:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:48:11,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:48:11,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899684823] [2025-03-08 05:48:11,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830665110] [2025-03-08 05:48:11,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830665110] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:11,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:11,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 11 [2025-03-08 05:48:11,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997666199] [2025-03-08 05:48:11,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:11,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:48:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:11,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:48:11,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:48:11,866 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:48:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:12,102 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2025-03-08 05:48:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:48:12,103 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-08 05:48:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:12,104 INFO L225 Difference]: With dead ends: 104 [2025-03-08 05:48:12,104 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 05:48:12,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:48:12,105 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:12,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 244 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 05:48:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-08 05:48:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.09375) internal successors, (70), 68 states have internal predecessors, (70), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (27), 23 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-08 05:48:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 122 transitions. [2025-03-08 05:48:12,118 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 122 transitions. Word has length 33 [2025-03-08 05:48:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:12,118 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 122 transitions. [2025-03-08 05:48:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 05:48:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2025-03-08 05:48:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:48:12,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:12,121 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 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-08 05:48:12,127 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-08 05:48:12,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:12,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:12,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:12,325 INFO L85 PathProgramCache]: Analyzing trace with hash 565006247, now seen corresponding path program 1 times [2025-03-08 05:48:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830157755] [2025-03-08 05:48:12,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:12,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:12,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:48:12,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:48:12,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:12,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:48:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830157755] [2025-03-08 05:48:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830157755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:48:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:48:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 05:48:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440448415] [2025-03-08 05:48:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:48:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:13,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:48:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:48:13,297 INFO L87 Difference]: Start difference. First operand 101 states and 122 transitions. Second operand has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:48:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:13,573 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-03-08 05:48:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:48:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2025-03-08 05:48:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:13,574 INFO L225 Difference]: With dead ends: 107 [2025-03-08 05:48:13,574 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 05:48:13,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:48:13,575 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:13,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 256 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 05:48:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 05:48:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 25 states have call successors, (25), 12 states have call predecessors, (25), 12 states have return successors, (27), 23 states have call predecessors, (27), 24 states have call successors, (27) [2025-03-08 05:48:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2025-03-08 05:48:13,587 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 39 [2025-03-08 05:48:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-03-08 05:48:13,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:48:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2025-03-08 05:48:13,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 05:48:13,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:13,589 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 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-08 05:48:13,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:48:13,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:13,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:13,589 INFO L85 PathProgramCache]: Analyzing trace with hash -426308376, now seen corresponding path program 1 times [2025-03-08 05:48:13,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:13,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113133544] [2025-03-08 05:48:13,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:13,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:13,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 05:48:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:48:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:13,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:13,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974838521] [2025-03-08 05:48:13,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:13,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:13,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:13,632 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-08 05:48:13,634 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-08 05:48:13,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 05:48:13,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 05:48:13,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:13,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:13,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 05:48:13,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:13,728 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-08 05:48:13,736 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 11 treesize of output 7 [2025-03-08 05:48:13,739 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-08 05:48:13,921 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 19 treesize of output 11 [2025-03-08 05:48:17,972 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 13 [2025-03-08 05:48:17,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:48:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 05:48:18,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:18,073 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 35 treesize of output 27 [2025-03-08 05:48:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:48:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113133544] [2025-03-08 05:48:18,164 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:18,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974838521] [2025-03-08 05:48:18,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974838521] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:18,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:18,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2025-03-08 05:48:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687814248] [2025-03-08 05:48:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:48:18,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:48:18,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:18,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:48:18,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=174, Unknown=1, NotChecked=0, Total=210 [2025-03-08 05:48:18,165 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:48:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:18,428 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2025-03-08 05:48:18,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:48:18,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2025-03-08 05:48:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:18,430 INFO L225 Difference]: With dead ends: 121 [2025-03-08 05:48:18,430 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 05:48:18,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=57, Invalid=284, Unknown=1, NotChecked=0, Total=342 [2025-03-08 05:48:18,433 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:18,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 216 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:48:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 05:48:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2025-03-08 05:48:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (29), 23 states have call predecessors, (29), 24 states have call successors, (29) [2025-03-08 05:48:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2025-03-08 05:48:18,450 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 46 [2025-03-08 05:48:18,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:18,450 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2025-03-08 05:48:18,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:48:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2025-03-08 05:48:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 05:48:18,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:18,451 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:18,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:48:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:18,652 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:18,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1532820335, now seen corresponding path program 1 times [2025-03-08 05:48:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500470108] [2025-03-08 05:48:18,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:48:18,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:48:18,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:18,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:18,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2029697989] [2025-03-08 05:48:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:18,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:18,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:18,682 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-08 05:48:18,684 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-08 05:48:18,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 05:48:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 05:48:18,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:18,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-03-08 05:48:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:18,801 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-08 05:48:18,809 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-08 05:48:18,873 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 11 treesize of output 7 [2025-03-08 05:48:18,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2025-03-08 05:48:18,901 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 7 [2025-03-08 05:48:19,129 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 15 [2025-03-08 05:48:19,197 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 26 treesize of output 14 [2025-03-08 05:48:19,199 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 22 treesize of output 10 [2025-03-08 05:48:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:48:19,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:19,462 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 15 [2025-03-08 05:48:19,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:19,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500470108] [2025-03-08 05:48:19,847 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:19,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029697989] [2025-03-08 05:48:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029697989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:19,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:19,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-08 05:48:19,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830610197] [2025-03-08 05:48:19,847 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:19,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:48:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:19,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:48:19,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:48:19,848 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 20 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:48:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:20,763 INFO L93 Difference]: Finished difference Result 137 states and 165 transitions. [2025-03-08 05:48:20,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 05:48:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2025-03-08 05:48:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:20,768 INFO L225 Difference]: With dead ends: 137 [2025-03-08 05:48:20,768 INFO L226 Difference]: Without dead ends: 135 [2025-03-08 05:48:20,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=1603, Unknown=6, NotChecked=0, Total=1806 [2025-03-08 05:48:20,769 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 35 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:20,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 220 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 704 Invalid, 19 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:48:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-08 05:48:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-03-08 05:48:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 89 states have internal predecessors, (91), 30 states have call successors, (30), 15 states have call predecessors, (30), 18 states have return successors, (39), 29 states have call predecessors, (39), 29 states have call successors, (39) [2025-03-08 05:48:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2025-03-08 05:48:20,796 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 52 [2025-03-08 05:48:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2025-03-08 05:48:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 7 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 05:48:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2025-03-08 05:48:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:48:20,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:20,798 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:20,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 05:48:20,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:20,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:20,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1715474711, now seen corresponding path program 1 times [2025-03-08 05:48:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651424873] [2025-03-08 05:48:20,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:21,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:48:21,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:48:21,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:21,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:21,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346128024] [2025-03-08 05:48:21,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:21,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:21,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:21,028 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-08 05:48:21,030 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-08 05:48:21,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:48:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:48:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:21,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-08 05:48:21,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:21,154 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-08 05:48:21,158 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 11 treesize of output 7 [2025-03-08 05:48:21,162 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-08 05:48:21,406 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 17 [2025-03-08 05:48:21,415 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 11 [2025-03-08 05:48:21,460 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 13 [2025-03-08 05:48:21,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:48:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:48:21,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 05:48:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:21,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651424873] [2025-03-08 05:48:21,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346128024] [2025-03-08 05:48:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346128024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:48:21,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:48:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-08 05:48:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83106619] [2025-03-08 05:48:21,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:21,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:48:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:21,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:48:21,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:48:21,652 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand has 15 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 8 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:48:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:22,219 INFO L93 Difference]: Finished difference Result 201 states and 243 transitions. [2025-03-08 05:48:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:48:22,220 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 8 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 55 [2025-03-08 05:48:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:22,222 INFO L225 Difference]: With dead ends: 201 [2025-03-08 05:48:22,223 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 05:48:22,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:48:22,224 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 62 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:22,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 376 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:48:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 05:48:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2025-03-08 05:48:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 121 states have (on average 1.0826446280991735) internal successors, (131), 128 states have internal predecessors, (131), 41 states have call successors, (41), 22 states have call predecessors, (41), 30 states have return successors, (62), 43 states have call predecessors, (62), 39 states have call successors, (62) [2025-03-08 05:48:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 234 transitions. [2025-03-08 05:48:22,252 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 234 transitions. Word has length 55 [2025-03-08 05:48:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:22,252 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 234 transitions. [2025-03-08 05:48:22,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 8 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:48:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 234 transitions. [2025-03-08 05:48:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:48:22,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:22,253 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:22,264 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-08 05:48:22,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 05:48:22,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:22,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1933356164, now seen corresponding path program 2 times [2025-03-08 05:48:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219435575] [2025-03-08 05:48:22,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:22,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-08 05:48:22,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:48:22,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:22,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601104526] [2025-03-08 05:48:22,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:48:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:22,494 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-08 05:48:22,496 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-08 05:48:22,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-08 05:48:22,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:48:22,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:48:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:22,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-08 05:48:22,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:22,658 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-08 05:48:22,660 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-08 05:48:22,663 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 11 treesize of output 7 [2025-03-08 05:48:22,667 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-08 05:48:22,832 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-08 05:48:22,847 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 11 treesize of output 7 [2025-03-08 05:48:22,871 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 7 [2025-03-08 05:48:23,150 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 11 [2025-03-08 05:48:23,157 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 35 treesize of output 27 [2025-03-08 05:48:23,161 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 35 treesize of output 21 [2025-03-08 05:48:23,286 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 17 [2025-03-08 05:48:23,288 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 13 [2025-03-08 05:48:23,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-08 05:48:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 05:48:23,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:27,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219435575] [2025-03-08 05:48:27,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601104526] [2025-03-08 05:48:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601104526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:27,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-08 05:48:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360715886] [2025-03-08 05:48:27,788 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:27,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:48:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:27,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:48:27,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=290, Unknown=1, NotChecked=0, Total=342 [2025-03-08 05:48:27,789 INFO L87 Difference]: Start difference. First operand 193 states and 234 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 05:48:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:48:28,786 INFO L93 Difference]: Finished difference Result 325 states and 374 transitions. [2025-03-08 05:48:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:48:28,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2025-03-08 05:48:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:48:28,789 INFO L225 Difference]: With dead ends: 325 [2025-03-08 05:48:28,790 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 05:48:28,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=113, Invalid=588, Unknown=1, NotChecked=0, Total=702 [2025-03-08 05:48:28,790 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:48:28,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 237 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:48:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 05:48:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 318. [2025-03-08 05:48:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 204 states have (on average 1.0784313725490196) internal successors, (220), 214 states have internal predecessors, (220), 59 states have call successors, (59), 42 states have call predecessors, (59), 54 states have return successors, (89), 62 states have call predecessors, (89), 56 states have call successors, (89) [2025-03-08 05:48:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 368 transitions. [2025-03-08 05:48:28,828 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 368 transitions. Word has length 58 [2025-03-08 05:48:28,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:48:28,829 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 368 transitions. [2025-03-08 05:48:28,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 6 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 05:48:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 368 transitions. [2025-03-08 05:48:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:48:28,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:48:28,830 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:48:28,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:48:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:29,030 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:48:29,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:48:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1209764954, now seen corresponding path program 1 times [2025-03-08 05:48:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:48:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866066535] [2025-03-08 05:48:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:48:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:48:29,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:48:29,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:48:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564527762] [2025-03-08 05:48:29,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:48:29,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:48:29,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:48:29,071 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-08 05:48:29,072 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-08 05:48:29,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:48:29,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:48:29,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:48:29,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:48:29,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 138 conjuncts are in the unsatisfiable core [2025-03-08 05:48:29,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:48:29,232 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-08 05:48:29,236 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-08 05:48:29,240 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-08 05:48:29,246 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 11 treesize of output 7 [2025-03-08 05:48:29,259 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 7 [2025-03-08 05:48:29,520 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-08 05:48:29,528 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 11 treesize of output 7 [2025-03-08 05:48:29,594 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 7 [2025-03-08 05:48:33,829 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_3| Int) (|v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_3| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_3| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_3| Int)) (<= (select (select |c_#memory_int#5| |v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_3|) |v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_3|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_3|) |v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_3|))) is different from true [2025-03-08 05:48:34,088 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 35 treesize of output 27 [2025-03-08 05:48:34,236 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 7 [2025-03-08 05:48:34,755 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 46 treesize of output 28 [2025-03-08 05:48:34,808 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 11 [2025-03-08 05:48:34,856 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 38 treesize of output 26 [2025-03-08 05:48:34,860 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 47 treesize of output 31 [2025-03-08 05:48:34,864 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 35 treesize of output 19 [2025-03-08 05:48:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 40 proven. 6 refuted. 15 times theorem prover too weak. 31 trivial. 15 not checked. [2025-03-08 05:48:34,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:48:36,848 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 74 treesize of output 66 [2025-03-08 05:48:36,858 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 66 treesize of output 50 [2025-03-08 05:48:40,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (forall ((|v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~q.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~q.offset_BEFORE_CALL_7| Int)) (= (+ (* (select (select |c_#memory_int#5| |v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_7|) (select (select |c_#memory_int#3| |v_func_to_recursive_line_32_to_55_0_#in~q.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~q.offset_BEFORE_CALL_7|)) (select (select |c_#memory_int#1| |v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_7|)) (select (select |c_#memory_int#6| |v_func_to_recursive_line_32_to_55_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~x.offset_BEFORE_CALL_7|)))) (.cse0 (select (select |c_old(#memory_int#1)| |c_func_to_recursive_line_32_to_55_0_#in~r.base|) |c_func_to_recursive_line_32_to_55_0_#in~r.offset|)) (.cse1 (select (select |c_#memory_int#5| |c_func_to_recursive_line_32_to_55_0_#in~y.base|) |c_func_to_recursive_line_32_to_55_0_#in~y.offset|))) (and (or (< (select (select |c_#memory_int#6| |c_func_to_recursive_line_32_to_55_0_#in~x.base|) |c_func_to_recursive_line_32_to_55_0_#in~x.offset|) (+ .cse0 (* .cse1 (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_32_to_55_0_#in~q.base|) |c_func_to_recursive_line_32_to_55_0_#in~q.offset|)) 1)) .cse2) (or .cse2 (< .cse0 .cse1)) (forall ((|v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~q.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_32_to_55_0_#in~q.offset_BEFORE_CALL_7| Int)) (let ((.cse3 (select (select |c_#memory_int#5| |v_func_to_recursive_line_32_to_55_0_#in~y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~y.offset_BEFORE_CALL_7|)) (.cse4 (select (select |c_#memory_int#6| |v_func_to_recursive_line_32_to_55_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~x.offset_BEFORE_CALL_7|))) (or (= (+ (* .cse3 (select (select |c_#memory_int#3| |v_func_to_recursive_line_32_to_55_0_#in~q.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~q.offset_BEFORE_CALL_7|)) (select (select |c_#memory_int#1| |v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_7|)) .cse4) (not (= (+ (* (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_32_to_55_0_#in~q.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~q.offset_BEFORE_CALL_7|) .cse3) (select (select |c_old(#memory_int#1)| |v_func_to_recursive_line_32_to_55_0_#in~r.base_BEFORE_CALL_7|) |v_func_to_recursive_line_32_to_55_0_#in~r.offset_BEFORE_CALL_7|)) .cse4))))))) is different from false [2025-03-08 05:48:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:48:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866066535] [2025-03-08 05:48:44,009 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:48:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564527762] [2025-03-08 05:48:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564527762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:48:44,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:48:44,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-08 05:48:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644564095] [2025-03-08 05:48:44,010 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:48:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:48:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:48:44,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:48:44,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=674, Unknown=2, NotChecked=106, Total=870 [2025-03-08 05:48:44,020 INFO L87 Difference]: Start difference. First operand 318 states and 368 transitions. Second operand has 21 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 7 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 05:48:48,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 05:48:52,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:48:56,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:01,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:06,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:10,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:14,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 05:49:18,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 05:49:23,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:27,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 05:49:31,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:35,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:40,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 05:49:44,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-08 05:49:48,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]