./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.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 27b49876 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_3.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 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 --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-27b4987-m [2024-09-21 12:30:40,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 12:30:40,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 12:30:40,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 12:30:40,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 12:30:40,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 12:30:40,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 12:30:40,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 12:30:40,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 12:30:40,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 12:30:40,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 12:30:40,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 12:30:40,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 12:30:40,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 12:30:40,304 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 12:30:40,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 12:30:40,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 12:30:40,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 12:30:40,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 12:30:40,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 12:30:40,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 12:30:40,306 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 12:30:40,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 12:30:40,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 12:30:40,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 12:30:40,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 12:30:40,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 12:30:40,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 12:30:40,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 12:30:40,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 12:30:40,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 12:30:40,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 12:30:40,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:30:40,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 12:30:40,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 12:30:40,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 12:30:40,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 12:30:40,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 12:30:40,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 12:30:40,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 12:30:40,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 12:30:40,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 12:30:40,311 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 -> 7a78b2f82c5c523b03c70ba898547797b8578723f2b367d871b1e6ef867cb4b5 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-21 12:30:40,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 12:30:40,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 12:30:40,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 12:30:40,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 12:30:40,562 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 12:30:40,563 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_3.i [2024-09-21 12:30:41,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 12:30:41,916 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 12:30:41,916 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_3.i [2024-09-21 12:30:41,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bef79a425/92f30332259147c09301af48dc676368/FLAGbc070675c [2024-09-21 12:30:42,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bef79a425/92f30332259147c09301af48dc676368 [2024-09-21 12:30:42,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 12:30:42,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 12:30:42,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 12:30:42,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 12:30:42,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 12:30:42,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64db3c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42, skipping insertion in model container [2024-09-21 12:30:42,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 12:30:42,470 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_3.i[1898,1911] [2024-09-21 12:30:42,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:30:42,490 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 12:30:42,501 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_3.i[1898,1911] [2024-09-21 12:30:42,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:30:42,520 INFO L204 MainTranslator]: Completed translation [2024-09-21 12:30:42,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42 WrapperNode [2024-09-21 12:30:42,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 12:30:42,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 12:30:42,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 12:30:42,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 12:30:42,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,539 INFO L138 Inliner]: procedures = 18, calls = 36, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 12:30:42,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 12:30:42,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 12:30:42,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 12:30:42,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 12:30:42,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,567 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 12, 3, 4]. 57 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 0, 1]. The 5 writes are split as follows [0, 3, 1, 1]. [2024-09-21 12:30:42,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 12:30:42,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 12:30:42,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 12:30:42,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 12:30:42,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (1/1) ... [2024-09-21 12:30:42,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:30:42,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:30:42,615 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-21 12:30:42,617 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-21 12:30:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 12:30:42,651 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 12:30:42,652 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 12:30:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 12:30:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-21 12:30:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-21 12:30:42,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-21 12:30:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-21 12:30:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-21 12:30:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-21 12:30:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-21 12:30:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-21 12:30:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 12:30:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 12:30:42,654 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2024-09-21 12:30:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2024-09-21 12:30:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 12:30:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 12:30:42,655 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 12:30:42,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-21 12:30:42,720 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 12:30:42,722 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 12:30:42,908 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-21 12:30:42,908 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 12:30:42,924 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 12:30:42,924 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-21 12:30:42,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:30:42 BoogieIcfgContainer [2024-09-21 12:30:42,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 12:30:42,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 12:30:42,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 12:30:42,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 12:30:42,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:30:42" (1/3) ... [2024-09-21 12:30:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6a16d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:30:42, skipping insertion in model container [2024-09-21 12:30:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:30:42" (2/3) ... [2024-09-21 12:30:42,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6a16d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:30:42, skipping insertion in model container [2024-09-21 12:30:42,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:30:42" (3/3) ... [2024-09-21 12:30:42,931 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_3.i [2024-09-21 12:30:42,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 12:30:42,945 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 12:30:42,995 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 12:30:43,000 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;@42b117be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 12:30:43,001 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 12:30:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-21 12:30:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-21 12:30:43,009 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:30:43,009 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:30:43,009 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:30:43,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1199349225, now seen corresponding path program 1 times [2024-09-21 12:30:43,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:30:43,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776715009] [2024-09-21 12:30:43,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:30:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:30:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:30:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:30:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:30:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:30:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776715009] [2024-09-21 12:30:43,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776715009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:30:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:30:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:30:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154444563] [2024-09-21 12:30:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:30:43,374 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:30:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:30:43,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:30:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:30:43,395 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 20 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-21 12:30:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:30:43,567 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-09-21 12:30:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:30:43,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-21 12:30:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:30:43,575 INFO L225 Difference]: With dead ends: 60 [2024-09-21 12:30:43,575 INFO L226 Difference]: Without dead ends: 34 [2024-09-21 12:30:43,577 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-21 12:30:43,582 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:30:43,583 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 12:30:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-21 12:30:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-09-21 12:30:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-21 12:30:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-21 12:30:43,620 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2024-09-21 12:30:43,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:30:43,621 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-21 12:30:43,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-21 12:30:43,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-21 12:30:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-21 12:30:43,623 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:30:43,623 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:30:43,623 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 12:30:43,624 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:30:43,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1197502183, now seen corresponding path program 1 times [2024-09-21 12:30:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:30:43,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866157804] [2024-09-21 12:30:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:30:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:30:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:30:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:30:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:30:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:30:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866157804] [2024-09-21 12:30:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866157804] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:30:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:30:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:30:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770205334] [2024-09-21 12:30:43,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:30:43,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:30:43,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:30:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:30:43,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:30:43,925 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 12:30:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:30:44,119 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2024-09-21 12:30:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-21 12:30:44,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-21 12:30:44,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:30:44,121 INFO L225 Difference]: With dead ends: 51 [2024-09-21 12:30:44,122 INFO L226 Difference]: Without dead ends: 32 [2024-09-21 12:30:44,122 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-21 12:30:44,123 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:30:44,124 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 12:30:44,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-21 12:30:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-21 12:30:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-21 12:30:44,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-09-21 12:30:44,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 19 [2024-09-21 12:30:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:30:44,138 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-09-21 12:30:44,139 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 12:30:44,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-09-21 12:30:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-21 12:30:44,141 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:30:44,141 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:30:44,142 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 12:30:44,142 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:30:44,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1550867151, now seen corresponding path program 1 times [2024-09-21 12:30:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:30:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241266478] [2024-09-21 12:30:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:30:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:30:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:44,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:30:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:44,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:30:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:44,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:30:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:30:44,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:30:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241266478] [2024-09-21 12:30:44,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241266478] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:30:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357324311] [2024-09-21 12:30:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:30:44,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:30:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:30:44,616 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-21 12:30:44,617 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-21 12:30:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:44,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-21 12:30:44,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:30:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 12:30:44,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:30:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:30:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357324311] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:30:45,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:30:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2024-09-21 12:30:45,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299707158] [2024-09-21 12:30:45,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:30:45,347 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-21 12:30:45,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:30:45,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-21 12:30:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-09-21 12:30:45,348 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-21 12:30:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:30:45,801 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-09-21 12:30:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-21 12:30:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 24 [2024-09-21 12:30:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:30:45,803 INFO L225 Difference]: With dead ends: 62 [2024-09-21 12:30:45,804 INFO L226 Difference]: Without dead ends: 43 [2024-09-21 12:30:45,805 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2024-09-21 12:30:45,806 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-21 12:30:45,806 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-21 12:30:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-21 12:30:45,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-21 12:30:45,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-21 12:30:45,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-21 12:30:45,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 24 [2024-09-21 12:30:45,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:30:45,824 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-21 12:30:45,824 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-21 12:30:45,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-21 12:30:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-21 12:30:45,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:30:45,825 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:30:45,842 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-21 12:30:46,026 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-21 12:30:46,026 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:30:46,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:30:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1345242693, now seen corresponding path program 2 times [2024-09-21 12:30:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:30:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095252837] [2024-09-21 12:30:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:30:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:30:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:46,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:30:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:46,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:30:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:47,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:30:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:47,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:30:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:47,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:30:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:47,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:30:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:30:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-21 12:30:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:30:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095252837] [2024-09-21 12:30:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095252837] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:30:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59319308] [2024-09-21 12:30:47,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 12:30:47,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:30:47,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:30:47,960 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-21 12:30:47,961 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-21 12:30:48,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 12:30:48,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 12:30:48,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-21 12:30:48,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:30:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-21 12:30:48,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:31:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 12:31:14,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59319308] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:31:14,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:31:14,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 22] total 47 [2024-09-21 12:31:14,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252692526] [2024-09-21 12:31:14,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:31:14,049 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-21 12:31:14,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:31:14,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-21 12:31:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1918, Unknown=6, NotChecked=0, Total=2162 [2024-09-21 12:31:14,050 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 47 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 40 states have internal predecessors, (49), 13 states have call successors, (16), 9 states have call predecessors, (16), 16 states have return successors, (16), 14 states have call predecessors, (16), 12 states have call successors, (16) [2024-09-21 12:31:18,650 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-21 12:31:22,656 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-21 12:31:26,664 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-21 12:31:30,672 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-21 12:31:34,679 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-21 12:31:38,687 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-21 12:32:06,755 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-21 12:32:10,760 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-21 12:32:14,765 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-21 12:32:18,777 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-21 12:32:22,783 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-21 12:32:26,789 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-21 12:32:30,797 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-21 12:32:34,800 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-21 12:32:38,803 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-21 12:32:42,808 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-21 12:32:46,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:32:50,895 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-21 12:32:54,903 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-21 12:32:58,911 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-21 12:33:02,918 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-21 12:33:06,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:33:10,959 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-21 12:33:14,964 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-21 12:33:18,974 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-21 12:33:23,031 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-21 12:33:27,042 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-21 12:33:31,051 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-21 12:33:35,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 [] [2024-09-21 12:33:39,079 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-21 12:34:07,282 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-21 12:34:11,297 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-21 12:34:15,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 [] [2024-09-21 12:34:19,320 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-21 12:34:23,461 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-21 12:34:27,484 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-21 12:34:31,495 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-21 12:34:35,500 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-21 12:34:39,505 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-21 12:34:43,509 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-21 12:34:47,516 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-21 12:34:51,521 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-21 12:34:55,536 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-21 12:34:59,548 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-21 12:35:03,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 [] [2024-09-21 12:35:19,756 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-21 12:35:23,762 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-21 12:35:27,768 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 []