./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1d5fa637 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/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -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 60035180ad93ee19bf4d992ab5c22fc9a9b898dcfe886a7e5b520105473a6903 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-1d5fa63-m [2024-09-13 08:43:16,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 08:43:16,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 08:43:16,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 08:43:16,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 08:43:16,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 08:43:16,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 08:43:16,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 08:43:16,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 08:43:16,868 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 08:43:16,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 08:43:16,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 08:43:16,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 08:43:16,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 08:43:16,869 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 08:43:16,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 08:43:16,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 08:43:16,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 08:43:16,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 08:43:16,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 08:43:16,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 08:43:16,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 08:43:16,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 08:43:16,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 08:43:16,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 08:43:16,872 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 08:43:16,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 08:43:16,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 08:43:16,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 08:43:16,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 08:43:16,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 08:43:16,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 08:43:16,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 08:43:16,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 08:43:16,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 08:43:16,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 08:43:16,875 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 08:43:16,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 08:43:16,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 08:43:16,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 08:43:16,876 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 08:43:16,876 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 08:43:16,876 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 -> 60035180ad93ee19bf4d992ab5c22fc9a9b898dcfe886a7e5b520105473a6903 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 08:43:17,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 08:43:17,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 08:43:17,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 08:43:17,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 08:43:17,179 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 08:43:17,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2024-09-13 08:43:18,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 08:43:18,753 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 08:43:18,754 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2024-09-13 08:43:18,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/baeb822da/431313cdb1da402b9eae6f162e3cd73b/FLAG95f6167ff [2024-09-13 08:43:18,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/baeb822da/431313cdb1da402b9eae6f162e3cd73b [2024-09-13 08:43:18,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 08:43:18,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 08:43:18,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 08:43:18,778 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 08:43:18,783 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 08:43:18,784 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 08:43:18" (1/1) ... [2024-09-13 08:43:18,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d55b6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:18, skipping insertion in model container [2024-09-13 08:43:18,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 08:43:18" (1/1) ... [2024-09-13 08:43:18,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 08:43:18,961 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1215,1228] [2024-09-13 08:43:18,969 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1969,1982] [2024-09-13 08:43:18,974 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2490,2503] [2024-09-13 08:43:18,982 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3282,3295] [2024-09-13 08:43:18,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 08:43:18,992 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 08:43:19,012 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1215,1228] [2024-09-13 08:43:19,018 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1969,1982] [2024-09-13 08:43:19,020 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2490,2503] [2024-09-13 08:43:19,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3282,3295] [2024-09-13 08:43:19,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 08:43:19,052 INFO L204 MainTranslator]: Completed translation [2024-09-13 08:43:19,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19 WrapperNode [2024-09-13 08:43:19,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 08:43:19,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 08:43:19,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 08:43:19,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 08:43:19,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,075 INFO L138 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 08:43:19,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 08:43:19,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 08:43:19,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 08:43:19,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 08:43:19,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,114 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-13 08:43:19,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 08:43:19,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 08:43:19,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 08:43:19,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 08:43:19,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (1/1) ... [2024-09-13 08:43:19,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 08:43:19,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 08:43:19,177 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-13 08:43:19,179 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-13 08:43:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 08:43:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 08:43:19,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 08:43:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 08:43:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-13 08:43:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-13 08:43:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-13 08:43:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-13 08:43:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 08:43:19,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 08:43:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 08:43:19,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 08:43:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-13 08:43:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-13 08:43:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-13 08:43:19,297 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 08:43:19,299 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 08:43:19,598 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-09-13 08:43:19,598 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 08:43:19,621 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 08:43:19,622 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 08:43:19,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:19 BoogieIcfgContainer [2024-09-13 08:43:19,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 08:43:19,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 08:43:19,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 08:43:19,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 08:43:19,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 08:43:18" (1/3) ... [2024-09-13 08:43:19,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c83de35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 08:43:19, skipping insertion in model container [2024-09-13 08:43:19,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:19" (2/3) ... [2024-09-13 08:43:19,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c83de35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 08:43:19, skipping insertion in model container [2024-09-13 08:43:19,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:19" (3/3) ... [2024-09-13 08:43:19,629 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2024-09-13 08:43:19,641 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 08:43:19,641 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-13 08:43:19,684 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 08:43:19,690 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;@142740a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 08:43:19,691 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-13 08:43:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 38 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-13 08:43:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 08:43:19,701 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:19,702 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:19,703 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:19,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1763754341, now seen corresponding path program 1 times [2024-09-13 08:43:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306566908] [2024-09-13 08:43:19,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:19,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:19,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43: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-13 08:43:19,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:19,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306566908] [2024-09-13 08:43:19,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306566908] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:19,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 08:43:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085098839] [2024-09-13 08:43:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:19,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 08:43:19,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:19,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 08:43:19,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 08:43:19,941 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 38 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:20,093 INFO L93 Difference]: Finished difference Result 88 states and 124 transitions. [2024-09-13 08:43:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 08:43:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-13 08:43:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:20,104 INFO L225 Difference]: With dead ends: 88 [2024-09-13 08:43:20,104 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 08:43:20,108 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 08:43:20,111 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:20,112 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 23 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 08:43:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2024-09-13 08:43:20,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-09-13 08:43:20,151 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 14 [2024-09-13 08:43:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:20,151 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-09-13 08:43:20,152 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-09-13 08:43:20,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 08:43:20,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:20,153 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:20,153 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 08:43:20,154 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:20,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash -276420769, now seen corresponding path program 1 times [2024-09-13 08:43:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204808344] [2024-09-13 08:43:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:20,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:20,299 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-13 08:43:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:20,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204808344] [2024-09-13 08:43:20,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204808344] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:20,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 08:43:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366301729] [2024-09-13 08:43:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:20,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 08:43:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 08:43:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 08:43:20,304 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:20,440 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2024-09-13 08:43:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 08:43:20,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-13 08:43:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:20,442 INFO L225 Difference]: With dead ends: 76 [2024-09-13 08:43:20,442 INFO L226 Difference]: Without dead ends: 44 [2024-09-13 08:43:20,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:20,446 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:20,447 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 35 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-13 08:43:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2024-09-13 08:43:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 35 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-09-13 08:43:20,480 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 14 [2024-09-13 08:43:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:20,481 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-09-13 08:43:20,482 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-09-13 08:43:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-13 08:43:20,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:20,483 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:20,484 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 08:43:20,484 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:20,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -811764192, now seen corresponding path program 1 times [2024-09-13 08:43:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3772981] [2024-09-13 08:43:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:20,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:20,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:20,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3772981] [2024-09-13 08:43:20,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3772981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 08:43:20,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119826443] [2024-09-13 08:43:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 08:43:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 08:43:20,688 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-13 08:43:20,689 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-13 08:43:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:20,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-13 08:43:20,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 08:43:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:20,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 08:43:20,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119826443] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 08:43:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-13 08:43:20,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-09-13 08:43:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883230762] [2024-09-13 08:43:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:20,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 08:43:20,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 08:43:20,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 08:43:20,888 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:20,916 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-09-13 08:43:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 08:43:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-13 08:43:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:20,920 INFO L225 Difference]: With dead ends: 46 [2024-09-13 08:43:20,920 INFO L226 Difference]: Without dead ends: 36 [2024-09-13 08:43:20,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-13 08:43:20,922 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:20,923 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 08:43:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-13 08:43:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-09-13 08:43:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-09-13 08:43:20,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 15 [2024-09-13 08:43:20,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:20,936 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-09-13 08:43:20,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:20,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:20,937 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-09-13 08:43:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 08:43:20,938 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:20,938 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:20,956 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 08:43:21,138 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 08:43:21,139 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:21,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1489803020, now seen corresponding path program 1 times [2024-09-13 08:43:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316893228] [2024-09-13 08:43:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 08:43:21,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316893228] [2024-09-13 08:43:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316893228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 08:43:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693804873] [2024-09-13 08:43:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:21,209 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 08:43:21,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 08:43:21,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 08:43:21,211 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:21,308 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-09-13 08:43:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 08:43:21,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-13 08:43:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:21,310 INFO L225 Difference]: With dead ends: 62 [2024-09-13 08:43:21,310 INFO L226 Difference]: Without dead ends: 41 [2024-09-13 08:43:21,310 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:21,311 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:21,312 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 34 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-13 08:43:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2024-09-13 08:43:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-09-13 08:43:21,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 16 [2024-09-13 08:43:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:21,333 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-09-13 08:43:21,333 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-09-13 08:43:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 08:43:21,334 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:21,334 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:21,334 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 08:43:21,335 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:21,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1554479281, now seen corresponding path program 1 times [2024-09-13 08:43:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300380891] [2024-09-13 08:43:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 08:43:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300380891] [2024-09-13 08:43:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300380891] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 08:43:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986525903] [2024-09-13 08:43:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:21,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 08:43:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 08:43:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:21,423 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:21,533 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-09-13 08:43:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 08:43:21,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-13 08:43:21,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:21,535 INFO L225 Difference]: With dead ends: 38 [2024-09-13 08:43:21,537 INFO L226 Difference]: Without dead ends: 36 [2024-09-13 08:43:21,538 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:21,538 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:21,539 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:21,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-13 08:43:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-13 08:43:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-13 08:43:21,549 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2024-09-13 08:43:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:21,549 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-13 08:43:21,550 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,550 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-13 08:43:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 08:43:21,551 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:21,551 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:21,551 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 08:43:21,551 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:21,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash -886068297, now seen corresponding path program 1 times [2024-09-13 08:43:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:21,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420362864] [2024-09-13 08:43:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-13 08:43:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420362864] [2024-09-13 08:43:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420362864] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 08:43:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338734481] [2024-09-13 08:43:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:21,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 08:43:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:21,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 08:43:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 08:43:21,592 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:21,675 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2024-09-13 08:43:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 08:43:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-13 08:43:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:21,677 INFO L225 Difference]: With dead ends: 58 [2024-09-13 08:43:21,677 INFO L226 Difference]: Without dead ends: 37 [2024-09-13 08:43:21,677 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:21,678 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:21,678 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 35 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-13 08:43:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2024-09-13 08:43:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 08:43:21,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2024-09-13 08:43:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:21,686 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 08:43:21,686 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:21,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 08:43:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 08:43:21,687 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:21,687 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:21,687 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 08:43:21,688 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:21,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash -584208434, now seen corresponding path program 1 times [2024-09-13 08:43:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710273727] [2024-09-13 08:43:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:21,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:21,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710273727] [2024-09-13 08:43:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710273727] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 08:43:21,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598351721] [2024-09-13 08:43:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:21,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 08:43:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 08:43:21,799 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-13 08:43:21,801 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-13 08:43:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:21,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 08:43:21,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 08:43:21,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:21,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 08:43:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:21,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598351721] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 08:43:21,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 08:43:21,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-09-13 08:43:21,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436465444] [2024-09-13 08:43:21,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 08:43:21,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 08:43:21,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:21,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 08:43:21,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-13 08:43:21,914 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:22,045 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2024-09-13 08:43:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:22,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-13 08:43:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:22,046 INFO L225 Difference]: With dead ends: 58 [2024-09-13 08:43:22,046 INFO L226 Difference]: Without dead ends: 34 [2024-09-13 08:43:22,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-09-13 08:43:22,048 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:22,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-13 08:43:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-13 08:43:22,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-13 08:43:22,062 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 22 [2024-09-13 08:43:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:22,062 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-13 08:43:22,062 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:22,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-13 08:43:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-13 08:43:22,063 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:22,063 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:22,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 08:43:22,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-13 08:43:22,264 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:22,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:22,265 INFO L85 PathProgramCache]: Analyzing trace with hash 193329519, now seen corresponding path program 2 times [2024-09-13 08:43:22,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:22,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405031163] [2024-09-13 08:43:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:22,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:22,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405031163] [2024-09-13 08:43:22,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405031163] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 08:43:22,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344549381] [2024-09-13 08:43:22,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 08:43:22,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 08:43:22,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 08:43:22,471 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-13 08:43:22,473 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-13 08:43:22,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-09-13 08:43:22,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 08:43:22,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 08:43:22,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 08:43:23,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 08:43:23,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 08:43:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 08:43:23,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-13 08:43:23,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-13 08:43:24,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-13 08:43:24,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 521 treesize of output 287 [2024-09-13 08:43:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 08:43:24,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 08:43:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344549381] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:24,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 08:43:24,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-09-13 08:43:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521799812] [2024-09-13 08:43:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:24,514 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 08:43:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 08:43:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-09-13 08:43:24,515 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:24,737 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-09-13 08:43:24,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 08:43:24,738 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-13 08:43:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:24,739 INFO L225 Difference]: With dead ends: 50 [2024-09-13 08:43:24,739 INFO L226 Difference]: Without dead ends: 29 [2024-09-13 08:43:24,740 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-09-13 08:43:24,740 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:24,741 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 47 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 08:43:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-13 08:43:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-13 08:43:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:24,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-13 08:43:24,752 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2024-09-13 08:43:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:24,753 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-13 08:43:24,753 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:24,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:24,753 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-13 08:43:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-13 08:43:24,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:24,754 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:24,771 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 08:43:24,958 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-13 08:43:24,959 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 08:43:24,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:24,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1047380132, now seen corresponding path program 1 times [2024-09-13 08:43:24,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811120362] [2024-09-13 08:43:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:25,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 08:43:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:25,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811120362] [2024-09-13 08:43:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811120362] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:25,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332962529] [2024-09-13 08:43:25,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:25,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:25,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:25,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:25,087 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:25,178 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-09-13 08:43:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:25,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-13 08:43:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:25,179 INFO L225 Difference]: With dead ends: 27 [2024-09-13 08:43:25,180 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 08:43:25,180 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-13 08:43:25,180 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:25,181 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 39 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 08:43:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 08:43:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 08:43:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 08:43:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 08:43:25,182 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-09-13 08:43:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:25,182 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 08:43:25,182 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 08:43:25,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 08:43:25,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 08:43:25,186 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-09-13 08:43:25,186 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-09-13 08:43:25,186 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-09-13 08:43:25,187 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-09-13 08:43:25,187 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 08:43:25,190 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:25,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 08:43:25,637 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 08:43:25,648 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,649 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,652 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,653 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,653 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,653 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,656 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,659 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,659 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-13 08:43:25,659 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] [2024-09-13 08:43:25,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 08:43:25 BoogieIcfgContainer [2024-09-13 08:43:25,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 08:43:25,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 08:43:25,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 08:43:25,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 08:43:25,664 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:19" (3/4) ... [2024-09-13 08:43:25,667 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 08:43:25,670 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 08:43:25,670 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 08:43:25,675 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-09-13 08:43:25,675 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 08:43:25,675 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-13 08:43:25,675 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 08:43:25,701 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((__tmp_155_0 == \old(__tmp_155_0)) && ((main__loop_entered % 4294967296) == 0)) [2024-09-13 08:43:25,702 WARN L216 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((__tmp_155_0 == \old(__tmp_155_0)) && (main____CPAchecker_TMP_0 == 1)) && ((main__loop_entered % 4294967296) == 0)) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main__index2 <= (((main__index2 / 4294967296) * 4294967296) + 99999))) [2024-09-13 08:43:25,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 08:43:25,781 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 08:43:25,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 08:43:25,782 INFO L158 Benchmark]: Toolchain (without parser) took 7006.90ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 118.7MB in the beginning and 174.2MB in the end (delta: -55.5MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,783 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory was 123.4MB in the beginning and 123.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 08:43:25,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.24ms. Allocated memory is still 153.1MB. Free memory was 118.7MB in the beginning and 105.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.12ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 08:43:25,783 INFO L158 Benchmark]: Boogie Preprocessor took 63.62ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 102.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,783 INFO L158 Benchmark]: RCFGBuilder took 481.40ms. Allocated memory is still 153.1MB. Free memory was 102.0MB in the beginning and 114.3MB in the end (delta: -12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,784 INFO L158 Benchmark]: TraceAbstraction took 6039.16ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 113.5MB in the beginning and 180.5MB in the end (delta: -67.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,784 INFO L158 Benchmark]: Witness Printer took 118.06ms. Allocated memory is still 268.4MB. Free memory was 180.5MB in the beginning and 174.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-13 08:43:25,786 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory was 123.4MB in the beginning and 123.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.24ms. Allocated memory is still 153.1MB. Free memory was 118.7MB in the beginning and 105.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.12ms. Allocated memory is still 153.1MB. Free memory was 105.2MB in the beginning and 104.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.62ms. Allocated memory is still 153.1MB. Free memory was 104.0MB in the beginning and 102.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 481.40ms. Allocated memory is still 153.1MB. Free memory was 102.0MB in the beginning and 114.3MB in the end (delta: -12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6039.16ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 113.5MB in the beginning and 180.5MB in the end (delta: -67.0MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 118.06ms. Allocated memory is still 268.4MB. Free memory was 180.5MB in the beginning and 174.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~#main__array~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 46]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 77]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 171]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 469 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 184 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 227 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 808 SizeOfPredicates, 6 NumberOfNonLiveVariables, 320 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 24/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 101]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 33]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 35]: Location Invariant Derived location invariant: (((((__tmp_155_0 == \old(__tmp_155_0)) && (main____CPAchecker_TMP_0 == 1)) && ((main__loop_entered % 4294967296) == 0)) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && (main__index2 <= (((main__index2 / 4294967296) * 4294967296) + 99999))) - InvariantResult [Line: 64]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((__tmp_155_0 == \old(__tmp_155_0)) && ((main__loop_entered % 4294967296) == 0)) - InvariantResult [Line: 66]: Location Invariant Derived location invariant: ((((main____CPAchecker_TMP_0 != 0) && ((((long long) main__index2 + 1) % 4294967296) <= 99999)) && (((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296))) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) - InvariantResult [Line: 50]: Location Invariant Derived location invariant: ((((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999)) - InvariantResult [Line: 104]: Location Invariant Derived location invariant: ((((((long long) main__index2 + 1) % 4294967296) <= 99999) && ((((4294967295 + main__index1) % 4294967296) + 1) <= (((long long) main__index2 + 1) % 4294967296))) || ((((long long) (main__index1 % 4294967296) + 1) <= (main__index2 % 4294967296)) && ((main__index2 % 4294967296) <= 99999))) RESULT: Ultimate proved your program to be correct! [2024-09-13 08:43:25,816 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE