./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --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 a9b967e5 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-invgen/apache-escape-absolute.i.v+cfa-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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --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-a9b967e-m [2024-09-11 19:21:59,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:21:59,883 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:21:59,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:21:59,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:21:59,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:21:59,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:21:59,909 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:21:59,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:21:59,910 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:21:59,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:21:59,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:21:59,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:21:59,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:21:59,912 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:21:59,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:21:59,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:21:59,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:21:59,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:21:59,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:21:59,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:21:59,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:21:59,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:21:59,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:21:59,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:21:59,916 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:21:59,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:21:59,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:21:59,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:21:59,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:21:59,917 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:21:59,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:21:59,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:21:59,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:21:59,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:21:59,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:21:59,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:21:59,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:21:59,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:21:59,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:21:59,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:21:59,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:21:59,922 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c 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-11 19:22:00,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:00,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:00,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:00,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:00,201 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:00,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-11 19:22:01,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:01,780 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:01,780 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2024-09-11 19:22:01,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/91607eb38/d967598d6a8b429d9fd886bb966b471c/FLAGb43015462 [2024-09-11 19:22:01,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/91607eb38/d967598d6a8b429d9fd886bb966b471c [2024-09-11 19:22:01,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:01,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:01,809 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:01,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:01,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:01,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:01" (1/1) ... [2024-09-11 19:22:01,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd9a49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:01, skipping insertion in model container [2024-09-11 19:22:01,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:01" (1/1) ... [2024-09-11 19:22:01,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:02,037 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-11 19:22:02,043 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-11 19:22:02,047 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-11 19:22:02,049 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-11 19:22:02,053 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-11 19:22:02,054 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-11 19:22:02,058 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-11 19:22:02,062 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-11 19:22:02,069 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-11 19:22:02,072 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-11 19:22:02,074 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-11 19:22:02,075 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-11 19:22:02,078 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-11 19:22:02,081 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-11 19:22:02,084 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-11 19:22:02,088 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2024-09-11 19:22:02,095 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-11 19:22:02,097 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2024-09-11 19:22:02,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:02,110 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:02,122 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2024-09-11 19:22:02,124 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2024-09-11 19:22:02,125 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2024-09-11 19:22:02,126 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2024-09-11 19:22:02,131 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2024-09-11 19:22:02,136 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2024-09-11 19:22:02,137 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2024-09-11 19:22:02,143 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2024-09-11 19:22:02,145 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2024-09-11 19:22:02,147 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2024-09-11 19:22:02,151 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2024-09-11 19:22:02,152 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2024-09-11 19:22:02,154 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2024-09-11 19:22:02,156 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2024-09-11 19:22:02,157 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2024-09-11 19:22:02,159 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2024-09-11 19:22:02,161 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2024-09-11 19:22:02,162 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-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2024-09-11 19:22:02,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:02,180 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:02,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02 WrapperNode [2024-09-11 19:22:02,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:02,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:02,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:02,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:02,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,231 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 282 [2024-09-11 19:22:02,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:02,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:02,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:02,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:02,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,256 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:22:02,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:02,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:02,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:02,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:02,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (1/1) ... [2024-09-11 19:22:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:02,316 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-11 19:22:02,318 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-11 19:22:02,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:02,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:02,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:02,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:02,451 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:02,453 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:02,815 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:02,815 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:02,850 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:02,851 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 19:22:02,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:02 BoogieIcfgContainer [2024-09-11 19:22:02,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:02,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:02,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:02,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:02,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:01" (1/3) ... [2024-09-11 19:22:02,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfa9bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:02, skipping insertion in model container [2024-09-11 19:22:02,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:02" (2/3) ... [2024-09-11 19:22:02,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bfa9bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:02, skipping insertion in model container [2024-09-11 19:22:02,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:02" (3/3) ... [2024-09-11 19:22:02,862 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2024-09-11 19:22:02,878 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:02,878 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-09-11 19:22:02,946 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:02,954 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;@1d33da96, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:02,955 INFO L337 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-09-11 19:22:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 79 states have internal predecessors, (117), 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-11 19:22:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:22:02,965 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:02,966 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:02,966 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:02,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1596893429, now seen corresponding path program 1 times [2024-09-11 19:22:02,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:02,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144354355] [2024-09-11 19:22:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:03,272 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-11 19:22:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:03,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144354355] [2024-09-11 19:22:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144354355] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:22:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974701825] [2024-09-11 19:22:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:03,280 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:22:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:22:03,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:22:03,303 INFO L87 Difference]: Start difference. First operand has 80 states, 61 states have (on average 1.9180327868852458) internal successors, (117), 79 states have internal predecessors, (117), 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) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 19:22:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:03,347 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2024-09-11 19:22:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:22:03,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2024-09-11 19:22:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:03,357 INFO L225 Difference]: With dead ends: 82 [2024-09-11 19:22:03,357 INFO L226 Difference]: Without dead ends: 75 [2024-09-11 19:22:03,361 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 19:22:03,364 INFO L434 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:03,365 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-11 19:22:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-09-11 19:22:03,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 74 states have internal predecessors, (78), 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-11 19:22:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-09-11 19:22:03,408 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 14 [2024-09-11 19:22:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:03,410 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-09-11 19:22:03,410 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11 19:22:03,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-09-11 19:22:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:03,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:03,413 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:03,413 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:03,414 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:03,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2035915345, now seen corresponding path program 1 times [2024-09-11 19:22:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:03,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463194109] [2024-09-11 19:22:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:03,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:03,613 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-11 19:22:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463194109] [2024-09-11 19:22:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463194109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:03,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:03,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:03,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320153913] [2024-09-11 19:22:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:03,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:03,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:03,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:03,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:03,618 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 19:22:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:03,756 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-09-11 19:22:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:03,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 15 [2024-09-11 19:22:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:03,759 INFO L225 Difference]: With dead ends: 75 [2024-09-11 19:22:03,760 INFO L226 Difference]: Without dead ends: 73 [2024-09-11 19:22:03,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:03,762 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:03,763 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 159 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:03,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-11 19:22:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-11 19:22:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 72 states have internal predecessors, (76), 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-11 19:22:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-09-11 19:22:03,785 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 15 [2024-09-11 19:22:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:03,785 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-09-11 19:22:03,786 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-11 19:22:03,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-09-11 19:22:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:22:03,787 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:03,787 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:03,787 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:03,789 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:03,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1990313228, now seen corresponding path program 1 times [2024-09-11 19:22:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504800193] [2024-09-11 19:22:03,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:03,929 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-11 19:22:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504800193] [2024-09-11 19:22:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504800193] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:22:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10937728] [2024-09-11 19:22:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:03,931 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:22:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:22:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:22:03,933 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 19:22:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,043 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2024-09-11 19:22:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:22:04,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2024-09-11 19:22:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,045 INFO L225 Difference]: With dead ends: 96 [2024-09-11 19:22:04,045 INFO L226 Difference]: Without dead ends: 94 [2024-09-11 19:22:04,045 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 19:22:04,046 INFO L434 NwaCegarLoop]: 60 mSDtfsCounter, 28 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,047 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 164 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-11 19:22:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2024-09-11 19:22:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 70 states have internal predecessors, (74), 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-11 19:22:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-09-11 19:22:04,061 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 17 [2024-09-11 19:22:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,061 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-09-11 19:22:04,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-11 19:22:04,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-09-11 19:22:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:22:04,062 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,063 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:04,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:22:04,063 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:04,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1570163815, now seen corresponding path program 1 times [2024-09-11 19:22:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112121789] [2024-09-11 19:22:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,169 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-11 19:22:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112121789] [2024-09-11 19:22:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112121789] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:04,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161296874] [2024-09-11 19:22:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,170 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:04,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:04,171 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-11 19:22:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,275 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-09-11 19:22:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) Word has length 18 [2024-09-11 19:22:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,278 INFO L225 Difference]: With dead ends: 71 [2024-09-11 19:22:04,278 INFO L226 Difference]: Without dead ends: 69 [2024-09-11 19:22:04,278 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:04,279 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 54 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,279 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 147 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-11 19:22:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-11 19:22:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.309090909090909) internal successors, (72), 68 states have internal predecessors, (72), 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-11 19:22:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-09-11 19:22:04,295 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 18 [2024-09-11 19:22:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,295 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-09-11 19:22:04,295 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-11 19:22:04,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-09-11 19:22:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:22:04,297 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,297 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] [2024-09-11 19:22:04,297 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:22:04,297 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:04,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash -253108944, now seen corresponding path program 1 times [2024-09-11 19:22:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973439836] [2024-09-11 19:22:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,373 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-11 19:22:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973439836] [2024-09-11 19:22:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973439836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838140322] [2024-09-11 19:22:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,375 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:04,377 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11 19:22:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,500 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-09-11 19:22:04,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 21 [2024-09-11 19:22:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,504 INFO L225 Difference]: With dead ends: 92 [2024-09-11 19:22:04,504 INFO L226 Difference]: Without dead ends: 90 [2024-09-11 19:22:04,504 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:04,505 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 23 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,506 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 205 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-11 19:22:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2024-09-11 19:22:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-11 19:22:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-09-11 19:22:04,527 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 21 [2024-09-11 19:22:04,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,528 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-09-11 19:22:04,528 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11 19:22:04,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-09-11 19:22:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:22:04,530 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,530 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] [2024-09-11 19:22:04,530 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:22:04,532 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:04,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash -257276709, now seen corresponding path program 1 times [2024-09-11 19:22:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329439013] [2024-09-11 19:22:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,682 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-11 19:22:04,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329439013] [2024-09-11 19:22:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329439013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222379203] [2024-09-11 19:22:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:04,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:04,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:04,685 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11 19:22:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,777 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-09-11 19:22:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:04,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 21 [2024-09-11 19:22:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,778 INFO L225 Difference]: With dead ends: 90 [2024-09-11 19:22:04,779 INFO L226 Difference]: Without dead ends: 88 [2024-09-11 19:22:04,779 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:04,780 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 21 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 205 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-11 19:22:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2024-09-11 19:22:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 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-11 19:22:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-09-11 19:22:04,793 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 21 [2024-09-11 19:22:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,793 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-09-11 19:22:04,793 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-11 19:22:04,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-09-11 19:22:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:22:04,794 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,795 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-11 19:22:04,795 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:22:04,795 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:04,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash 743561460, now seen corresponding path program 1 times [2024-09-11 19:22:04,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545773080] [2024-09-11 19:22:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:04,868 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-11 19:22:04,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:04,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545773080] [2024-09-11 19:22:04,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545773080] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18351030] [2024-09-11 19:22:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:04,869 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:04,870 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 19:22:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:04,946 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-09-11 19:22:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2024-09-11 19:22:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:04,947 INFO L225 Difference]: With dead ends: 74 [2024-09-11 19:22:04,947 INFO L226 Difference]: Without dead ends: 72 [2024-09-11 19:22:04,948 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:04,948 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 48 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:04,949 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 154 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:04,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-11 19:22:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-09-11 19:22:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.305084745762712) internal successors, (77), 71 states have internal predecessors, (77), 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-11 19:22:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-09-11 19:22:04,960 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2024-09-11 19:22:04,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:04,960 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-09-11 19:22:04,960 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 19:22:04,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-09-11 19:22:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:22:04,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:04,961 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-11 19:22:04,961 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:22:04,961 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:04,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash 614360868, now seen corresponding path program 1 times [2024-09-11 19:22:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588330328] [2024-09-11 19:22:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,026 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-11 19:22:05,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588330328] [2024-09-11 19:22:05,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588330328] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385094790] [2024-09-11 19:22:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,028 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:05,031 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 19:22:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,115 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-09-11 19:22:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2024-09-11 19:22:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,117 INFO L225 Difference]: With dead ends: 72 [2024-09-11 19:22:05,117 INFO L226 Difference]: Without dead ends: 70 [2024-09-11 19:22:05,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:05,118 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 46 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,118 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:05,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-11 19:22:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-09-11 19:22:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.293103448275862) internal successors, (75), 69 states have internal predecessors, (75), 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-11 19:22:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-09-11 19:22:05,133 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 22 [2024-09-11 19:22:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,133 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-09-11 19:22:05,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-11 19:22:05,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-09-11 19:22:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 19:22:05,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,134 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, 1, 1] [2024-09-11 19:22:05,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:22:05,135 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:05,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1598124379, now seen corresponding path program 1 times [2024-09-11 19:22:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855865419] [2024-09-11 19:22:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,161 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-11 19:22:05,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855865419] [2024-09-11 19:22:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855865419] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:22:05,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811075268] [2024-09-11 19:22:05,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,162 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:22:05,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:22:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:22:05,163 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 19:22:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,206 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2024-09-11 19:22:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:22:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) Word has length 24 [2024-09-11 19:22:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,207 INFO L225 Difference]: With dead ends: 110 [2024-09-11 19:22:05,207 INFO L226 Difference]: Without dead ends: 70 [2024-09-11 19:22:05,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 19:22:05,208 INFO L434 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-11 19:22:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-09-11 19:22:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 69 states have internal predecessors, (73), 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-11 19:22:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2024-09-11 19:22:05,224 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 24 [2024-09-11 19:22:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,225 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2024-09-11 19:22:05,225 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 19:22:05,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2024-09-11 19:22:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:22:05,226 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,226 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:05,226 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-11 19:22:05,230 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:05,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1568736066, now seen corresponding path program 1 times [2024-09-11 19:22:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769893536] [2024-09-11 19:22:05,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769893536] [2024-09-11 19:22:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769893536] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327922343] [2024-09-11 19:22:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:05,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:05,346 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-11 19:22:05,348 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-11 19:22:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:22:05,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:05,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327922343] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:05,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-11 19:22:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573249787] [2024-09-11 19:22:05,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,560 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:05,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:05,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:05,561 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-11 19:22:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:05,640 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-09-11 19:22:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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) Word has length 25 [2024-09-11 19:22:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:05,641 INFO L225 Difference]: With dead ends: 71 [2024-09-11 19:22:05,641 INFO L226 Difference]: Without dead ends: 69 [2024-09-11 19:22:05,641 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:05,642 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:05,643 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 148 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-11 19:22:05,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-09-11 19:22:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.25) internal successors, (70), 66 states have internal predecessors, (70), 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-11 19:22:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-09-11 19:22:05,659 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2024-09-11 19:22:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:05,660 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-09-11 19:22:05,660 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-11 19:22:05,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,661 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-09-11 19:22:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:22:05,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:05,661 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, 1, 1, 1] [2024-09-11 19:22:05,681 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:22:05,862 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 19:22:05,862 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:05,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1541456980, now seen corresponding path program 1 times [2024-09-11 19:22:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:05,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123738746] [2024-09-11 19:22:05,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:05,944 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-11 19:22:05,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:05,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123738746] [2024-09-11 19:22:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123738746] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:05,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210078073] [2024-09-11 19:22:05,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:05,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:05,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:05,946 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11 19:22:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:06,017 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-09-11 19:22:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 25 [2024-09-11 19:22:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:06,019 INFO L225 Difference]: With dead ends: 68 [2024-09-11 19:22:06,019 INFO L226 Difference]: Without dead ends: 66 [2024-09-11 19:22:06,020 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:06,020 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 77 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:06,021 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 93 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:06,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-11 19:22:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-09-11 19:22:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 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-11 19:22:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-09-11 19:22:06,037 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 25 [2024-09-11 19:22:06,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:06,037 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-09-11 19:22:06,037 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11 19:22:06,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-09-11 19:22:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 19:22:06,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:06,040 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:06,040 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-11 19:22:06,040 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:06,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1382329080, now seen corresponding path program 1 times [2024-09-11 19:22:06,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686564618] [2024-09-11 19:22:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:06,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:06,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686564618] [2024-09-11 19:22:06,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686564618] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:06,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854497513] [2024-09-11 19:22:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:06,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:06,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:06,139 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-11 19:22:06,141 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-11 19:22:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:06,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:22:06,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:06,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:22:06,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854497513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:06,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-11 19:22:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224079644] [2024-09-11 19:22:06,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:06,280 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:06,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:06,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:06,281 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-11 19:22:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:06,352 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-09-11 19:22:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 26 [2024-09-11 19:22:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:06,353 INFO L225 Difference]: With dead ends: 66 [2024-09-11 19:22:06,353 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 19:22:06,354 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:06,354 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:06,354 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 136 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 19:22:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-09-11 19:22:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.22) internal successors, (61), 58 states have internal predecessors, (61), 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-11 19:22:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2024-09-11 19:22:06,363 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 26 [2024-09-11 19:22:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:06,363 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2024-09-11 19:22:06,363 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-11 19:22:06,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2024-09-11 19:22:06,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 19:22:06,364 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:06,364 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, 1, 1, 1, 1] [2024-09-11 19:22:06,381 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:06,565 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 19:22:06,565 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:06,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,566 INFO L85 PathProgramCache]: Analyzing trace with hash -540521971, now seen corresponding path program 1 times [2024-09-11 19:22:06,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:06,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940886445] [2024-09-11 19:22:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:06,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:06,657 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-11 19:22:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940886445] [2024-09-11 19:22:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940886445] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:06,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:06,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:06,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690740764] [2024-09-11 19:22:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:06,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:06,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:06,659 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11 19:22:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:06,731 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-09-11 19:22:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:06,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 26 [2024-09-11 19:22:06,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:06,732 INFO L225 Difference]: With dead ends: 59 [2024-09-11 19:22:06,732 INFO L226 Difference]: Without dead ends: 57 [2024-09-11 19:22:06,732 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:06,733 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 33 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:06,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 111 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-11 19:22:06,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-11 19:22:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 56 states have internal predecessors, (59), 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-11 19:22:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2024-09-11 19:22:06,748 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 26 [2024-09-11 19:22:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:06,750 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2024-09-11 19:22:06,750 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-11 19:22:06,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2024-09-11 19:22:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:22:06,752 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:06,753 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:06,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-11 19:22:06,753 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:06,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash -853579786, now seen corresponding path program 1 times [2024-09-11 19:22:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805471573] [2024-09-11 19:22:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:06,857 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-11 19:22:06,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:06,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805471573] [2024-09-11 19:22:06,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805471573] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:06,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:06,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:06,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972874820] [2024-09-11 19:22:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:06,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:06,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:06,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:06,859 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11 19:22:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:06,914 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2024-09-11 19:22:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) Word has length 29 [2024-09-11 19:22:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:06,915 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:22:06,916 INFO L226 Difference]: Without dead ends: 56 [2024-09-11 19:22:06,916 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:06,916 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 59 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:06,916 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 81 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:06,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-11 19:22:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-11 19:22:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.1875) internal successors, (57), 54 states have internal predecessors, (57), 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-11 19:22:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2024-09-11 19:22:06,925 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 29 [2024-09-11 19:22:06,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:06,925 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2024-09-11 19:22:06,926 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-11 19:22:06,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2024-09-11 19:22:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:22:06,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:06,927 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:06,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-11 19:22:06,927 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:06,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -691165415, now seen corresponding path program 1 times [2024-09-11 19:22:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:06,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249441213] [2024-09-11 19:22:06,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:06,994 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-11 19:22:06,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:06,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249441213] [2024-09-11 19:22:06,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249441213] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:06,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:06,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538178514] [2024-09-11 19:22:06,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:06,995 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:06,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:06,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:06,996 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11 19:22:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,083 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-09-11 19:22:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:07,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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) Word has length 30 [2024-09-11 19:22:07,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,084 INFO L225 Difference]: With dead ends: 66 [2024-09-11 19:22:07,084 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 19:22:07,084 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:07,085 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,085 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 113 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 19:22:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2024-09-11 19:22:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 52 states have internal predecessors, (55), 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-11 19:22:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2024-09-11 19:22:07,094 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 30 [2024-09-11 19:22:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,095 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2024-09-11 19:22:07,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-11 19:22:07,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2024-09-11 19:22:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 19:22:07,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,096 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-11 19:22:07,096 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -431604608, now seen corresponding path program 1 times [2024-09-11 19:22:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003745942] [2024-09-11 19:22:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,158 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-11 19:22:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003745942] [2024-09-11 19:22:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003745942] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:07,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057964148] [2024-09-11 19:22:07,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,160 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:07,161 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-11 19:22:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,248 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2024-09-11 19:22:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) Word has length 33 [2024-09-11 19:22:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,249 INFO L225 Difference]: With dead ends: 86 [2024-09-11 19:22:07,249 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 19:22:07,250 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:07,250 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,251 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 19:22:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2024-09-11 19:22:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.16) internal successors, (58), 55 states have internal predecessors, (58), 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-11 19:22:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2024-09-11 19:22:07,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 33 [2024-09-11 19:22:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,261 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2024-09-11 19:22:07,261 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-11 19:22:07,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2024-09-11 19:22:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-11 19:22:07,262 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,262 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-11 19:22:07,263 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,263 INFO L85 PathProgramCache]: Analyzing trace with hash -494836764, now seen corresponding path program 1 times [2024-09-11 19:22:07,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624805707] [2024-09-11 19:22:07,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,345 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-11 19:22:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624805707] [2024-09-11 19:22:07,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624805707] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549334315] [2024-09-11 19:22:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,346 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:07,347 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11 19:22:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,402 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-09-11 19:22:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:07,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) Word has length 34 [2024-09-11 19:22:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,403 INFO L225 Difference]: With dead ends: 56 [2024-09-11 19:22:07,404 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 19:22:07,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:07,404 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,404 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 132 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 19:22:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-11 19:22:07,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 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-11 19:22:07,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-09-11 19:22:07,413 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 34 [2024-09-11 19:22:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,414 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-09-11 19:22:07,414 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-11 19:22:07,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,414 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-09-11 19:22:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 19:22:07,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,415 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,416 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-11 19:22:07,416 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1203370183, now seen corresponding path program 1 times [2024-09-11 19:22:07,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725578165] [2024-09-11 19:22:07,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,484 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-11 19:22:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725578165] [2024-09-11 19:22:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725578165] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:22:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106564158] [2024-09-11 19:22:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,485 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:22:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:22:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:22:07,486 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11 19:22:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,507 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-09-11 19:22:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:22:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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) Word has length 36 [2024-09-11 19:22:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,508 INFO L225 Difference]: With dead ends: 57 [2024-09-11 19:22:07,508 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 19:22:07,508 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:22:07,509 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,509 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 136 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 19:22:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-09-11 19:22:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.125) internal successors, (54), 51 states have internal predecessors, (54), 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-11 19:22:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-09-11 19:22:07,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2024-09-11 19:22:07,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,518 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-09-11 19:22:07,518 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11 19:22:07,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-09-11 19:22:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 19:22:07,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,519 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-11 19:22:07,520 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1350225778, now seen corresponding path program 1 times [2024-09-11 19:22:07,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069241425] [2024-09-11 19:22:07,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,592 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-11 19:22:07,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069241425] [2024-09-11 19:22:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069241425] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471764096] [2024-09-11 19:22:07,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,594 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:07,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:07,595 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11 19:22:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,628 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-09-11 19:22:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:07,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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) Word has length 37 [2024-09-11 19:22:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,629 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:22:07,629 INFO L226 Difference]: Without dead ends: 58 [2024-09-11 19:22:07,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:07,630 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,631 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 180 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:07,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-11 19:22:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2024-09-11 19:22:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 49 states have internal predecessors, (52), 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-11 19:22:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-09-11 19:22:07,641 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 37 [2024-09-11 19:22:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,642 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-09-11 19:22:07,642 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-11 19:22:07,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-09-11 19:22:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:22:07,643 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,643 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,643 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-11 19:22:07,643 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1092678062, now seen corresponding path program 1 times [2024-09-11 19:22:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282780264] [2024-09-11 19:22:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,718 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-11 19:22:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282780264] [2024-09-11 19:22:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282780264] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679982577] [2024-09-11 19:22:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,720 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:07,720 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11 19:22:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,809 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2024-09-11 19:22:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2024-09-11 19:22:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,810 INFO L225 Difference]: With dead ends: 72 [2024-09-11 19:22:07,810 INFO L226 Difference]: Without dead ends: 70 [2024-09-11 19:22:07,810 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:07,811 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,812 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 102 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:07,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-11 19:22:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2024-09-11 19:22:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 54 states have internal predecessors, (58), 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-11 19:22:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-09-11 19:22:07,825 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 38 [2024-09-11 19:22:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:07,825 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-09-11 19:22:07,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11 19:22:07,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-09-11 19:22:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 19:22:07,825 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:07,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:07,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-11 19:22:07,826 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:07,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -486714219, now seen corresponding path program 1 times [2024-09-11 19:22:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088395530] [2024-09-11 19:22:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:07,928 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-11 19:22:07,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088395530] [2024-09-11 19:22:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088395530] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:07,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:07,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:07,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058676380] [2024-09-11 19:22:07,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:07,930 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:07,930 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11 19:22:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:07,988 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-09-11 19:22:07,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:07,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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) Word has length 39 [2024-09-11 19:22:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:07,989 INFO L225 Difference]: With dead ends: 55 [2024-09-11 19:22:07,989 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 19:22:07,990 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:07,990 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:07,990 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 114 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 19:22:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-11 19:22:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 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-11 19:22:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-09-11 19:22:07,999 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 39 [2024-09-11 19:22:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:08,000 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-09-11 19:22:08,000 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-11 19:22:08,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-09-11 19:22:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 19:22:08,001 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:08,001 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:08,001 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-09-11 19:22:08,002 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:08,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:08,002 INFO L85 PathProgramCache]: Analyzing trace with hash 449608968, now seen corresponding path program 1 times [2024-09-11 19:22:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582215733] [2024-09-11 19:22:08,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:08,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582215733] [2024-09-11 19:22:08,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582215733] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210162949] [2024-09-11 19:22:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:08,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:08,131 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-11 19:22:08,133 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-11 19:22:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:08,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:22:08,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:08,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:08,306 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210162949] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:08,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2024-09-11 19:22:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22905071] [2024-09-11 19:22:08,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:08,434 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:08,435 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-11 19:22:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:08,509 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2024-09-11 19:22:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) Word has length 39 [2024-09-11 19:22:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:08,510 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:22:08,510 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 19:22:08,510 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:08,511 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:08,511 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 19:22:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-11 19:22:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.08) internal successors, (54), 50 states have internal predecessors, (54), 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-11 19:22:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-09-11 19:22:08,522 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 39 [2024-09-11 19:22:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:08,522 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-09-11 19:22:08,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-11 19:22:08,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-09-11 19:22:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-11 19:22:08,523 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:08,523 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:08,540 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:08,727 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-11 19:22:08,728 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2024-09-11 19:22:08,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 244696614, now seen corresponding path program 1 times [2024-09-11 19:22:08,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:08,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347030708] [2024-09-11 19:22:08,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:08,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:22:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:08,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347030708] [2024-09-11 19:22:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347030708] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:08,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:08,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477503515] [2024-09-11 19:22:08,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:08,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:08,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:08,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:08,821 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11 19:22:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:08,896 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-09-11 19:22:08,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:08,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) Word has length 44 [2024-09-11 19:22:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:08,897 INFO L225 Difference]: With dead ends: 62 [2024-09-11 19:22:08,897 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:08,898 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:08,898 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 81 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.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:08,900 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 81 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:08,902 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-11 19:22:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:08,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2024-09-11 19:22:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:08,902 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:08,902 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-11 19:22:08,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:08,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:08,905 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2024-09-11 19:22:08,906 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2024-09-11 19:22:08,907 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2024-09-11 19:22:08,907 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-09-11 19:22:08,911 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:08,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:09,748 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:09,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:09 BoogieIcfgContainer [2024-09-11 19:22:09,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:09,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:09,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:09,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:09,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:02" (3/4) ... [2024-09-11 19:22:09,774 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:09,784 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:22:09,785 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:22:09,785 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:09,786 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:22:09,898 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:09,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:09,899 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:09,900 INFO L158 Benchmark]: Toolchain (without parser) took 8092.14ms. Allocated memory was 159.4MB in the beginning and 270.5MB in the end (delta: 111.1MB). Free memory was 103.0MB in the beginning and 118.9MB in the end (delta: -15.9MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,900 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:09,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.04ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 79.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.56ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 77.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,901 INFO L158 Benchmark]: Boogie Preprocessor took 46.53ms. Allocated memory is still 159.4MB. Free memory was 77.7MB in the beginning and 75.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,901 INFO L158 Benchmark]: RCFGBuilder took 570.47ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 75.3MB in the beginning and 185.4MB in the end (delta: -110.1MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,902 INFO L158 Benchmark]: TraceAbstraction took 6916.35ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 185.4MB in the beginning and 125.2MB in the end (delta: 60.2MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,902 INFO L158 Benchmark]: Witness Printer took 128.15ms. Allocated memory is still 270.5MB. Free memory was 125.2MB in the beginning and 118.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 19:22:09,903 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.28ms. Allocated memory is still 159.4MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.04ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 79.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.56ms. Allocated memory is still 159.4MB. Free memory was 79.9MB in the beginning and 77.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.53ms. Allocated memory is still 159.4MB. Free memory was 77.7MB in the beginning and 75.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 570.47ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 75.3MB in the beginning and 185.4MB in the end (delta: -110.1MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6916.35ms. Allocated memory was 224.4MB in the beginning and 270.5MB in the end (delta: 46.1MB). Free memory was 185.4MB in the beginning and 125.2MB in the end (delta: 60.2MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. * Witness Printer took 128.15ms. Allocated memory is still 270.5MB. Free memory was 125.2MB in the beginning and 118.9MB 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.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: 85]: 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: 97]: 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: 125]: 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: 145]: 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: 157]: 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: 177]: 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: 189]: 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: 214]: 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: 226]: 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: 243]: 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: 255]: 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: 272]: 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: 284]: 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: 296]: 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: 308]: 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: 374]: 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: 386]: 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 1 procedures, 80 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 732 mSDsluCounter, 3113 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2056 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1426 IncrementalHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 1057 mSDtfsCounter, 1426 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 203 SyntacticMatches, 19 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 128 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 786 ConstructedInterpolants, 0 QuantifiedInterpolants, 2246 SizeOfPredicates, 6 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 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 18 specifications checked. All of them hold - InvariantResult [Line: 162]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 13]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 131]: Location Invariant Derived location invariant: (((1 <= main__cp) && (((long long) main__cp + 2) <= main__urilen)) || ((1 <= main__cp) && (((long long) main__cp + 1) == main__urilen))) - InvariantResult [Line: 131]: Location Invariant Derived location invariant: ((((long long) main__cp + 1) <= main__urilen) && (1 <= main__cp)) - InvariantResult [Line: 262]: Location Invariant Derived location invariant: ((((1 <= main__c) && (1 <= main__cp)) && (((long long) main__cp + 2) <= main__urilen)) || (((1 <= main__cp) && (((long long) main__cp + 2) <= main__urilen)) && (main__c == 0))) - InvariantResult [Line: 232]: Location Invariant Derived location invariant: ((((long long) main__cp + 1) <= main__urilen) && (((1 <= main__c) && (1 <= main__cp)) || ((1 <= main__cp) && (main__c == 0)))) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:09,930 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE