./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:09:19,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:09:19,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:09:19,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:09:19,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:09:19,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:09:19,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:09:19,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:09:19,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:09:19,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:09:19,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:09:19,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:09:19,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:09:19,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:09:19,916 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:09:19,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:09:19,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:09:19,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:09:19,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:09:19,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:09:19,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:09:19,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:09:19,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:09:19,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:09:19,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:09:19,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:09:19,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:09:19,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:09:19,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:09:19,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:09:19,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:09:19,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:09:19,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:09:19,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:09:19,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:09:19,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:09:19,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:09:19,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:09:19,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:09:19,925 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:09:19,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:09:19,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:09:19,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/certificate-witnesses-artifact/automizer 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 -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 13:09:20,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:09:20,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:09:20,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:09:20,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:09:20,180 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:09:20,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-20 13:09:21,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:09:21,647 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:09:21,647 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-20 13:09:21,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/24600554e/5d0118a58c5045b7a94d7fc2847b8e8b/FLAG4e2baa920 [2024-09-20 13:09:22,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/24600554e/5d0118a58c5045b7a94d7fc2847b8e8b [2024-09-20 13:09:22,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:09:22,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 13:09:22,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:09:22,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:09:22,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:09:22,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7660533d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22, skipping insertion in model container [2024-09-20 13:09:22,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:09:22,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-20 13:09:22,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:09:22,239 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 13:09:22,248 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-20 13:09:22,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:09:22,275 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:09:22,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22 WrapperNode [2024-09-20 13:09:22,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:09:22,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:09:22,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:09:22,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:09:22,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,296 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 13:09:22,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:09:22,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:09:22,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:09:22,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:09:22,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,337 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 5, 11, 11, 5, 3]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 0, 0, 1, 1]. The 9 writes are split as follows [0, 1, 3, 3, 1, 1]. [2024-09-20 13:09:22,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:09:22,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:09:22,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:09:22,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:09:22,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (1/1) ... [2024-09-20 13:09:22,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:09:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:09:22,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 13:09:22,391 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 13:09:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-20 13:09:22,448 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-20 13:09:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:09:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-20 13:09:22,448 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-20 13:09:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:09:22,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:09:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 13:09:22,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 13:09:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 13:09:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 13:09:22,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 13:09:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-20 13:09:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-20 13:09:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-20 13:09:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 13:09:22,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-20 13:09:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 13:09:22,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 13:09:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-20 13:09:22,465 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-20 13:09:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:09:22,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-20 13:09:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:09:22,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:09:22,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 13:09:22,552 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:09:22,554 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:09:22,772 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-20 13:09:22,772 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:09:22,793 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:09:22,793 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-20 13:09:22,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:09:22 BoogieIcfgContainer [2024-09-20 13:09:22,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:09:22,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:09:22,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:09:22,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:09:22,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:09:22" (1/3) ... [2024-09-20 13:09:22,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1947af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:09:22, skipping insertion in model container [2024-09-20 13:09:22,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:09:22" (2/3) ... [2024-09-20 13:09:22,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1947af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:09:22, skipping insertion in model container [2024-09-20 13:09:22,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:09:22" (3/3) ... [2024-09-20 13:09:22,803 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-20 13:09:22,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:09:22,817 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 13:09:22,875 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:09:22,883 INFO L336 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=All, 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;@a94cc34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:09:22,884 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 13:09:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-20 13:09:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:09:22,894 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:22,895 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-20 13:09:22,896 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:09:22,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-20 13:09:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:09:22,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920077736] [2024-09-20 13:09:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:09:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:09:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:09:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:09:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:09:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:09:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:09:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920077736] [2024-09-20 13:09:23,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920077736] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:09:23,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:09:23,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:09:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697902025] [2024-09-20 13:09:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:09:23,142 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:09:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:09:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:09:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:09:23,162 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:09:23,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:09:23,314 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-20 13:09:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:09:23,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-20 13:09:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:09:23,324 INFO L225 Difference]: With dead ends: 102 [2024-09-20 13:09:23,324 INFO L226 Difference]: Without dead ends: 56 [2024-09-20 13:09:23,327 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:09:23,330 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:09:23,331 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:09:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-20 13:09:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-20 13:09:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 13:09:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-20 13:09:23,368 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-20 13:09:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:09:23,368 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-20 13:09:23,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:09:23,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-20 13:09:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-20 13:09:23,371 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:23,371 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-20 13:09:23,371 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:09:23,371 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:09:23,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-20 13:09:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:09:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919950717] [2024-09-20 13:09:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:09:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:09:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:09:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 13:09:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:09:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:09:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:09:23,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919950717] [2024-09-20 13:09:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919950717] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:09:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:09:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-20 13:09:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882030069] [2024-09-20 13:09:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:09:23,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:09:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:09:23,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:09:23,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:09:23,826 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:09:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:09:24,026 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-20 13:09:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:09:24,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-20 13:09:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:09:24,028 INFO L225 Difference]: With dead ends: 81 [2024-09-20 13:09:24,028 INFO L226 Difference]: Without dead ends: 47 [2024-09-20 13:09:24,029 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-20 13:09:24,029 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:09:24,030 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:09:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-20 13:09:24,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-20 13:09:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-20 13:09:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-20 13:09:24,046 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-20 13:09:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:09:24,046 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-20 13:09:24,046 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:09:24,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-20 13:09:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-20 13:09:24,048 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:24,048 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-20 13:09:24,048 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:09:24,048 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:09:24,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-20 13:09:24,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:09:24,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602455246] [2024-09-20 13:09:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:24,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:09:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:09:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:09:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:09:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-20 13:09:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-20 13:09:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-20 13:09:24,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:09:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602455246] [2024-09-20 13:09:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602455246] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:09:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719230676] [2024-09-20 13:09:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:09:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:09:24,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:09:24,564 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:09:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:24,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-20 13:09:24,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:09:24,840 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 [2024-09-20 13:09:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:09:25,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:09:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-20 13:09:25,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719230676] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:09:25,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:09:25,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-09-20 13:09:25,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340584874] [2024-09-20 13:09:25,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:09:25,332 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 13:09:25,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:09:25,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 13:09:25,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-09-20 13:09:25,333 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-20 13:09:29,378 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] [2024-09-20 13:09:33,476 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] [2024-09-20 13:09:37,610 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] [2024-09-20 13:09:41,697 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] [2024-09-20 13:09:46,109 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] [2024-09-20 13:09:50,147 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] [2024-09-20 13:09:54,179 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] [2024-09-20 13:09:58,272 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] [2024-09-20 13:09:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:09:58,272 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-09-20 13:09:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-20 13:09:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 36 [2024-09-20 13:09:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:09:58,280 INFO L225 Difference]: With dead ends: 116 [2024-09-20 13:09:58,280 INFO L226 Difference]: Without dead ends: 80 [2024-09-20 13:09:58,280 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2024-09-20 13:09:58,283 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 35 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-09-20 13:09:58,283 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 138 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 730 Invalid, 8 Unknown, 0 Unchecked, 32.5s Time] [2024-09-20 13:09:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-20 13:09:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-09-20 13:09:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 49 states have internal predecessors, (52), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (16), 13 states have call predecessors, (16), 14 states have call successors, (16) [2024-09-20 13:09:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-09-20 13:09:58,301 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2024-09-20 13:09:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:09:58,301 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-09-20 13:09:58,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-20 13:09:58,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-09-20 13:09:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-20 13:09:58,305 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:58,306 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-09-20 13:09:58,325 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:09:58,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:09:58,510 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:09:58,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -908744810, now seen corresponding path program 1 times [2024-09-20 13:09:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:09:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389254249] [2024-09-20 13:09:58,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:09:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:58,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:09:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:58,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:09:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:09:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:09:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 13:09:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:09:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-20 13:09:59,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:09:59,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389254249] [2024-09-20 13:09:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389254249] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:09:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702863176] [2024-09-20 13:09:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:09:59,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:09:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:09:59,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:09:59,237 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 13:09:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:09:59,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-20 13:09:59,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:09:59,567 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 [2024-09-20 13:09:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-20 13:09:59,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:09:59,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702863176] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:09:59,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:09:59,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-09-20 13:09:59,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915321260] [2024-09-20 13:09:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:09:59,741 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 13:09:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:09:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 13:09:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2024-09-20 13:09:59,742 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:09:59,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:09:59,936 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-09-20 13:09:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 13:09:59,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2024-09-20 13:09:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:09:59,938 INFO L225 Difference]: With dead ends: 81 [2024-09-20 13:09:59,938 INFO L226 Difference]: Without dead ends: 79 [2024-09-20 13:09:59,938 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2024-09-20 13:09:59,939 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:09:59,939 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:09:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-20 13:09:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-20 13:09:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 18 states have call successors, (18), 13 states have call predecessors, (18), 11 states have return successors, (16), 13 states have call predecessors, (16), 14 states have call successors, (16) [2024-09-20 13:09:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-09-20 13:09:59,965 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 41 [2024-09-20 13:09:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:09:59,965 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-09-20 13:09:59,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:09:59,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:09:59,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-09-20 13:09:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 13:09:59,967 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:09:59,967 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-09-20 13:09:59,979 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 13:10:00,171 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:00,172 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:00,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1404730042, now seen corresponding path program 1 times [2024-09-20 13:10:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13470633] [2024-09-20 13:10:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 13:10:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:10:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-20 13:10:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-20 13:10:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13470633] [2024-09-20 13:10:00,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13470633] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:00,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325179290] [2024-09-20 13:10:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:00,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:00,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:00,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:10:00,761 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 13:10:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:00,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 13:10:00,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-20 13:10:01,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:10:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325179290] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:10:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:10:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-09-20 13:10:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023488422] [2024-09-20 13:10:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:10:01,070 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:10:01,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:01,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:10:01,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-09-20 13:10:01,071 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-20 13:10:01,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:10:01,212 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-09-20 13:10:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 13:10:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2024-09-20 13:10:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:10:01,214 INFO L225 Difference]: With dead ends: 96 [2024-09-20 13:10:01,214 INFO L226 Difference]: Without dead ends: 73 [2024-09-20 13:10:01,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-09-20 13:10:01,215 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:10:01,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:10:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-20 13:10:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-09-20 13:10:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-20 13:10:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-09-20 13:10:01,225 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 47 [2024-09-20 13:10:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:10:01,225 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-09-20 13:10:01,226 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-20 13:10:01,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-09-20 13:10:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-20 13:10:01,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:10:01,227 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-09-20 13:10:01,239 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:10:01,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:01,428 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:10:01,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:10:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1142626696, now seen corresponding path program 1 times [2024-09-20 13:10:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:10:01,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111947911] [2024-09-20 13:10:01,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:01,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:10:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:10:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:10:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:10:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-20 13:10:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 13:10:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-20 13:10:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-20 13:10:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-20 13:10:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:10:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111947911] [2024-09-20 13:10:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111947911] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:10:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652452937] [2024-09-20 13:10:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:10:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:10:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:10:01,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:10:01,967 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 13:10:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:10:02,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-09-20 13:10:02,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:10:02,090 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 [2024-09-20 13:10:02,093 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 [2024-09-20 13:10:02,618 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-20 13:10:02,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 63 [2024-09-20 13:10:02,655 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-20 13:10:02,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2024-09-20 13:10:02,985 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 40 treesize of output 28 [2024-09-20 13:10:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-20 13:10:03,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:10:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-20 13:10:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652452937] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:10:04,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:10:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 33 [2024-09-20 13:10:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381103261] [2024-09-20 13:10:04,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:10:04,286 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-20 13:10:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:10:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-20 13:10:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2024-09-20 13:10:04,288 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-20 13:10:08,309 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] [2024-09-20 13:10:12,424 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] [2024-09-20 13:10:16,444 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] [2024-09-20 13:10:20,646 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] [2024-09-20 13:10:24,667 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] [2024-09-20 13:10:28,875 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] [2024-09-20 13:10:32,884 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] [2024-09-20 13:10:41,197 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] [2024-09-20 13:10:45,221 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] [2024-09-20 13:10:49,365 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] [2024-09-20 13:11:02,262 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] [2024-09-20 13:11:06,284 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] [2024-09-20 13:11:24,065 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] [2024-09-20 13:11:28,069 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] [2024-09-20 13:11:32,124 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] [2024-09-20 13:11:40,561 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] [2024-09-20 13:11:44,590 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] [2024-09-20 13:11:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:11:44,699 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2024-09-20 13:11:44,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-20 13:11:44,700 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) Word has length 57 [2024-09-20 13:11:44,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:11:44,701 INFO L225 Difference]: With dead ends: 144 [2024-09-20 13:11:44,701 INFO L226 Difference]: Without dead ends: 88 [2024-09-20 13:11:44,705 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=426, Invalid=3599, Unknown=7, NotChecked=0, Total=4032 [2024-09-20 13:11:44,706 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 63 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 54 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.8s IncrementalHoareTripleChecker+Time [2024-09-20 13:11:44,706 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 239 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1312 Invalid, 17 Unknown, 0 Unchecked, 69.8s Time] [2024-09-20 13:11:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-20 13:11:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2024-09-20 13:11:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 45 states have internal predecessors, (47), 14 states have call successors, (14), 12 states have call predecessors, (14), 12 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-20 13:11:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-09-20 13:11:44,719 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 57 [2024-09-20 13:11:44,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:11:44,720 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-09-20 13:11:44,720 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-20 13:11:44,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:11:44,720 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-09-20 13:11:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-20 13:11:44,721 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:11:44,721 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:11:44,736 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 13:11:44,922 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:11:44,922 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:11:44,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:11:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -660333559, now seen corresponding path program 1 times [2024-09-20 13:11:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:11:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62443402] [2024-09-20 13:11:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:11:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:11:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:11:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:11:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:11:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:11:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-20 13:11:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-20 13:11:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-20 13:11:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-20 13:11:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-20 13:11:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,973 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-20 13:11:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-20 13:11:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-20 13:11:45,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:11:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62443402] [2024-09-20 13:11:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62443402] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:11:45,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939656357] [2024-09-20 13:11:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:11:45,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:11:45,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:11:45,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:11:45,980 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 13:11:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:11:46,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-20 13:11:46,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:11:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-20 13:11:46,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:11:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-20 13:11:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939656357] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:11:59,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:11:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 18] total 41 [2024-09-20 13:11:59,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291082574] [2024-09-20 13:11:59,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:11:59,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-20 13:11:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:11:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-20 13:11:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1450, Unknown=3, NotChecked=0, Total=1640 [2024-09-20 13:11:59,920 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 41 states, 31 states have (on average 2.3225806451612905) internal successors, (72), 34 states have internal predecessors, (72), 12 states have call successors, (28), 9 states have call predecessors, (28), 14 states have return successors, (25), 11 states have call predecessors, (25), 12 states have call successors, (25) [2024-09-20 13:12:04,622 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 [] [2024-09-20 13:12:08,628 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 [] [2024-09-20 13:12:12,634 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 [] [2024-09-20 13:12:16,642 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 [] [2024-09-20 13:12:36,715 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 [] [2024-09-20 13:12:40,720 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 [] [2024-09-20 13:12:44,727 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 [] [2024-09-20 13:12:48,736 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 [] [2024-09-20 13:12:52,753 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 [] [2024-09-20 13:12:56,759 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 [] [2024-09-20 13:13:00,773 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 [] [2024-09-20 13:13:04,780 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 [] [2024-09-20 13:13:08,806 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 [] [2024-09-20 13:13:12,813 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 [] [2024-09-20 13:13:16,825 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 [] [2024-09-20 13:13:32,929 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 [] [2024-09-20 13:13:36,936 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 [] [2024-09-20 13:13:40,947 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 [] [2024-09-20 13:13:45,047 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 [] [2024-09-20 13:13:49,053 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 [] [2024-09-20 13:13:53,058 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 [] [2024-09-20 13:13:57,072 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 [] [2024-09-20 13:14:01,081 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 []