./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.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 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_2.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 a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 --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-6908dde-m [2024-09-25 00:10:37,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:10:37,480 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:10:37,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:10:37,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:10:37,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:10:37,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:10:37,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:10:37,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:10:37,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:10:37,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:10:37,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:10:37,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:10:37,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:10:37,513 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:10:37,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:10:37,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:10:37,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:10:37,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:10:37,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:10:37,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:10:37,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:10:37,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:10:37,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:10:37,520 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:10:37,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:10:37,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:10:37,521 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:10:37,521 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:10:37,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:10:37,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:10:37,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:10:37,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:37,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:10:37,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:10:37,523 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:10:37,523 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:10:37,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:10:37,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:10:37,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:10:37,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:10:37,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:10:37,527 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 -> a00615dde165ef79502be50d436d5b7101f564051a4b91f339855b18841d9599 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-25 00:10:37,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:10:37,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:10:37,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:10:37,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:10:37,819 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:10:37,820 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_2.i [2024-09-25 00:10:39,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:10:39,440 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:10:39,441 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_2.i [2024-09-25 00:10:39,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/33a3ed1e6/55fb884b421b4e5f91a0ec6d8ece783b/FLAG43eeecedc [2024-09-25 00:10:39,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/33a3ed1e6/55fb884b421b4e5f91a0ec6d8ece783b [2024-09-25 00:10:39,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:10:39,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:10:39,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:39,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:10:39,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:10:39,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:39" (1/1) ... [2024-09-25 00:10:39,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b04e712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:39, skipping insertion in model container [2024-09-25 00:10:39,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:39" (1/1) ... [2024-09-25 00:10:39,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:10:40,011 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_2.i[1800,1813] [2024-09-25 00:10:40,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:40,035 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:10:40,046 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_2.i[1800,1813] [2024-09-25 00:10:40,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:40,071 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:10:40,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40 WrapperNode [2024-09-25 00:10:40,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:40,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:40,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:10:40,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:10:40,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,095 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:10:40,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:40,096 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:10:40,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:10:40,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:10:40,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,145 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 12, 2]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 5 writes are split as follows [0, 4, 1]. [2024-09-25 00:10:40,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:10:40,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:10:40,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:10:40,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:10:40,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (1/1) ... [2024-09-25 00:10:40,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:40,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:40,221 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-25 00:10:40,229 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-25 00:10:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:10:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:10:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:10:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:10:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:10:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:10:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:10:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 00:10:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 00:10:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:10:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:10:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 00:10:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:10:40,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:10:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2024-09-25 00:10:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2024-09-25 00:10:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2024-09-25 00:10:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2024-09-25 00:10:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:10:40,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:10:40,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:10:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:10:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 00:10:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:10:40,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:10:40,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:10:40,352 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:10:40,354 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:10:40,512 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 00:10:40,512 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:10:40,534 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:10:40,534 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:10:40,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:40 BoogieIcfgContainer [2024-09-25 00:10:40,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:10:40,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:10:40,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:10:40,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:10:40,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:10:39" (1/3) ... [2024-09-25 00:10:40,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fe2b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:40, skipping insertion in model container [2024-09-25 00:10:40,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:40" (2/3) ... [2024-09-25 00:10:40,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fe2b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:40, skipping insertion in model container [2024-09-25 00:10:40,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:40" (3/3) ... [2024-09-25 00:10:40,546 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_2.i [2024-09-25 00:10:40,564 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:10:40,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:10:40,637 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:10:40,643 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;@3572e3a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:10:40,643 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:10:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 00:10:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 00:10:40,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:40,659 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:40,660 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:40,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -76584524, now seen corresponding path program 1 times [2024-09-25 00:10:40,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:40,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917814202] [2024-09-25 00:10:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:40,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:41,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:41,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:41,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917814202] [2024-09-25 00:10:41,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917814202] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:41,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:41,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:10:41,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421345570] [2024-09-25 00:10:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:41,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:10:41,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:10:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:10:41,474 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 23 states have internal predecessors, (25), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:10:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:41,708 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-09-25 00:10:41,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:10:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-25 00:10:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:41,720 INFO L225 Difference]: With dead ends: 71 [2024-09-25 00:10:41,720 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 00:10:41,723 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:10:41,726 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:41,727 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 35 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:10:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 00:10:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 00:10:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 00:10:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-25 00:10:41,760 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2024-09-25 00:10:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:41,760 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-25 00:10:41,761 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:10:41,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-25 00:10:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 00:10:41,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:41,764 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:41,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:10:41,765 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:41,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1452196032, now seen corresponding path program 1 times [2024-09-25 00:10:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:41,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918597206] [2024-09-25 00:10:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:10:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:10:42,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918597206] [2024-09-25 00:10:42,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918597206] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:42,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710584674] [2024-09-25 00:10:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:42,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:42,547 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-25 00:10:42,549 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-25 00:10:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:42,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-25 00:10:42,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:42,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-25 00:10:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:10:42,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:43,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:43,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710584674] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:10:43,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:10:43,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-09-25 00:10:43,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629051158] [2024-09-25 00:10:43,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:43,506 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:10:43,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:10:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:10:43,508 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-25 00:10:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:44,171 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-09-25 00:10:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 00:10:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 29 [2024-09-25 00:10:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:44,173 INFO L225 Difference]: With dead ends: 58 [2024-09-25 00:10:44,173 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 00:10:44,174 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 00:10:44,177 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:44,179 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 41 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:10:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 00:10:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-25 00:10:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 00:10:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-25 00:10:44,201 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2024-09-25 00:10:44,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:44,202 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-25 00:10:44,202 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 10 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-25 00:10:44,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-25 00:10:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-25 00:10:44,204 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:44,204 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:44,224 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-25 00:10:44,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:44,411 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:44,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:44,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1166567816, now seen corresponding path program 2 times [2024-09-25 00:10:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:44,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558092259] [2024-09-25 00:10:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:45,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:45,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:46,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:46,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:46,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:10:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:46,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:46,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:10:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:47,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:47,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:10:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:47,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:10:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:47,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 00:10:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 00:10:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558092259] [2024-09-25 00:10:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558092259] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704549015] [2024-09-25 00:10:47,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:10:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:47,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:47,521 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-25 00:10:47,523 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-25 00:10:47,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:10:47,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:10:47,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-09-25 00:10:47,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:47,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-25 00:10:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-09-25 00:10:48,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:11:14,710 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 00:11:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704549015] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:11:14,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:11:14,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 22] total 51 [2024-09-25 00:11:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105080576] [2024-09-25 00:11:14,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:11:14,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-25 00:11:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:11:14,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-25 00:11:14,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2274, Unknown=6, NotChecked=0, Total=2550 [2024-09-25 00:11:14,716 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 51 states, 40 states have (on average 1.5) internal successors, (60), 44 states have internal predecessors, (60), 22 states have call successors, (25), 9 states have call predecessors, (25), 16 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-09-25 00:11:50,971 WARN L293 SmtUtils]: Spent 28.09s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 00:12:03,321 WARN L293 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 76 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 00:12:19,852 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 69 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 00:12:48,133 WARN L293 SmtUtils]: Spent 28.10s on a formula simplification. DAG size of input: 62 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 00:12:52,150 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-25 00:12:56,161 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-25 00:13:00,180 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-25 00:13:04,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:13:08,259 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-25 00:13:12,268 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-25 00:13:40,345 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-25 00:13:44,351 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-25 00:13:48,359 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-25 00:13:52,364 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-25 00:13:56,370 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-25 00:14:00,375 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-25 00:14:24,659 WARN L293 SmtUtils]: Spent 24.09s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 00:14:28,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:32,685 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-25 00:14:36,733 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-25 00:14:40,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:44,833 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-25 00:14:48,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 00:14:52,880 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-25 00:14:56,892 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-25 00:15:00,968 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-25 00:15:04,981 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-25 00:15:08,988 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-25 00:15:13,003 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 []