./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 12:31:26,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 12:31:26,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 12:31:26,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 12:31:26,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 12:31:26,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 12:31:26,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 12:31:26,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 12:31:26,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 12:31:26,257 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 12:31:26,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 12:31:26,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 12:31:26,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 12:31:26,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 12:31:26,260 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 12:31:26,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 12:31:26,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 12:31:26,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 12:31:26,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 12:31:26,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 12:31:26,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 12:31:26,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 12:31:26,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 12:31:26,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 12:31:26,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 12:31:26,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 12:31:26,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 12:31:26,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 12:31:26,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 12:31:26,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 12:31:26,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 12:31:26,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 12:31:26,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:31:26,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 12:31:26,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 12:31:26,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 12:31:26,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 12:31:26,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 12:31:26,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 12:31:26,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 12:31:26,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 12:31:26,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 12:31:26,271 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 12:31:26,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 12:31:26,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 12:31:26,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 12:31:26,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 12:31:26,544 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 12:31:26,545 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-21 12:31:27,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 12:31:28,132 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 12:31:28,133 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-21 12:31:28,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/dbcc5df09/d81f41e22e47487ab061009a1a5e9f39/FLAG68561b34c [2024-09-21 12:31:28,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/dbcc5df09/d81f41e22e47487ab061009a1a5e9f39 [2024-09-21 12:31:28,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 12:31:28,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 12:31:28,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 12:31:28,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 12:31:28,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 12:31:28,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74512717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28, skipping insertion in model container [2024-09-21 12:31:28,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 12:31:28,367 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-21 12:31:28,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:31:28,416 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 12:31:28,429 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-21 12:31:28,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 12:31:28,473 INFO L204 MainTranslator]: Completed translation [2024-09-21 12:31:28,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28 WrapperNode [2024-09-21 12:31:28,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 12:31:28,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 12:31:28,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 12:31:28,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 12:31:28,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,500 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 12:31:28,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 12:31:28,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 12:31:28,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 12:31:28,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 12:31:28,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,545 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 5, 3, 11, 11, 5]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1, 0, 0, 0]. The 9 writes are split as follows [0, 1, 1, 3, 3, 1]. [2024-09-21 12:31:28,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 12:31:28,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 12:31:28,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 12:31:28,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 12:31:28,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (1/1) ... [2024-09-21 12:31:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 12:31:28,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:31:28,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-21 12:31:28,620 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-21 12:31:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-21 12:31:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-21 12:31:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 12:31:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-21 12:31:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-21 12:31:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-21 12:31:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-21 12:31:28,672 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 12:31:28,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 12:31:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 12:31:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-21 12:31:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-21 12:31:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-21 12:31:28,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-21 12:31:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-21 12:31:28,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-21 12:31:28,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 12:31:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 12:31:28,676 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-21 12:31:28,676 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-21 12:31:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 12:31:28,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 12:31:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-21 12:31:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-21 12:31:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-21 12:31:28,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-21 12:31:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-21 12:31:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-21 12:31:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 12:31:28,678 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 12:31:28,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-21 12:31:28,792 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 12:31:28,793 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 12:31:29,026 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-21 12:31:29,027 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 12:31:29,049 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 12:31:29,053 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-21 12:31:29,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:29 BoogieIcfgContainer [2024-09-21 12:31:29,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 12:31:29,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 12:31:29,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 12:31:29,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 12:31:29,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 12:31:28" (1/3) ... [2024-09-21 12:31:29,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba797c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:29, skipping insertion in model container [2024-09-21 12:31:29,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 12:31:28" (2/3) ... [2024-09-21 12:31:29,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba797c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 12:31:29, skipping insertion in model container [2024-09-21 12:31:29,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 12:31:29" (3/3) ... [2024-09-21 12:31:29,063 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-21 12:31:29,081 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 12:31:29,081 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 12:31:29,141 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 12:31:29,148 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;@6745c4ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 12:31:29,148 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 12:31:29,153 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-21 12:31:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-21 12:31:29,160 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:31:29,161 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-21 12:31:29,161 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:31:29,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:31:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-21 12:31:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:31:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118373042] [2024-09-21 12:31:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:31:29,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:31:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:29,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:31:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:29,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:31:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:29,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-21 12:31:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:29,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-21 12:31:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:29,500 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-21 12:31:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:31:29,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118373042] [2024-09-21 12:31:29,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118373042] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:31:29,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:31:29,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 12:31:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672770052] [2024-09-21 12:31:29,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:31:29,512 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 12:31:29,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:31:29,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 12:31:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 12:31:29,539 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-21 12:31:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:31:29,752 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-21 12:31:29,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 12:31:29,755 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-21 12:31:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:31:29,763 INFO L225 Difference]: With dead ends: 102 [2024-09-21 12:31:29,763 INFO L226 Difference]: Without dead ends: 56 [2024-09-21 12:31:29,767 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-21 12:31:29,772 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.2s IncrementalHoareTripleChecker+Time [2024-09-21 12:31:29,773 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.2s Time] [2024-09-21 12:31:29,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-21 12:31:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-21 12:31:29,812 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-21 12:31:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-21 12:31:29,816 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-21 12:31:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:31:29,817 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-21 12:31:29,817 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-21 12:31:29,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:31:29,818 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-21 12:31:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-21 12:31:29,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:31:29,820 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-21 12:31:29,820 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 12:31:29,821 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:31:29,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:31:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-21 12:31:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:31:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928499240] [2024-09-21 12:31:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:31:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:31:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:31:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:31:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-21 12:31:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-21 12:31:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,306 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-21 12:31:30,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:31:30,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928499240] [2024-09-21 12:31:30,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928499240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:31:30,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 12:31:30,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 12:31:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924991872] [2024-09-21 12:31:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:31:30,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:31:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:31:30,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:31:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-21 12:31:30,311 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-21 12:31:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:31:30,533 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-21 12:31:30,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:31:30,533 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-21 12:31:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:31:30,534 INFO L225 Difference]: With dead ends: 81 [2024-09-21 12:31:30,534 INFO L226 Difference]: Without dead ends: 47 [2024-09-21 12:31:30,535 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-21 12:31:30,537 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-21 12:31:30,538 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-21 12:31:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-21 12:31:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-21 12:31:30,554 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-21 12:31:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-21 12:31:30,555 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-21 12:31:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:31:30,556 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-21 12:31:30,556 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-21 12:31:30,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:31:30,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-21 12:31:30,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-21 12:31:30,560 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:31:30,560 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-21 12:31:30,560 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 12:31:30,561 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:31:30,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:31:30,561 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-21 12:31:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:31:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408476010] [2024-09-21 12:31:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:31:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:31:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:31:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:30,899 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:31:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:31,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:31:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:31,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-21 12:31:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:31,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-21 12:31:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:31,181 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-21 12:31:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:31:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408476010] [2024-09-21 12:31:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408476010] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:31:31,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398571472] [2024-09-21 12:31:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:31:31,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:31:31,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:31:31,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:31:31,187 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-21 12:31:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:31:31,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-21 12:31:31,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:31:31,375 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-21 12:31:31,654 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-21 12:31:31,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:31:31,965 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-21 12:31:31,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398571472] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:31:31,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:31:31,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-09-21 12:31:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955697029] [2024-09-21 12:31:31,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:31:31,967 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-21 12:31:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:31:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-21 12:31:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-09-21 12:31:31,968 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-21 12:31:36,014 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-21 12:31:40,142 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-21 12:31:44,294 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-21 12:31:48,422 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-21 12:31:52,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-21 12:31:57,000 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-21 12:32:01,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 12:32:05,136 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-21 12:32:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:32:05,136 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-09-21 12:32:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-21 12:32:05,141 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-21 12:32:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:32:05,142 INFO L225 Difference]: With dead ends: 116 [2024-09-21 12:32:05,143 INFO L226 Difference]: Without dead ends: 80 [2024-09-21 12:32:05,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2024-09-21 12:32:05,148 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 35 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s 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.7s IncrementalHoareTripleChecker+Time [2024-09-21 12:32:05,148 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.7s Time] [2024-09-21 12:32:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-21 12:32:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-09-21 12:32:05,165 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-21 12:32:05,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-09-21 12:32:05,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2024-09-21 12:32:05,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:32:05,167 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-09-21 12:32:05,167 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-21 12:32:05,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-09-21 12:32:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-21 12:32:05,169 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:32:05,169 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-21 12:32:05,188 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-21 12:32:05,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:32:05,370 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:32:05,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash -908744810, now seen corresponding path program 1 times [2024-09-21 12:32:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:32:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119791351] [2024-09-21 12:32:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:32:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:05,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:32:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:05,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:32:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:05,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:06,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:06,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-21 12:32:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:06,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-21 12:32:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:06,223 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-21 12:32:06,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:32:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119791351] [2024-09-21 12:32:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119791351] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:32:06,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803814789] [2024-09-21 12:32:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:06,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:32:06,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:32:06,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:32:06,233 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-21 12:32:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:06,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-21 12:32:06,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:32:06,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-21 12:32:06,547 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-21 12:32:06,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 12:32:06,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803814789] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:32:06,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 12:32:06,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-09-21 12:32:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898594368] [2024-09-21 12:32:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:32:06,549 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-21 12:32:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:32:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-21 12:32:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2024-09-21 12:32:06,550 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-21 12:32:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:32:06,778 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-09-21 12:32:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-21 12:32:06,778 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-21 12:32:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:32:06,779 INFO L225 Difference]: With dead ends: 81 [2024-09-21 12:32:06,780 INFO L226 Difference]: Without dead ends: 79 [2024-09-21 12:32:06,780 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2024-09-21 12:32:06,781 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:32:06,781 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 12:32:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-21 12:32:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-21 12:32:06,795 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-21 12:32:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-09-21 12:32:06,796 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 41 [2024-09-21 12:32:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:32:06,797 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-09-21 12:32:06,797 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-21 12:32:06,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:06,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-09-21 12:32:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-21 12:32:06,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:32:06,799 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-21 12:32:06,812 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-21 12:32:07,000 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-21 12:32:07,000 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:32:07,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1404730042, now seen corresponding path program 1 times [2024-09-21 12:32:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:32:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091746172] [2024-09-21 12:32:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:32:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:32:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:32:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-21 12:32:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-21 12:32:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-21 12:32:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,818 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-21 12:32:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:32:07,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091746172] [2024-09-21 12:32:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091746172] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:32:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973973924] [2024-09-21 12:32:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:32:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:32:07,821 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-21 12:32:07,822 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-21 12:32:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:07,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-21 12:32:07,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:32:08,228 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-21 12:32:08,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 12:32:08,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973973924] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 12:32:08,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 12:32:08,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-09-21 12:32:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771774082] [2024-09-21 12:32:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 12:32:08,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 12:32:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:32:08,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 12:32:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-09-21 12:32:08,230 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-21 12:32:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:32:08,417 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-09-21 12:32:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 12:32:08,418 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-21 12:32:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:32:08,419 INFO L225 Difference]: With dead ends: 96 [2024-09-21 12:32:08,419 INFO L226 Difference]: Without dead ends: 73 [2024-09-21 12:32:08,420 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-09-21 12:32:08,422 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-21 12:32:08,423 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-21 12:32:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-21 12:32:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-09-21 12:32:08,441 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-21 12:32:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-09-21 12:32:08,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 47 [2024-09-21 12:32:08,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:32:08,443 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-09-21 12:32:08,443 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-21 12:32:08,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-09-21 12:32:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-21 12:32:08,446 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:32:08,446 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-21 12:32:08,464 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-21 12:32:08,647 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-21 12:32:08,647 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:32:08,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:32:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1142626696, now seen corresponding path program 1 times [2024-09-21 12:32:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:32:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432992999] [2024-09-21 12:32:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:32:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:32:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:32:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:32:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-21 12:32:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-21 12:32:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-21 12:32:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-21 12:32:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,436 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-21 12:32:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:32:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432992999] [2024-09-21 12:32:09,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432992999] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:32:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299847463] [2024-09-21 12:32:09,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:32:09,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:32:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:32:09,439 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-21 12:32:09,440 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-21 12:32:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:32:09,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-09-21 12:32:09,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:32:09,596 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-21 12:32:09,600 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-21 12:32:09,664 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 42 treesize of output 30 [2024-09-21 12:32:10,169 INFO L349 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2024-09-21 12:32:10,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 80 [2024-09-21 12:32:10,344 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-21 12:32:10,390 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-21 12:32:10,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:32:10,989 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-21 12:32:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299847463] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:32:10,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:32:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 33 [2024-09-21 12:32:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171855758] [2024-09-21 12:32:10,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:32:10,990 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-21 12:32:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:32:10,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-21 12:32:10,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2024-09-21 12:32:10,992 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-21 12:32:15,061 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-21 12:32:19,072 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-21 12:32:23,225 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-21 12:32:27,235 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-21 12:32:31,414 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-21 12:32:35,417 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-21 12:32:39,714 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-21 12:32:43,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 12:32:48,408 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-21 12:32:53,054 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-21 12:32:57,126 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-21 12:33:01,138 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-21 12:33:05,275 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-21 12:33:09,283 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-21 12:33:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:33:09,323 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2024-09-21 12:33:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-21 12:33:09,324 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) Word has length 57 [2024-09-21 12:33:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:33:09,325 INFO L225 Difference]: With dead ends: 150 [2024-09-21 12:33:09,325 INFO L226 Difference]: Without dead ends: 94 [2024-09-21 12:33:09,327 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=419, Invalid=3487, Unknown=0, NotChecked=0, Total=3906 [2024-09-21 12:33:09,328 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 71 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 53 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:33:09,328 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 234 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1249 Invalid, 14 Unknown, 0 Unchecked, 57.1s Time] [2024-09-21 12:33:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-21 12:33:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2024-09-21 12:33:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 16 states have call successors, (16), 14 states have call predecessors, (16), 13 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-21 12:33:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-09-21 12:33:09,349 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 57 [2024-09-21 12:33:09,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:33:09,349 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-09-21 12:33:09,350 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 29 states have internal predecessors, (61), 11 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2024-09-21 12:33:09,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:33:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-09-21 12:33:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-21 12:33:09,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:33:09,351 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-21 12:33:09,373 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-21 12:33:09,555 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-21 12:33:09,556 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:33:09,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:33:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2018904918, now seen corresponding path program 1 times [2024-09-21 12:33:09,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:33:09,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019550397] [2024-09-21 12:33:09,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:33:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:33:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:33:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:33:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:33:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:33:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:33:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-21 12:33:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-21 12:33:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-21 12:33:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-21 12:33:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:10,877 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-21 12:33:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:33:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019550397] [2024-09-21 12:33:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019550397] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:33:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615264556] [2024-09-21 12:33:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:33:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:33:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:33:10,880 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-21 12:33:10,881 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-21 12:33:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:33:11,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-09-21 12:33:11,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:33:11,130 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-21 12:33:11,133 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-21 12:33:11,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-21 12:33:11,647 INFO L349 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2024-09-21 12:33:11,647 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 45 treesize of output 52 [2024-09-21 12:33:11,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-09-21 12:33:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-09-21 12:33:11,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:33:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-21 12:33:12,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615264556] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:33:12,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:33:12,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 35 [2024-09-21 12:33:12,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143722882] [2024-09-21 12:33:12,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:33:12,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-21 12:33:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:33:12,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-21 12:33:12,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2024-09-21 12:33:12,424 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 35 states, 28 states have (on average 2.357142857142857) internal successors, (66), 30 states have internal predecessors, (66), 13 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-21 12:33:16,493 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-21 12:33:20,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 12:33:24,661 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-21 12:33:28,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 12:33:32,888 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-21 12:33:36,891 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-21 12:33:41,296 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-21 12:33:45,304 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-21 12:33:49,899 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-21 12:33:53,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 12:33:58,624 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-21 12:34:02,640 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-21 12:34:06,690 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-21 12:34:10,710 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-21 12:34:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 12:34:10,778 INFO L93 Difference]: Finished difference Result 154 states and 172 transitions. [2024-09-21 12:34:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-21 12:34:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 28 states have (on average 2.357142857142857) internal successors, (66), 30 states have internal predecessors, (66), 13 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) Word has length 62 [2024-09-21 12:34:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 12:34:10,781 INFO L225 Difference]: With dead ends: 154 [2024-09-21 12:34:10,781 INFO L226 Difference]: Without dead ends: 93 [2024-09-21 12:34:10,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=408, Invalid=3882, Unknown=0, NotChecked=0, Total=4290 [2024-09-21 12:34:10,783 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 62 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.1s IncrementalHoareTripleChecker+Time [2024-09-21 12:34:10,784 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 247 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1402 Invalid, 14 Unknown, 0 Unchecked, 57.1s Time] [2024-09-21 12:34:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-21 12:34:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2024-09-21 12:34:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 46 states have internal predecessors, (48), 14 states have call successors, (14), 12 states have call predecessors, (14), 13 states have return successors, (15), 13 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-21 12:34:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-09-21 12:34:10,806 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 62 [2024-09-21 12:34:10,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 12:34:10,806 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-09-21 12:34:10,807 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 28 states have (on average 2.357142857142857) internal successors, (66), 30 states have internal predecessors, (66), 13 states have call successors, (25), 8 states have call predecessors, (25), 8 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-21 12:34:10,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:34:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-09-21 12:34:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-09-21 12:34:10,808 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 12:34:10,808 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 12:34:10,829 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-21 12:34:11,009 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-21 12:34:11,010 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 12:34:11,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 12:34:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash -71159451, now seen corresponding path program 1 times [2024-09-21 12:34:11,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 12:34:11,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171731413] [2024-09-21 12:34:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:34:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 12:34:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:11,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 12:34:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:11,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 12:34:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:34:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:34:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:34:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-21 12:34:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-21 12:34:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-21 12:34:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:12,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-21 12:34:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:13,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-21 12:34:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:13,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-21 12:34:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:13,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-21 12:34:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-21 12:34:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 12:34:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171731413] [2024-09-21 12:34:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171731413] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 12:34:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859342935] [2024-09-21 12:34:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 12:34:13,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 12:34:13,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 12:34:13,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 12:34:13,018 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-21 12:34:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 12:34:13,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-21 12:34:13,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 12:34:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-21 12:34:13,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 12:34:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-21 12:34:39,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859342935] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 12:34:39,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 12:34:39,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 22] total 48 [2024-09-21 12:34:39,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677309417] [2024-09-21 12:34:39,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 12:34:39,710 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-21 12:34:39,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 12:34:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-21 12:34:39,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2010, Unknown=6, NotChecked=0, Total=2256 [2024-09-21 12:34:39,712 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 48 states, 37 states have (on average 2.108108108108108) internal successors, (78), 40 states have internal predecessors, (78), 13 states have call successors, (30), 10 states have call predecessors, (30), 17 states have return successors, (28), 14 states have call predecessors, (28), 13 states have call successors, (28) [2024-09-21 12:34:44,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:34:48,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:34:52,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:34:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:00,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:04,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:32,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:36,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:40,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:44,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:48,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:52,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-21 12:35:56,936 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 []