./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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-get-tag.i.p+lhb-reducer.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:24:53,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:24:53,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:24:53,135 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:24:53,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:24:53,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:24:53,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:24:53,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:24:53,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:24:53,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:24:53,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:24:53,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:24:53,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:24:53,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:24:53,172 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:24:53,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:24:53,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:24:53,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:24:53,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:24:53,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:24:53,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:24:53,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:24:53,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:24:53,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:24:53,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:24:53,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:24:53,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:24:53,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:24:53,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:24:53,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:24:53,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:24:53,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:24:53,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:24:53,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:24:53,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:24:53,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:24:53,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:24:53,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:24:53,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:24:53,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:24:53,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:24:53,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:24:53,183 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:24:53,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:24:53,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:24:53,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:24:53,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:24:53,530 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:24:53,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2024-09-12 15:24:54,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:24:55,163 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:24:55,163 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2024-09-12 15:24:55,178 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a07cff8ea/a9c0cc883e5b490fb6e70bdc491fede1/FLAGac9d94e67 [2024-09-12 15:24:55,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a07cff8ea/a9c0cc883e5b490fb6e70bdc491fede1 [2024-09-12 15:24:55,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:24:55,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:24:55,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:24:55,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:24:55,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:24:55,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2392db77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55, skipping insertion in model container [2024-09-12 15:24:55,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:24:55,431 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-get-tag.i.p+lhb-reducer.c[919,932] [2024-09-12 15:24:55,438 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-get-tag.i.p+lhb-reducer.c[1134,1147] [2024-09-12 15:24:55,449 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-get-tag.i.p+lhb-reducer.c[2208,2221] [2024-09-12 15:24:55,450 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-get-tag.i.p+lhb-reducer.c[2423,2436] [2024-09-12 15:24:55,454 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-get-tag.i.p+lhb-reducer.c[2918,2931] [2024-09-12 15:24:55,457 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-get-tag.i.p+lhb-reducer.c[3133,3146] [2024-09-12 15:24:55,458 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-get-tag.i.p+lhb-reducer.c[3435,3448] [2024-09-12 15:24:55,461 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-get-tag.i.p+lhb-reducer.c[3653,3666] [2024-09-12 15:24:55,463 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-get-tag.i.p+lhb-reducer.c[3929,3942] [2024-09-12 15:24:55,465 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-get-tag.i.p+lhb-reducer.c[4147,4160] [2024-09-12 15:24:55,479 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-get-tag.i.p+lhb-reducer.c[4717,4730] [2024-09-12 15:24:55,484 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-get-tag.i.p+lhb-reducer.c[4935,4948] [2024-09-12 15:24:55,536 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-get-tag.i.p+lhb-reducer.c[15828,15841] [2024-09-12 15:24:55,540 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-get-tag.i.p+lhb-reducer.c[16046,16059] [2024-09-12 15:24:55,543 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-get-tag.i.p+lhb-reducer.c[16441,16454] [2024-09-12 15:24:55,545 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-get-tag.i.p+lhb-reducer.c[16659,16672] [2024-09-12 15:24:55,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:24:55,571 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:24:55,585 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-get-tag.i.p+lhb-reducer.c[919,932] [2024-09-12 15:24:55,586 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-get-tag.i.p+lhb-reducer.c[1134,1147] [2024-09-12 15:24:55,593 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-get-tag.i.p+lhb-reducer.c[2208,2221] [2024-09-12 15:24:55,595 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-get-tag.i.p+lhb-reducer.c[2423,2436] [2024-09-12 15:24:55,596 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-get-tag.i.p+lhb-reducer.c[2918,2931] [2024-09-12 15:24:55,598 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-get-tag.i.p+lhb-reducer.c[3133,3146] [2024-09-12 15:24:55,601 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-get-tag.i.p+lhb-reducer.c[3435,3448] [2024-09-12 15:24:55,602 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-get-tag.i.p+lhb-reducer.c[3653,3666] [2024-09-12 15:24:55,607 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-get-tag.i.p+lhb-reducer.c[3929,3942] [2024-09-12 15:24:55,607 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-get-tag.i.p+lhb-reducer.c[4147,4160] [2024-09-12 15:24:55,609 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-get-tag.i.p+lhb-reducer.c[4717,4730] [2024-09-12 15:24:55,612 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-get-tag.i.p+lhb-reducer.c[4935,4948] [2024-09-12 15:24:55,640 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-get-tag.i.p+lhb-reducer.c[15828,15841] [2024-09-12 15:24:55,645 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-get-tag.i.p+lhb-reducer.c[16046,16059] [2024-09-12 15:24:55,647 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-get-tag.i.p+lhb-reducer.c[16441,16454] [2024-09-12 15:24:55,648 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-get-tag.i.p+lhb-reducer.c[16659,16672] [2024-09-12 15:24:55,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:24:55,682 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:24:55,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55 WrapperNode [2024-09-12 15:24:55,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:24:55,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:24:55,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:24:55,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:24:55,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,715 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:24:55,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:24:55,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:24:55,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:24:55,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:24:55,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,774 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-12 15:24:55,774 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,787 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:24:55,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:24:55,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:24:55,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:24:55,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (1/1) ... [2024-09-12 15:24:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:24:55,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:24:55,849 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-12 15:24:55,856 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-12 15:24:55,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:24:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:24:55,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:24:55,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:24:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:24:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:24:55,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:24:55,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:24:56,005 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:24:56,007 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:24:56,531 INFO L? ?]: Removed 218 outVars from TransFormulas that were not future-live. [2024-09-12 15:24:56,531 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:24:56,554 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:24:56,556 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 15:24:56,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:24:56 BoogieIcfgContainer [2024-09-12 15:24:56,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:24:56,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:24:56,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:24:56,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:24:56,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:24:55" (1/3) ... [2024-09-12 15:24:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da1c925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:24:56, skipping insertion in model container [2024-09-12 15:24:56,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:24:55" (2/3) ... [2024-09-12 15:24:56,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da1c925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:24:56, skipping insertion in model container [2024-09-12 15:24:56,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:24:56" (3/3) ... [2024-09-12 15:24:56,566 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2024-09-12 15:24:56,581 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:24:56,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-12 15:24:56,640 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:24:56,647 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;@14dc802e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:24:56,648 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-12 15:24:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:24:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 15:24:56,659 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:56,659 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:56,660 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:56,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash 814642412, now seen corresponding path program 1 times [2024-09-12 15:24:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:56,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498336823] [2024-09-12 15:24:56,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:56,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:57,011 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-12 15:24:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:57,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498336823] [2024-09-12 15:24:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498336823] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:24:57,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314542847] [2024-09-12 15:24:57,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:57,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:24:57,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:57,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:24:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:24:57,052 INFO L87 Difference]: Start difference. First operand has 124 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:57,542 INFO L93 Difference]: Finished difference Result 136 states and 214 transitions. [2024-09-12 15:24:57,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:24:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 15:24:57,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:57,553 INFO L225 Difference]: With dead ends: 136 [2024-09-12 15:24:57,553 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 15:24:57,556 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:24:57,559 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 242 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:57,559 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 105 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 15:24:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 15:24:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-09-12 15:24:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 113 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2024-09-12 15:24:57,622 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 10 [2024-09-12 15:24:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:57,622 INFO L474 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2024-09-12 15:24:57,623 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:57,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2024-09-12 15:24:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:24:57,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:57,625 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:57,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:24:57,626 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:57,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash -515885943, now seen corresponding path program 1 times [2024-09-12 15:24:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795276520] [2024-09-12 15:24:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:57,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:57,793 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-12 15:24:57,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795276520] [2024-09-12 15:24:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795276520] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:24:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293532181] [2024-09-12 15:24:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:57,796 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:24:57,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:24:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:24:57,799 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:58,140 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2024-09-12 15:24:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:24:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:24:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:58,143 INFO L225 Difference]: With dead ends: 120 [2024-09-12 15:24:58,143 INFO L226 Difference]: Without dead ends: 112 [2024-09-12 15:24:58,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:24:58,144 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:58,145 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 148 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 15:24:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-12 15:24:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-09-12 15:24:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 108 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-09-12 15:24:58,182 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 11 [2024-09-12 15:24:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:58,184 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-09-12 15:24:58,184 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-09-12 15:24:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:24:58,186 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:58,186 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:58,186 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:24:58,186 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:58,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:58,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1762372468, now seen corresponding path program 1 times [2024-09-12 15:24:58,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:58,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508750543] [2024-09-12 15:24:58,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:58,330 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:58,340 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-12 15:24:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508750543] [2024-09-12 15:24:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508750543] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:24:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363705519] [2024-09-12 15:24:58,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:58,344 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:24:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:58,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:24:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:24:58,347 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:58,660 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-09-12 15:24:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:24:58,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 15:24:58,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:58,663 INFO L225 Difference]: With dead ends: 112 [2024-09-12 15:24:58,663 INFO L226 Difference]: Without dead ends: 110 [2024-09-12 15:24:58,663 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:24:58,664 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 136 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:58,665 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 115 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:24:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-09-12 15:24:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-09-12 15:24:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 106 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-09-12 15:24:58,699 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 14 [2024-09-12 15:24:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:58,700 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-09-12 15:24:58,700 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:58,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-09-12 15:24:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:24:58,701 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:58,701 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:58,701 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:24:58,702 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:58,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1201025248, now seen corresponding path program 1 times [2024-09-12 15:24:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:58,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436208661] [2024-09-12 15:24:58,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:58,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:58,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:58,784 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-12 15:24:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436208661] [2024-09-12 15:24:58,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436208661] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:58,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:58,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:24:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527408311] [2024-09-12 15:24:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:58,786 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:24:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:24:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:24:58,787 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:59,046 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2024-09-12 15:24:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:24:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:24:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:59,048 INFO L225 Difference]: With dead ends: 110 [2024-09-12 15:24:59,049 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 15:24:59,050 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-12 15:24:59,050 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 62 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:59,051 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:24:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 15:24:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-09-12 15:24:59,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 102 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-09-12 15:24:59,084 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 15 [2024-09-12 15:24:59,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:59,086 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-09-12 15:24:59,086 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-09-12 15:24:59,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:24:59,093 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:59,093 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:59,094 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:24:59,094 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:59,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1436191013, now seen corresponding path program 1 times [2024-09-12 15:24:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:59,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444905180] [2024-09-12 15:24:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:59,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:59,210 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-12 15:24:59,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444905180] [2024-09-12 15:24:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444905180] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:59,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:59,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:24:59,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050260930] [2024-09-12 15:24:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:59,213 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:24:59,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:59,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:24:59,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:24:59,214 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:59,496 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-09-12 15:24:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:24:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:24:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:59,498 INFO L225 Difference]: With dead ends: 106 [2024-09-12 15:24:59,499 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 15:24:59,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:24:59,500 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:59,500 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 101 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:24:59,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 15:24:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-09-12 15:24:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 100 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-09-12 15:24:59,532 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16 [2024-09-12 15:24:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:59,533 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-09-12 15:24:59,533 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-09-12 15:24:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:24:59,534 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:59,534 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:59,535 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 15:24:59,535 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:59,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1437730213, now seen corresponding path program 1 times [2024-09-12 15:24:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:59,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851522233] [2024-09-12 15:24:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:59,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:59,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:24:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:24:59,634 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-12 15:24:59,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:24:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851522233] [2024-09-12 15:24:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851522233] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:24:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:24:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:24:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910542498] [2024-09-12 15:24:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:24:59,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:24:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:24:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:24:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:24:59,637 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:24:59,910 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-09-12 15:24:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:24:59,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:24:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:24:59,912 INFO L225 Difference]: With dead ends: 104 [2024-09-12 15:24:59,912 INFO L226 Difference]: Without dead ends: 102 [2024-09-12 15:24:59,912 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:24:59,913 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 129 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:24:59,913 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 95 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:24:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-12 15:24:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-12 15:24:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 89 states have (on average 1.247191011235955) internal successors, (111), 98 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-09-12 15:24:59,931 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 16 [2024-09-12 15:24:59,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:24:59,931 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-09-12 15:24:59,931 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:24:59,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-09-12 15:24:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:24:59,932 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:24:59,932 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:24:59,932 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 15:24:59,933 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:24:59,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:24:59,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1572251555, now seen corresponding path program 1 times [2024-09-12 15:24:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:24:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136504500] [2024-09-12 15:24:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:24:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:24:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,078 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-12 15:25:00,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136504500] [2024-09-12 15:25:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136504500] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:00,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:00,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563724723] [2024-09-12 15:25:00,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:00,079 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:00,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:00,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:00,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:00,080 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:00,410 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-09-12 15:25:00,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:00,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:00,411 INFO L225 Difference]: With dead ends: 119 [2024-09-12 15:25:00,411 INFO L226 Difference]: Without dead ends: 117 [2024-09-12 15:25:00,412 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:00,413 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 77 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:00,413 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 136 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-09-12 15:25:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-09-12 15:25:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-09-12 15:25:00,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 17 [2024-09-12 15:25:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:00,450 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-09-12 15:25:00,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-09-12 15:25:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:25:00,452 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:00,452 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:00,452 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 15:25:00,453 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:00,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:00,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1573616975, now seen corresponding path program 1 times [2024-09-12 15:25:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:00,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143800286] [2024-09-12 15:25:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,548 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,553 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-12 15:25:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143800286] [2024-09-12 15:25:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143800286] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 15:25:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220587992] [2024-09-12 15:25:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:00,554 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:25:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:00,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:25:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:25:00,555 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:00,827 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-09-12 15:25:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 15:25:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:00,829 INFO L225 Difference]: With dead ends: 108 [2024-09-12 15:25:00,829 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 15:25:00,829 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:25:00,830 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 126 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:00,830 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 89 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 15:25:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-09-12 15:25:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-09-12 15:25:00,846 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2024-09-12 15:25:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:00,847 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-09-12 15:25:00,847 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:00,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-09-12 15:25:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 15:25:00,848 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:00,848 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:00,848 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 15:25:00,849 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:00,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1619966805, now seen corresponding path program 1 times [2024-09-12 15:25:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664603005] [2024-09-12 15:25:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,980 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:00,983 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-12 15:25:00,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:00,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664603005] [2024-09-12 15:25:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664603005] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:00,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907917423] [2024-09-12 15:25:00,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:00,984 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:00,985 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:01,295 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-09-12 15:25:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:01,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 15:25:01,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:01,297 INFO L225 Difference]: With dead ends: 116 [2024-09-12 15:25:01,297 INFO L226 Difference]: Without dead ends: 112 [2024-09-12 15:25:01,297 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:01,298 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:01,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 128 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-12 15:25:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-09-12 15:25:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-09-12 15:25:01,312 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 17 [2024-09-12 15:25:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:01,312 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-09-12 15:25:01,313 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-09-12 15:25:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 15:25:01,314 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:01,314 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-12 15:25:01,314 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 15:25:01,314 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:01,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1537489112, now seen corresponding path program 1 times [2024-09-12 15:25:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010491702] [2024-09-12 15:25:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:01,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,435 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-12 15:25:01,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:01,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010491702] [2024-09-12 15:25:01,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010491702] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:01,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:01,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:01,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193424065] [2024-09-12 15:25:01,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:01,436 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:01,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:01,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:01,438 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:01,781 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-09-12 15:25:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 15:25:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:01,782 INFO L225 Difference]: With dead ends: 112 [2024-09-12 15:25:01,782 INFO L226 Difference]: Without dead ends: 110 [2024-09-12 15:25:01,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:01,783 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 67 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:01,783 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 159 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 15:25:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-09-12 15:25:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-09-12 15:25:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 106 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-09-12 15:25:01,798 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 18 [2024-09-12 15:25:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:01,798 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-09-12 15:25:01,799 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:01,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-09-12 15:25:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 15:25:01,803 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:01,804 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:01,805 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 15:25:01,805 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:01,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash -894647034, now seen corresponding path program 1 times [2024-09-12 15:25:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246789668] [2024-09-12 15:25:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:01,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:01,901 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-12 15:25:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:01,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246789668] [2024-09-12 15:25:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246789668] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:01,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007951529] [2024-09-12 15:25:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:01,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:01,903 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,105 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-09-12 15:25:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:02,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-12 15:25:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,106 INFO L225 Difference]: With dead ends: 110 [2024-09-12 15:25:02,106 INFO L226 Difference]: Without dead ends: 108 [2024-09-12 15:25:02,107 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-12 15:25:02,107 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 143 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,107 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 76 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-12 15:25:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-09-12 15:25:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 104 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-09-12 15:25:02,121 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 19 [2024-09-12 15:25:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,122 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-09-12 15:25:02,122 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-09-12 15:25:02,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 15:25:02,123 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,123 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] [2024-09-12 15:25:02,123 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 15:25:02,124 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:02,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1964251151, now seen corresponding path program 1 times [2024-09-12 15:25:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524649112] [2024-09-12 15:25:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,189 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-12 15:25:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524649112] [2024-09-12 15:25:02,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524649112] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:25:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404731081] [2024-09-12 15:25:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:25:02,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:25:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:25:02,192 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,402 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-09-12 15:25:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:25:02,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 15:25:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,403 INFO L225 Difference]: With dead ends: 108 [2024-09-12 15:25:02,403 INFO L226 Difference]: Without dead ends: 104 [2024-09-12 15:25:02,404 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-12 15:25:02,404 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,404 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 106 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-12 15:25:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-09-12 15:25:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-09-12 15:25:02,428 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 20 [2024-09-12 15:25:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,428 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-09-12 15:25:02,428 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-09-12 15:25:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:02,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,431 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-12 15:25:02,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-12 15:25:02,431 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:02,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1590454791, now seen corresponding path program 1 times [2024-09-12 15:25:02,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069599369] [2024-09-12 15:25:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,571 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-12 15:25:02,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069599369] [2024-09-12 15:25:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069599369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844493446] [2024-09-12 15:25:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:02,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:02,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:02,573 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:02,822 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-09-12 15:25:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:02,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 15:25:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:02,823 INFO L225 Difference]: With dead ends: 104 [2024-09-12 15:25:02,823 INFO L226 Difference]: Without dead ends: 102 [2024-09-12 15:25:02,824 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:02,824 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 182 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:02,824 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 62 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-12 15:25:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-09-12 15:25:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2024-09-12 15:25:02,838 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 21 [2024-09-12 15:25:02,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:02,838 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2024-09-12 15:25:02,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:02,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2024-09-12 15:25:02,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:02,839 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:02,840 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-12 15:25:02,840 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-12 15:25:02,840 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:02,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1542739541, now seen corresponding path program 1 times [2024-09-12 15:25:02,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:02,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095844318] [2024-09-12 15:25:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:02,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:02,957 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-12 15:25:02,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:02,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095844318] [2024-09-12 15:25:02,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095844318] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:02,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:02,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:02,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513030013] [2024-09-12 15:25:02,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:02,958 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:02,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:02,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:02,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:02,959 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,199 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2024-09-12 15:25:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 15:25:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,200 INFO L225 Difference]: With dead ends: 100 [2024-09-12 15:25:03,200 INFO L226 Difference]: Without dead ends: 96 [2024-09-12 15:25:03,201 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:25:03,201 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 182 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,202 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 52 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-12 15:25:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-09-12 15:25:03,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-09-12 15:25:03,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 21 [2024-09-12 15:25:03,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,218 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-09-12 15:25:03,218 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-09-12 15:25:03,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:25:03,220 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,221 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-12 15:25:03,221 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 15:25:03,221 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:03,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,221 INFO L85 PathProgramCache]: Analyzing trace with hash -749003270, now seen corresponding path program 1 times [2024-09-12 15:25:03,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82677340] [2024-09-12 15:25:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,318 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-12 15:25:03,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82677340] [2024-09-12 15:25:03,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82677340] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078233331] [2024-09-12 15:25:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:03,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:03,320 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:03,553 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-09-12 15:25:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 15:25:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:03,554 INFO L225 Difference]: With dead ends: 96 [2024-09-12 15:25:03,554 INFO L226 Difference]: Without dead ends: 57 [2024-09-12 15:25:03,555 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:03,555 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 231 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:03,555 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 43 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:25:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-12 15:25:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-12 15:25:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.08) internal successors, (54), 53 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-09-12 15:25:03,565 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 21 [2024-09-12 15:25:03,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:03,565 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-09-12 15:25:03,565 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:03,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-09-12 15:25:03,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 15:25:03,566 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:03,566 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:03,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 15:25:03,567 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:03,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:03,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1215413267, now seen corresponding path program 1 times [2024-09-12 15:25:03,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:03,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508208060] [2024-09-12 15:25:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:03,809 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-12 15:25:03,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508208060] [2024-09-12 15:25:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508208060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:03,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-12 15:25:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975858676] [2024-09-12 15:25:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:03,812 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 15:25:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:03,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 15:25:03,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:25:03,813 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,071 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2024-09-12 15:25:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 15:25:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-09-12 15:25:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,072 INFO L225 Difference]: With dead ends: 57 [2024-09-12 15:25:04,072 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 15:25:04,073 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-09-12 15:25:04,073 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,073 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 40 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 15:25:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-12 15:25:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2024-09-12 15:25:04,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 47 [2024-09-12 15:25:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,083 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2024-09-12 15:25:04,083 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2024-09-12 15:25:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 15:25:04,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,084 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,084 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 15:25:04,084 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:04,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1215399365, now seen corresponding path program 1 times [2024-09-12 15:25:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034492801] [2024-09-12 15:25:04,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,319 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-12 15:25:04,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034492801] [2024-09-12 15:25:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034492801] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-12 15:25:04,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661976398] [2024-09-12 15:25:04,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 15:25:04,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 15:25:04,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-09-12 15:25:04,321 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,602 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2024-09-12 15:25:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 15:25:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-09-12 15:25:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,603 INFO L225 Difference]: With dead ends: 55 [2024-09-12 15:25:04,603 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 15:25:04,603 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2024-09-12 15:25:04,604 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 34 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 15:25:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 15:25:04,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-09-12 15:25:04,613 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2024-09-12 15:25:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,614 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-09-12 15:25:04,614 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,617 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-09-12 15:25:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 15:25:04,617 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,617 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-12 15:25:04,618 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:04,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash -976890969, now seen corresponding path program 1 times [2024-09-12 15:25:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005379576] [2024-09-12 15:25:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:04,787 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-12 15:25:04,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:04,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005379576] [2024-09-12 15:25:04,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005379576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:04,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:04,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531674227] [2024-09-12 15:25:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:04,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:04,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:04,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:04,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:04,789 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:04,932 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-09-12 15:25:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-12 15:25:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:04,933 INFO L225 Difference]: With dead ends: 53 [2024-09-12 15:25:04,933 INFO L226 Difference]: Without dead ends: 51 [2024-09-12 15:25:04,934 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:04,934 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 114 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:04,934 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 20 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-12 15:25:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-12 15:25:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-12 15:25:04,942 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2024-09-12 15:25:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:04,942 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-12 15:25:04,943 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:04,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-12 15:25:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-12 15:25:04,943 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:25:04,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:25:04,943 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 15:25:04,944 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-09-12 15:25:04,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash -977321945, now seen corresponding path program 1 times [2024-09-12 15:25:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:25:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178440822] [2024-09-12 15:25:04,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:25:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:25:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:25:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:25:05,082 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-12 15:25:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:25:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178440822] [2024-09-12 15:25:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178440822] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:25:05,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:25:05,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 15:25:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656351639] [2024-09-12 15:25:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:25:05,083 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:25:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:25:05,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:25:05,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:25:05,084 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:25:05,212 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-09-12 15:25:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:25:05,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-12 15:25:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:25:05,213 INFO L225 Difference]: With dead ends: 51 [2024-09-12 15:25:05,214 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:25:05,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:25:05,215 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 108 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:25:05,215 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 16 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:25:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:25:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:25:05,215 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-12 15:25:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:25:05,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-09-12 15:25:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:25:05,216 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:25:05,216 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:25:05,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:25:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:25:05,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:25:05,219 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-12 15:25:05,219 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-12 15:25:05,220 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-12 15:25:05,221 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-12 15:25:05,222 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-12 15:25:05,222 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-12 15:25:05,222 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 15:25:05,225 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] [2024-09-12 15:25:05,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:25:06,537 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:25:06,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:25:06 BoogieIcfgContainer [2024-09-12 15:25:06,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:25:06,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:25:06,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:25:06,554 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:25:06,555 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:24:56" (3/4) ... [2024-09-12 15:25:06,556 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:25:06,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:25:06,559 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:25:06,574 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-09-12 15:25:06,575 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-12 15:25:06,576 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 15:25:06,576 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:25:06,703 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:25:06,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:25:06,704 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:25:06,704 INFO L158 Benchmark]: Toolchain (without parser) took 11501.42ms. Allocated memory was 75.5MB in the beginning and 195.0MB in the end (delta: 119.5MB). Free memory was 45.4MB in the beginning and 157.2MB in the end (delta: -111.7MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,704 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:25:06,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.27ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 43.4MB in the end (delta: 1.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.65ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 41.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,705 INFO L158 Benchmark]: Boogie Preprocessor took 91.40ms. Allocated memory is still 75.5MB. Free memory was 41.5MB in the beginning and 38.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,706 INFO L158 Benchmark]: RCFGBuilder took 745.49ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.8MB in the beginning and 65.2MB in the end (delta: -27.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,706 INFO L158 Benchmark]: TraceAbstraction took 9994.17ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 64.6MB in the beginning and 167.6MB in the end (delta: -103.0MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,706 INFO L158 Benchmark]: Witness Printer took 150.35ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 157.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 15:25:06,708 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 48.2MB. Free memory was 28.8MB in the beginning and 28.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.27ms. Allocated memory is still 75.5MB. Free memory was 45.2MB in the beginning and 43.4MB in the end (delta: 1.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.65ms. Allocated memory is still 75.5MB. Free memory was 43.4MB in the beginning and 41.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.40ms. Allocated memory is still 75.5MB. Free memory was 41.5MB in the beginning and 38.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 745.49ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 37.8MB in the beginning and 65.2MB in the end (delta: -27.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9994.17ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 64.6MB in the beginning and 167.6MB in the end (delta: -103.0MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * Witness Printer took 150.35ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 157.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 36]: 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: 48]: 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: 105]: 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: 117]: 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: 173]: 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: 185]: 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: 207]: 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: 219]: 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: 257]: 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: 269]: 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: 883]: 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: 895]: 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: 919]: 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: 931]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 1661 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1111 mSDsCounter, 328 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5305 IncrementalHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 328 mSolverCounterUnsat, 550 mSDtfsCounter, 5305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 1441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Location Invariant Derived location invariant: ((((long long) main__t + 1) <= main__tagbuf_len) && (1 <= main__t)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((1 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 858]: Location Invariant Derived location invariant: ((9 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 26]: Location Invariant Derived location invariant: ((0 <= main__t) && (main__t <= main__tagbuf_len)) - InvariantResult [Line: 22]: Location Invariant Derived location invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-09-12 15:25:06,737 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE