./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.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 de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.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 affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 --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-de32597-m [2024-09-17 19:22:16,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:22:16,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 19:22:16,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:22:16,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:22:16,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:22:16,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:22:16,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:22:16,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:22:16,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:22:16,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:22:16,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:22:16,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:22:16,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:22:16,844 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:22:16,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:22:16,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:22:16,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:22:16,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 19:22:16,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:22:16,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:22:16,846 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:22:16,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:22:16,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:22:16,847 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:22:16,848 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:22:16,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:22:16,848 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:22:16,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:22:16,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:16,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:22:16,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 19:22:16,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 19:22:16,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:22:16,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:22:16,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:22:16,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:22:16,851 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 -> affe6b2992f7714f4bd95d6011e70945dc7608cfcd3847461bdcd80eeea00f05 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-17 19:22:17,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:22:17,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:22:17,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:22:17,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:22:17,070 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:22:17,071 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_1-1.i [2024-09-17 19:22:18,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:22:18,331 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:22:18,332 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_1-1.i [2024-09-17 19:22:18,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5c468d70c/58314f5f0d08453b8ebcf1517c63533e/FLAGfc5e60028 [2024-09-17 19:22:18,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5c468d70c/58314f5f0d08453b8ebcf1517c63533e [2024-09-17 19:22:18,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:22:18,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 19:22:18,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:18,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:22:18,772 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:22:18,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66acfeb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18, skipping insertion in model container [2024-09-17 19:22:18,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:22:18,891 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_1-1.i[1692,1705] [2024-09-17 19:22:18,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:18,917 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:22:18,925 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_1-1.i[1692,1705] [2024-09-17 19:22:18,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:22:18,948 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:22:18,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18 WrapperNode [2024-09-17 19:22:18,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:22:18,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:18,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:22:18,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:22:18,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,967 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 19:22:18,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:22:18,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:22:18,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:22:18,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:22:18,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,993 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [13, 2, 3]. 72 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 5 writes are split as follows [4, 0, 1]. [2024-09-17 19:22:18,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:18,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:22:19,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:22:19,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:22:19,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:22:19,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (1/1) ... [2024-09-17 19:22:19,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:22:19,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:19,037 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-17 19:22:19,039 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-17 19:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_32_to_33_0 [2024-09-17 19:22:19,069 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_32_to_33_0 [2024-09-17 19:22:19,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 19:22:19,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-17 19:22:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-17 19:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 19:22:19,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 19:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:22:19,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-17 19:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-17 19:22:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-17 19:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 19:22:19,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 19:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 19:22:19,072 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_36_to_40_0 [2024-09-17 19:22:19,072 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_36_to_40_0 [2024-09-17 19:22:19,131 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:22:19,133 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:22:19,250 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-17 19:22:19,251 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:22:19,265 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:22:19,265 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 19:22:19,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:19 BoogieIcfgContainer [2024-09-17 19:22:19,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:22:19,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:22:19,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:22:19,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:22:19,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:22:18" (1/3) ... [2024-09-17 19:22:19,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280228a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:19, skipping insertion in model container [2024-09-17 19:22:19,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:22:18" (2/3) ... [2024-09-17 19:22:19,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280228a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:22:19, skipping insertion in model container [2024-09-17 19:22:19,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:22:19" (3/3) ... [2024-09-17 19:22:19,271 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_1-1.i [2024-09-17 19:22:19,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:22:19,282 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 19:22:19,326 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:22:19,333 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;@24a2d169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:22:19,333 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 19:22:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-17 19:22:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-17 19:22:19,349 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:19,350 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:19,350 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:19,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -919097502, now seen corresponding path program 1 times [2024-09-17 19:22:19,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:19,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112153623] [2024-09-17 19:22:19,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:19,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:19,912 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-17 19:22:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112153623] [2024-09-17 19:22:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112153623] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:22:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:22:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 19:22:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354600406] [2024-09-17 19:22:19,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:22:19,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 19:22:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:19,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 19:22:19,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 19:22:19,939 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.263157894736842) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 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.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 19:22:20,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:20,113 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-09-17 19:22:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 19:22:20,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-09-17 19:22:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:20,121 INFO L225 Difference]: With dead ends: 62 [2024-09-17 19:22:20,121 INFO L226 Difference]: Without dead ends: 30 [2024-09-17 19:22:20,124 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-17 19:22:20,126 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:20,128 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:22:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-17 19:22:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-17 19:22:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-17 19:22:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-17 19:22:20,162 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2024-09-17 19:22:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:20,163 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-17 19:22:20,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 19:22:20,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-17 19:22:20,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-17 19:22:20,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:20,166 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:20,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 19:22:20,167 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:20,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash 614925112, now seen corresponding path program 1 times [2024-09-17 19:22:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002121534] [2024-09-17 19:22:20,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:20,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,434 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,653 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-17 19:22:20,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:20,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002121534] [2024-09-17 19:22:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002121534] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524901614] [2024-09-17 19:22:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:20,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:20,656 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-17 19:22:20,658 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-17 19:22:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:20,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-17 19:22:20,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:20,773 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-17 19:22:20,850 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 27 treesize of output 23 [2024-09-17 19:22:20,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-17 19:22:20,957 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-17 19:22:21,096 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-17 19:22:21,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2024-09-17 19:22:21,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2024-09-17 19:22:21,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-17 19:22:21,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 100 [2024-09-17 19:22:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-17 19:22:21,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2024-09-17 19:22:21,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-09-17 19:22:22,067 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-17 19:22:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524901614] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:22:22,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:22:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 32 [2024-09-17 19:22:22,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433341650] [2024-09-17 19:22:22,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:22,069 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-17 19:22:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-17 19:22:22,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2024-09-17 19:22:22,072 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-17 19:22:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:22,721 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-17 19:22:22,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-17 19:22:22,723 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 24 [2024-09-17 19:22:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:22,724 INFO L225 Difference]: With dead ends: 56 [2024-09-17 19:22:22,724 INFO L226 Difference]: Without dead ends: 37 [2024-09-17 19:22:22,725 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2024-09-17 19:22:22,725 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:22,726 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 86 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-17 19:22:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-17 19:22:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-17 19:22:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-17 19:22:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-09-17 19:22:22,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 24 [2024-09-17 19:22:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:22,737 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-09-17 19:22:22,737 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 11 states have call successors, (14), 10 states have call predecessors, (14), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-17 19:22:22,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-09-17 19:22:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-17 19:22:22,739 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:22,739 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:22,753 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 19:22:22,940 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-17 19:22:22,940 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1894741686, now seen corresponding path program 2 times [2024-09-17 19:22:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:22,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35694957] [2024-09-17 19:22:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:22,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:23,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:23,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:23,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:23,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-17 19:22:23,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:23,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35694957] [2024-09-17 19:22:23,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35694957] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:23,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010492901] [2024-09-17 19:22:23,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 19:22:23,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:23,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:23,517 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-17 19:22:23,517 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-17 19:22:23,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 19:22:23,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:22:23,589 WARN L260 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-09-17 19:22:23,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:23,598 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-17 19:22:23,669 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 27 treesize of output 23 [2024-09-17 19:22:23,866 INFO L349 Elim1Store]: treesize reduction 63, result has 21.3 percent of original size [2024-09-17 19:22:23,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2024-09-17 19:22:23,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-17 19:22:23,973 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-17 19:22:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:22:24,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:25,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2024-09-17 19:22:25,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 110 [2024-09-17 19:22:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010492901] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:25,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 19:22:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 29 [2024-09-17 19:22:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727858065] [2024-09-17 19:22:25,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:25,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-17 19:22:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-17 19:22:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1370, Unknown=0, NotChecked=0, Total=1482 [2024-09-17 19:22:25,541 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 24 states have internal predecessors, (34), 10 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-17 19:22:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:22:26,925 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-09-17 19:22:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-17 19:22:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 24 states have internal predecessors, (34), 10 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 29 [2024-09-17 19:22:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:22:26,928 INFO L225 Difference]: With dead ends: 74 [2024-09-17 19:22:26,928 INFO L226 Difference]: Without dead ends: 55 [2024-09-17 19:22:26,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=356, Invalid=3184, Unknown=0, NotChecked=0, Total=3540 [2024-09-17 19:22:26,930 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 92 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-17 19:22:26,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 95 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-17 19:22:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-17 19:22:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2024-09-17 19:22:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-17 19:22:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-09-17 19:22:26,947 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 29 [2024-09-17 19:22:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:22:26,947 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-09-17 19:22:26,948 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 24 states have internal predecessors, (34), 10 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-17 19:22:26,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-09-17 19:22:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-17 19:22:26,948 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:22:26,948 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:22:26,961 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-17 19:22:27,149 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:27,149 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:22:27,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:22:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -351700832, now seen corresponding path program 3 times [2024-09-17 19:22:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:22:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320444678] [2024-09-17 19:22:27,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:22:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:22:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:22:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:22:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,904 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:22:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:22:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-17 19:22:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:22:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320444678] [2024-09-17 19:22:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320444678] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:22:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068497509] [2024-09-17 19:22:27,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-17 19:22:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:22:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:22:27,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:22:27,950 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-17 19:22:28,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-17 19:22:28,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:22:28,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-17 19:22:28,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:22:28,106 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-17 19:22:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 19:22:28,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:22:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:22:41,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068497509] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:22:41,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:22:41,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 39 [2024-09-17 19:22:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202924231] [2024-09-17 19:22:41,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:22:41,293 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-17 19:22:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:22:41,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-17 19:22:41,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1298, Unknown=3, NotChecked=0, Total=1482 [2024-09-17 19:22:41,295 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 39 states, 30 states have (on average 1.4) internal successors, (42), 33 states have internal predecessors, (42), 11 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-17 19:23:01,428 WARN L293 SmtUtils]: Spent 20.04s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-17 19:23:05,729 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-17 19:23:09,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-17 19:23:13,747 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-17 19:23:17,752 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-17 19:23:37,821 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-17 19:23:41,825 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-17 19:23:45,828 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-17 19:23:49,831 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-17 19:23:53,847 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-17 19:23:57,857 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-17 19:24:01,862 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-17 19:24:17,997 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-17 19:24:22,001 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-17 19:24:26,004 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-17 19:24:30,076 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-17 19:24:34,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:24:38,085 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-17 19:24:42,088 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-17 19:24:46,096 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-17 19:24:50,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:24:54,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:24:58,117 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-17 19:25:02,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:25:06,166 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-17 19:25:10,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:25:14,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-17 19:25:18,614 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-17 19:25:22,621 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-17 19:25:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:25:22,903 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-17 19:25:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-17 19:25:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.4) internal successors, (42), 33 states have internal predecessors, (42), 11 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) Word has length 34 [2024-09-17 19:25:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:25:22,904 INFO L225 Difference]: With dead ends: 100 [2024-09-17 19:25:22,904 INFO L226 Difference]: Without dead ends: 65 [2024-09-17 19:25:22,905 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=546, Invalid=3350, Unknown=10, NotChecked=0, Total=3906 [2024-09-17 19:25:22,906 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 119 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 130 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 112.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 112.7s IncrementalHoareTripleChecker+Time [2024-09-17 19:25:22,906 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 89 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 722 Invalid, 28 Unknown, 0 Unchecked, 112.7s Time] [2024-09-17 19:25:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-17 19:25:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2024-09-17 19:25:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 11 states have call successors, (11), 8 states have call predecessors, (11), 11 states have return successors, (13), 12 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-17 19:25:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-09-17 19:25:22,919 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 34 [2024-09-17 19:25:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:25:22,919 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-09-17 19:25:22,919 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.4) internal successors, (42), 33 states have internal predecessors, (42), 11 states have call successors, (14), 8 states have call predecessors, (14), 13 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-17 19:25:22,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:25:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-09-17 19:25:22,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-17 19:25:22,921 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:25:22,921 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:25:22,934 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-17 19:25:23,122 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:25:23,122 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:25:23,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:25:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 924598018, now seen corresponding path program 4 times [2024-09-17 19:25:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:25:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120199726] [2024-09-17 19:25:23,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:25:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:25:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:23,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:25:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:23,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:25:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:24,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:25,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:25,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:26,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:26,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:26,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:26,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:26,954 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:25:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:25:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-17 19:25:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:25:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120199726] [2024-09-17 19:25:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120199726] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:25:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832791322] [2024-09-17 19:25:27,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-17 19:25:27,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:25:27,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:25:27,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:25:27,033 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-17 19:25:27,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-17 19:25:27,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:25:27,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-09-17 19:25:27,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:25:27,215 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-17 19:25:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-09-17 19:25:28,013 INFO L327 TraceCheckSpWp]: Computing backward predicates...