./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:29:19,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:29:19,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:29:19,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:29:19,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:29:19,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:29:19,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:29:19,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:29:19,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:29:19,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:29:19,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:29:19,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:29:19,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:29:19,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:29:19,369 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:29:19,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:29:19,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:29:19,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:29:19,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:29:19,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:29:19,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:29:19,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:29:19,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:29:19,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:29:19,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:29:19,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:29:19,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:29:19,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:29:19,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:29:19,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:29:19,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:29:19,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:29:19,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:19,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:29:19,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:29:19,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:29:19,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:29:19,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:29:19,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:29:19,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:29:19,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:29:19,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:29:19,376 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 11:29:19,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:29:19,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:29:19,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:29:19,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:29:19,645 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:29:19,646 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 11:29:20,903 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:29:21,060 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:29:21,060 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 11:29:21,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/54125a9f4/036c8fa434da40cd9bfcda6890ccebdb/FLAG8f7f91aa1 [2024-09-25 11:29:21,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/54125a9f4/036c8fa434da40cd9bfcda6890ccebdb [2024-09-25 11:29:21,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:29:21,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:29:21,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:21,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:29:21,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:29:21,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba34776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21, skipping insertion in model container [2024-09-25 11:29:21,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:29:21,242 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 11:29:21,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:21,268 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:29:21,278 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 11:29:21,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:21,297 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:29:21,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21 WrapperNode [2024-09-25 11:29:21,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:21,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:21,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:29:21,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:29:21,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,320 INFO L138 Inliner]: procedures = 19, calls = 30, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:29:21,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:21,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:29:21,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:29:21,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:29:21,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,350 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 11:29:21,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:29:21,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:29:21,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:29:21,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:29:21,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (1/1) ... [2024-09-25 11:29:21,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:21,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:21,395 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 11:29:21,397 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 11:29:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:29:21,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:29:21,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:29:21,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:29:21,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:29:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:29:21,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:29:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_41_0 [2024-09-25 11:29:21,428 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_41_0 [2024-09-25 11:29:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_44_to_45_0 [2024-09-25 11:29:21,428 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_44_to_45_0 [2024-09-25 11:29:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:29:21,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:29:21,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:29:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:29:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:29:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:29:21,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:29:21,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:29:21,500 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:29:21,501 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:29:21,669 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:29:21,670 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:29:21,689 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:29:21,689 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:29:21,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:21 BoogieIcfgContainer [2024-09-25 11:29:21,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:29:21,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:29:21,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:29:21,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:29:21,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:29:21" (1/3) ... [2024-09-25 11:29:21,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:21, skipping insertion in model container [2024-09-25 11:29:21,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:21" (2/3) ... [2024-09-25 11:29:21,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f21ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:21, skipping insertion in model container [2024-09-25 11:29:21,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:21" (3/3) ... [2024-09-25 11:29:21,698 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_2.i [2024-09-25 11:29:21,712 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:29:21,712 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:29:21,758 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:29:21,764 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;@332d7485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:29:21,765 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:29:21,768 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 11:29:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 11:29:21,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:21,773 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 11:29:21,774 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:21,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:21,779 INFO L85 PathProgramCache]: Analyzing trace with hash -76584524, now seen corresponding path program 1 times [2024-09-25 11:29:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:21,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785015458] [2024-09-25 11:29:21,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,310 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 11:29:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:22,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785015458] [2024-09-25 11:29:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785015458] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:22,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:22,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:29:22,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73386777] [2024-09-25 11:29:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:22,317 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:29:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:29:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:29:22,335 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 11:29:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:22,503 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-09-25 11:29:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:29:22,506 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 11:29:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:22,511 INFO L225 Difference]: With dead ends: 71 [2024-09-25 11:29:22,511 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:29:22,515 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 11:29:22,518 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:22,523 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.1s Time] [2024-09-25 11:29:22,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:29:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 11:29:22,552 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 11:29:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-25 11:29:22,554 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2024-09-25 11:29:22,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:22,555 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-25 11:29:22,556 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 11:29:22,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-25 11:29:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 11:29:22,559 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:22,559 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 11:29:22,559 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:29:22,559 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:22,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1452196032, now seen corresponding path program 1 times [2024-09-25 11:29:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128415376] [2024-09-25 11:29:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:22,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:29:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:22,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:29:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:23,032 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 11:29:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128415376] [2024-09-25 11:29:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128415376] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749534997] [2024-09-25 11:29:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:23,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:23,036 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 11:29:23,039 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 11:29:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:23,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-25 11:29:23,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:23,136 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 11:29:23,299 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 11:29:23,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:23,689 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 11:29:23,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749534997] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:29:23,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:29:23,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-09-25 11:29:23,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892636068] [2024-09-25 11:29:23,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:23,691 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 11:29:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:23,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 11:29:23,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2024-09-25 11:29:23,692 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 11:29:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:24,166 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-09-25 11:29:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:29:24,167 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 11:29:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:24,168 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:29:24,168 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 11:29:24,169 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 11:29:24,170 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:24,170 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.2s Time] [2024-09-25 11:29:24,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 11:29:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-25 11:29:24,183 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 11:29:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-25 11:29:24,185 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 29 [2024-09-25 11:29:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:24,185 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-25 11:29:24,186 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 11:29:24,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-25 11:29:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-25 11:29:24,188 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:24,189 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 11:29:24,201 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:29:24,389 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 11:29:24,390 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:24,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1166567816, now seen corresponding path program 2 times [2024-09-25 11:29:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983542064] [2024-09-25 11:29:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:25,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:25,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:25,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:29:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:25,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:29:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:29:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:29:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:29:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:29:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:29:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-25 11:29:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:26,495 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 11:29:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983542064] [2024-09-25 11:29:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983542064] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807872645] [2024-09-25 11:29:26,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:29:26,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:26,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:26,499 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 11:29:26,500 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 11:29:26,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:29:26,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:29:26,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-09-25 11:29:26,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:26,611 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 11:29:27,028 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 11:29:27,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:52,846 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 11:29:52,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807872645] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:29:52,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:29:52,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 12, 22] total 51 [2024-09-25 11:29:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961263268] [2024-09-25 11:29:52,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:52,847 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-25 11:29:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-25 11:29:52,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2274, Unknown=6, NotChecked=0, Total=2550 [2024-09-25 11:29:52,849 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 11:30:17,078 WARN L293 SmtUtils]: Spent 20.06s 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 11:30:41,444 WARN L293 SmtUtils]: Spent 24.19s 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 11:31:01,900 WARN L293 SmtUtils]: Spent 20.11s 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 11:31:18,189 WARN L293 SmtUtils]: Spent 16.13s 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 11:31:22,205 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 11:31:26,214 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 11:31:30,226 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 11:31:34,231 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 11:31:38,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:31:42,263 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 11:32:10,328 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 11:32:14,333 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 11:32:18,340 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 11:32:22,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 11:32:26,349 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 11:32:30,356 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 11:32:50,570 WARN L293 SmtUtils]: Spent 20.07s 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 11:32:54,582 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 11:32:58,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:02,600 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 11:33:06,606 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 11:33:10,612 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 11:33:14,617 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 11:33:18,627 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 11:33:22,730 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 11:33:26,742 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 11:33:30,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:33:34,760 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 11:33:38,770 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 11:34:06,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 []