./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:49:28,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:49:28,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:49:28,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:49:28,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:49:28,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:49:28,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:49:28,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:49:28,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:49:28,967 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:49:28,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:49:28,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:49:28,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:49:28,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:49:28,969 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:49:28,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:49:28,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:49:28,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:49:28,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:49:28,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:49:28,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:49:28,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:49:28,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:49:28,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:49:28,976 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:49:28,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:49:28,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:49:28,977 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:49:28,977 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:49:28,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:49:28,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:49:28,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:49:28,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:49:28,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:49:28,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:49:28,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:49:28,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:49:28,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:49:28,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:49:28,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:49:28,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:49:28,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:49:28,984 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 [2024-09-15 19:49:29,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:49:29,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:49:29,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:49:29,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:49:29,297 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:49:29,298 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-15 19:49:30,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:49:31,127 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:49:31,128 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-15 19:49:31,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/183a4b6f1/7228b7c3951044bc9aaf95fe087ab93e/FLAGe7f49736e [2024-09-15 19:49:31,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/183a4b6f1/7228b7c3951044bc9aaf95fe087ab93e [2024-09-15 19:49:31,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:49:31,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:49:31,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:49:31,164 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:49:31,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:49:31,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5739fba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31, skipping insertion in model container [2024-09-15 19:49:31,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:49:31,371 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-15 19:49:31,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:49:31,413 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:49:31,425 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-15 19:49:31,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:49:31,462 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:49:31,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31 WrapperNode [2024-09-15 19:49:31,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:49:31,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:49:31,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:49:31,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:49:31,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,480 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,488 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:49:31,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:49:31,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:49:31,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:49:31,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:49:31,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,529 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 5, 5, 11, 11, 3]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 0, 0, 0, 1]. The 9 writes are split as follows [0, 1, 1, 3, 3, 1]. [2024-09-15 19:49:31,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,543 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,558 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:49:31,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:49:31,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:49:31,559 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:49:31,560 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (1/1) ... [2024-09-15 19:49:31,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:49:31,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:49:31,588 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-15 19:49:31,591 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-15 19:49:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-15 19:49:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-15 19:49:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:49:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-15 19:49:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-15 19:49:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 19:49:31,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 19:49:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:49:31,626 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:49:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:49:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-15 19:49:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-15 19:49:31,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-15 19:49:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:49:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-15 19:49:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-15 19:49:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:49:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-15 19:49:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:49:31,630 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:49:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-15 19:49:31,733 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:49:31,735 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:49:31,980 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-15 19:49:31,980 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:49:32,002 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:49:32,003 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-15 19:49:32,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:49:32 BoogieIcfgContainer [2024-09-15 19:49:32,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:49:32,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:49:32,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:49:32,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:49:32,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:49:31" (1/3) ... [2024-09-15 19:49:32,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784ed91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:49:32, skipping insertion in model container [2024-09-15 19:49:32,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:49:31" (2/3) ... [2024-09-15 19:49:32,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2784ed91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:49:32, skipping insertion in model container [2024-09-15 19:49:32,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:49:32" (3/3) ... [2024-09-15 19:49:32,013 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-15 19:49:32,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:49:32,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:49:32,078 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:49:32,084 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;@55022ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:49:32,084 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:49:32,088 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-15 19:49:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-15 19:49:32,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:49:32,098 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-15 19:49:32,098 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:49:32,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:49:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-15 19:49:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:49:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485587164] [2024-09-15 19:49:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:49:32,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:49:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:32,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:49:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:32,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:49:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:32,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-15 19:49:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:32,429 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:49:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:32,442 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-15 19:49:32,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:49:32,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485587164] [2024-09-15 19:49:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485587164] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:49:32,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:49:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 19:49:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963608968] [2024-09-15 19:49:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:49:32,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 19:49:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:49:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 19:49:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 19:49:32,472 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-15 19:49:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:49:32,659 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-15 19:49:32,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 19:49:32,661 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-15 19:49:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:49:32,669 INFO L225 Difference]: With dead ends: 102 [2024-09-15 19:49:32,669 INFO L226 Difference]: Without dead ends: 56 [2024-09-15 19:49:32,673 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-15 19:49:32,676 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-15 19:49:32,677 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-15 19:49:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-15 19:49:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-15 19:49:32,719 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-15 19:49:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-15 19:49:32,722 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-15 19:49:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:49:32,723 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-15 19:49:32,723 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-15 19:49:32,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:49:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-15 19:49:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-15 19:49:32,730 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:49:32,730 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-15 19:49:32,731 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:49:32,731 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:49:32,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:49:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-15 19:49:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:49:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695132097] [2024-09-15 19:49:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:49:32,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:49:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:49:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:49:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-15 19:49:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:49:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,212 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-15 19:49:33,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:49:33,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695132097] [2024-09-15 19:49:33,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695132097] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:49:33,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:49:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 19:49:33,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758220446] [2024-09-15 19:49:33,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:49:33,215 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 19:49:33,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:49:33,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 19:49:33,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:49:33,216 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-15 19:49:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:49:33,447 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-15 19:49:33,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 19:49:33,448 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-15 19:49:33,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:49:33,449 INFO L225 Difference]: With dead ends: 81 [2024-09-15 19:49:33,451 INFO L226 Difference]: Without dead ends: 47 [2024-09-15 19:49:33,451 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-15 19:49:33,453 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-15 19:49:33,453 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-15 19:49:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-15 19:49:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-15 19:49:33,468 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-15 19:49:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-15 19:49:33,472 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-15 19:49:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:49:33,472 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-15 19:49:33,472 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-15 19:49:33,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:49:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-15 19:49:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-15 19:49:33,473 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:49:33,474 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-15 19:49:33,474 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 19:49:33,474 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:49:33,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:49:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-15 19:49:33,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:49:33,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596873894] [2024-09-15 19:49:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:49:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:49:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:49:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:49:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:33,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:49:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:34,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-15 19:49:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:34,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:49:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:34,058 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-15 19:49:34,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:49:34,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596873894] [2024-09-15 19:49:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596873894] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:49:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506997358] [2024-09-15 19:49:34,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:49:34,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:49:34,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:49:34,063 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-15 19:49:34,065 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-15 19:49:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:49:34,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-15 19:49:34,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:49:34,349 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-15 19:49:34,629 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-15 19:49:34,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:49:34,903 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-15 19:49:34,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506997358] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:49:34,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:49:34,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-09-15 19:49:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481274021] [2024-09-15 19:49:34,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:49:34,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-15 19:49:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:49:34,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-15 19:49:34,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-09-15 19:49:34,906 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-15 19:49:38,959 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-15 19:49:43,101 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-15 19:49:47,254 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-15 19:49:51,363 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-15 19:49:55,909 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-15 19:49:59,949 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-15 19:50:03,988 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-15 19:50:08,068 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-15 19:50:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:50:08,069 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-09-15 19:50:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-15 19:50:08,075 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-15 19:50:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:50:08,076 INFO L225 Difference]: With dead ends: 116 [2024-09-15 19:50:08,076 INFO L226 Difference]: Without dead ends: 80 [2024-09-15 19:50:08,077 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2024-09-15 19:50:08,079 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.6s IncrementalHoareTripleChecker+Time [2024-09-15 19:50:08,079 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.6s Time] [2024-09-15 19:50:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-15 19:50:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-09-15 19:50:08,098 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-15 19:50:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-09-15 19:50:08,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2024-09-15 19:50:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:50:08,101 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-09-15 19:50:08,101 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-15 19:50:08,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-09-15 19:50:08,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-15 19:50:08,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:50:08,103 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-15 19:50:08,122 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 19:50:08,307 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-15 19:50:08,308 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:50:08,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -908744810, now seen corresponding path program 1 times [2024-09-15 19:50:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:50:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859197510] [2024-09-15 19:50:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:50:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:08,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:50:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:08,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:50:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:08,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:09,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:09,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 19:50:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:09,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 19:50:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:09,203 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-15 19:50:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:50:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859197510] [2024-09-15 19:50:09,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859197510] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:50:09,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933708192] [2024-09-15 19:50:09,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:09,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:50:09,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:50:09,209 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-15 19:50:09,211 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-15 19:50:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:09,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-15 19:50:09,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:50:09,559 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-15 19:50:09,784 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-15 19:50:09,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:50:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933708192] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:50:09,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:50:09,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-09-15 19:50:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352137801] [2024-09-15 19:50:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:50:09,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-15 19:50:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:50:09,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-15 19:50:09,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2024-09-15 19:50:09,787 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-15 19:50:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:50:10,047 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-09-15 19:50:10,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-15 19:50:10,047 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-15 19:50:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:50:10,049 INFO L225 Difference]: With dead ends: 81 [2024-09-15 19:50:10,050 INFO L226 Difference]: Without dead ends: 79 [2024-09-15 19:50:10,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2024-09-15 19:50:10,051 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.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:50:10,054 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.2s Time] [2024-09-15 19:50:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-15 19:50:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-15 19:50:10,073 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-15 19:50:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-09-15 19:50:10,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 41 [2024-09-15 19:50:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:50:10,075 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-09-15 19:50:10,075 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-15 19:50:10,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-09-15 19:50:10,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-15 19:50:10,076 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:50:10,079 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-15 19:50:10,098 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 19:50:10,280 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-15 19:50:10,280 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:50:10,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1404730042, now seen corresponding path program 1 times [2024-09-15 19:50:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:50:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455801751] [2024-09-15 19:50:10,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:50:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:10,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:50:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:10,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:50:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:10,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 19:50:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 19:50:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-15 19:50:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,121 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-15 19:50:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:50:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455801751] [2024-09-15 19:50:11,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455801751] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:50:11,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261584266] [2024-09-15 19:50:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:11,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:50:11,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:50:11,125 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-15 19:50:11,127 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-15 19:50:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:11,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:50:11,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:50:11,533 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-15 19:50:11,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:50:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261584266] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:50:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:50:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-09-15 19:50:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539477509] [2024-09-15 19:50:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:50:11,534 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 19:50:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:50:11,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 19:50:11,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-09-15 19:50:11,536 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-15 19:50:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:50:11,724 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-09-15 19:50:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 19:50:11,725 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-15 19:50:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:50:11,726 INFO L225 Difference]: With dead ends: 96 [2024-09-15 19:50:11,726 INFO L226 Difference]: Without dead ends: 73 [2024-09-15 19:50:11,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-09-15 19:50:11,727 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-15 19:50:11,728 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-15 19:50:11,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-15 19:50:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-09-15 19:50:11,741 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-15 19:50:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-09-15 19:50:11,742 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 47 [2024-09-15 19:50:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:50:11,742 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-09-15 19:50:11,742 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-15 19:50:11,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-09-15 19:50:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-15 19:50:11,745 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:50:11,745 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-15 19:50:11,763 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 19:50:11,945 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-15 19:50:11,946 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:50:11,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:50:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1142626696, now seen corresponding path program 1 times [2024-09-15 19:50:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:50:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821028603] [2024-09-15 19:50:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:50:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:50:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:50:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:50:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,698 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 19:50:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-15 19:50:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-15 19:50:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,705 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-15 19:50:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,707 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-15 19:50:12,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:50:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821028603] [2024-09-15 19:50:12,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821028603] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:50:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625031438] [2024-09-15 19:50:12,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:50:12,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:50:12,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:50:12,713 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-15 19:50:12,715 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-15 19:50:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:50:12,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-15 19:50:12,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:50:17,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-15 19:50:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2024-09-15 19:50:17,499 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-15 19:50:17,500 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 36 treesize of output 47 [2024-09-15 19:50:17,697 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 45 treesize of output 29 [2024-09-15 19:50:17,734 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-15 19:50:17,735 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:50:18,410 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-15 19:50:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625031438] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:50:18,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:50:18,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 34 [2024-09-15 19:50:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621204415] [2024-09-15 19:50:18,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:50:18,412 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-15 19:50:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:50:18,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-15 19:50:18,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1014, Unknown=1, NotChecked=0, Total=1122 [2024-09-15 19:50:18,415 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 34 states, 27 states have (on average 2.259259259259259) 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), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-15 19:50:22,435 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-15 19:50:26,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-15 19:50:30,601 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-15 19:50:34,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 [0] [2024-09-15 19:50:38,816 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 [0] [2024-09-15 19:50:43,040 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-15 19:50:47,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-15 19:50:52,497 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-15 19:50:56,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-15 19:51:00,609 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-15 19:51:05,332 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-15 19:51:09,357 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-15 19:51:19,368 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-15 19:51:23,404 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-15 19:51:27,584 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-15 19:51:31,631 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-15 19:51:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:51:31,698 INFO L93 Difference]: Finished difference Result 146 states and 166 transitions. [2024-09-15 19:51:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-15 19:51:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 27 states have (on average 2.259259259259259) 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), 7 states have call predecessors, (16), 9 states have call successors, (16) Word has length 57 [2024-09-15 19:51:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:51:31,699 INFO L225 Difference]: With dead ends: 146 [2024-09-15 19:51:31,700 INFO L226 Difference]: Without dead ends: 90 [2024-09-15 19:51:31,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=419, Invalid=3611, Unknown=2, NotChecked=0, Total=4032 [2024-09-15 19:51:31,702 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 71 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 51 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.6s IncrementalHoareTripleChecker+Time [2024-09-15 19:51:31,703 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 247 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1250 Invalid, 16 Unknown, 0 Unchecked, 65.6s Time] [2024-09-15 19:51:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-15 19:51:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2024-09-15 19:51:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 50 states have internal predecessors, (52), 15 states have call successors, (15), 13 states have call predecessors, (15), 13 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-15 19:51:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-09-15 19:51:31,722 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 57 [2024-09-15 19:51:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:51:31,722 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-09-15 19:51:31,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 27 states have (on average 2.259259259259259) 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), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-15 19:51:31,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:51:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-09-15 19:51:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-15 19:51:31,724 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:51:31,724 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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-15 19:51:31,742 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-15 19:51:31,928 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-15 19:51:31,929 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:51:31,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:51:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2018904918, now seen corresponding path program 1 times [2024-09-15 19:51:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:51:31,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505600316] [2024-09-15 19:51:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:51:31,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:51:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:32,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:51:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:32,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:51:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:32,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:51:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:32,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:51:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-15 19:51:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 19:51:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,224 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-15 19:51:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 19:51:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-15 19:51:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,229 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-15 19:51:33,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:51:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505600316] [2024-09-15 19:51:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505600316] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:51:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433618473] [2024-09-15 19:51:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:51:33,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:51:33,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:51:33,231 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-15 19:51:33,232 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-15 19:51:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:51:33,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-15 19:51:33,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:51:33,932 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-15 19:51:33,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:51:47,473 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-15 19:51:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433618473] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:51:47,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:51:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 40 [2024-09-15 19:51:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601171264] [2024-09-15 19:51:47,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:51:47,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-15 19:51:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:51:47,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-15 19:51:47,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1372, Unknown=3, NotChecked=0, Total=1560 [2024-09-15 19:51:47,476 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 40 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 34 states have internal predecessors, (58), 12 states have call successors, (22), 8 states have call predecessors, (22), 14 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2024-09-15 19:51:51,991 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-15 19:51:56,002 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-15 19:52:00,011 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-15 19:52:04,022 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-15 19:52:24,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 [] [2024-09-15 19:52:28,090 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-15 19:52:32,099 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-15 19:52:36,109 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-15 19:52:40,120 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-15 19:52:44,125 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-15 19:52:48,130 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-15 19:52:52,136 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-15 19:52:56,177 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-15 19:53:00,201 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-15 19:53:04,213 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-15 19:53:20,389 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-15 19:53:24,396 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-15 19:53:28,406 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-15 19:53:32,502 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-15 19:53:36,512 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-15 19:53:40,519 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-15 19:53:44,526 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-15 19:53:48,579 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-15 19:53:52,589 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-15 19:53:56,605 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-15 19:54:00,674 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-15 19:54:04,682 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 []