./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 1d5fa637 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-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-1d5fa63-m [2024-09-13 08:43:40,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 08:43:40,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 08:43:40,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 08:43:40,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 08:43:40,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 08:43:40,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 08:43:40,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 08:43:40,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 08:43:40,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 08:43:40,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 08:43:40,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 08:43:40,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 08:43:40,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 08:43:40,776 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 08:43:40,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 08:43:40,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 08:43:40,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 08:43:40,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 08:43:40,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 08:43:40,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 08:43:40,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 08:43:40,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 08:43:40,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 08:43:40,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 08:43:40,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 08:43:40,779 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 08:43:40,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 08:43:40,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 08:43:40,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 08:43:40,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 08:43:40,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 08:43:40,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 08:43:40,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 08:43:40,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 08:43:40,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 08:43:40,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 08:43:40,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 08:43:40,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 08:43:40,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 08:43:40,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 08:43:40,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 08:43:40,784 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-13 08:43:40,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 08:43:41,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 08:43:41,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 08:43:41,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 08:43:41,033 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 08:43:41,035 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-13 08:43:42,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 08:43:42,564 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 08:43:42,564 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2024-09-13 08:43:42,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ea8e8c208/b4e5774819f241c29988773ed071b3a8/FLAG65a9a294b [2024-09-13 08:43:42,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ea8e8c208/b4e5774819f241c29988773ed071b3a8 [2024-09-13 08:43:42,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 08:43:42,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 08:43:42,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 08:43:42,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 08:43:42,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 08:43:42,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 08:43:42" (1/1) ... [2024-09-13 08:43:42,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faf36b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:42, skipping insertion in model container [2024-09-13 08:43:42,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 08:43:42" (1/1) ... [2024-09-13 08:43:42,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 08:43:42,832 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-13 08:43:42,837 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-13 08:43:42,841 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-13 08:43:42,844 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-13 08:43:42,846 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-13 08:43:42,847 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-13 08:43:42,850 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-13 08:43:42,852 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-13 08:43:42,854 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-13 08:43:42,857 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-13 08:43:42,860 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-13 08:43:42,861 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-13 08:43:42,893 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-13 08:43:42,895 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-13 08:43:42,898 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-13 08:43:42,902 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-13 08:43:42,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 08:43:42,933 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 08:43:42,943 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-13 08:43:42,944 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-13 08:43:42,946 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-13 08:43:42,947 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-13 08:43:42,948 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-13 08:43:42,949 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-13 08:43:42,950 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-13 08:43:42,951 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-13 08:43:42,952 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-13 08:43:42,953 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-13 08:43:42,955 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-13 08:43:42,956 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-13 08:43:42,991 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-13 08:43:42,993 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-13 08:43:42,994 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-13 08:43:42,995 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-13 08:43:42,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 08:43:43,010 INFO L204 MainTranslator]: Completed translation [2024-09-13 08:43:43,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43 WrapperNode [2024-09-13 08:43:43,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 08:43:43,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 08:43:43,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 08:43:43,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 08:43:43,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,031 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,036 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 08:43:43,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 08:43:43,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 08:43:43,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 08:43:43,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 08:43:43,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,087 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-13 08:43:43,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 08:43:43,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 08:43:43,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 08:43:43,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 08:43:43,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (1/1) ... [2024-09-13 08:43:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 08:43:43,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 08:43:43,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-13 08:43:43,173 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-13 08:43:43,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 08:43:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 08:43:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 08:43:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 08:43:43,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 08:43:43,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 08:43:43,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 08:43:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 08:43:43,293 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 08:43:43,295 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 08:43:43,678 INFO L? ?]: Removed 218 outVars from TransFormulas that were not future-live. [2024-09-13 08:43:43,679 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 08:43:43,698 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 08:43:43,700 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 08:43:43,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:43 BoogieIcfgContainer [2024-09-13 08:43:43,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 08:43:43,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 08:43:43,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 08:43:43,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 08:43:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 08:43:42" (1/3) ... [2024-09-13 08:43:43,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36db347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 08:43:43, skipping insertion in model container [2024-09-13 08:43:43,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 08:43:43" (2/3) ... [2024-09-13 08:43:43,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36db347b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 08:43:43, skipping insertion in model container [2024-09-13 08:43:43,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:43" (3/3) ... [2024-09-13 08:43:43,716 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2024-09-13 08:43:43,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 08:43:43,750 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-09-13 08:43:43,810 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 08:43:43,815 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;@5372e2d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 08:43:43,815 INFO L337 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-09-13 08:43:43,823 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-13 08:43:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-13 08:43:43,830 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:43,831 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:43,831 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-13 08:43:43,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 814642412, now seen corresponding path program 1 times [2024-09-13 08:43:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012382011] [2024-09-13 08:43:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:44,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012382011] [2024-09-13 08:43:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012382011] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 08:43:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964075836] [2024-09-13 08:43:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:44,180 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 08:43:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 08:43:44,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:44,197 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-13 08:43:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:44,546 INFO L93 Difference]: Finished difference Result 136 states and 214 transitions. [2024-09-13 08:43:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:44,548 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-13 08:43:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:44,555 INFO L225 Difference]: With dead ends: 136 [2024-09-13 08:43:44,555 INFO L226 Difference]: Without dead ends: 122 [2024-09-13 08:43:44,558 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-13 08:43:44,561 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 242 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:44,564 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.3s Time] [2024-09-13 08:43:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-13 08:43:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-09-13 08:43:44,615 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-13 08:43:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2024-09-13 08:43:44,619 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 10 [2024-09-13 08:43:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:44,620 INFO L474 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2024-09-13 08:43:44,621 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-13 08:43:44,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2024-09-13 08:43:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-13 08:43:44,622 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:44,623 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:44,623 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 08:43:44,623 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-13 08:43:44,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:44,623 INFO L85 PathProgramCache]: Analyzing trace with hash -515885943, now seen corresponding path program 1 times [2024-09-13 08:43:44,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:44,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453638114] [2024-09-13 08:43:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:44,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:44,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:44,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:44,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:44,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453638114] [2024-09-13 08:43:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453638114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:44,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:44,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 08:43:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977705267] [2024-09-13 08:43:44,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:44,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 08:43:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 08:43:44,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-13 08:43:44,784 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-13 08:43:45,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:45,061 INFO L93 Difference]: Finished difference Result 120 states and 141 transitions. [2024-09-13 08:43:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:45,062 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-13 08:43:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:45,063 INFO L225 Difference]: With dead ends: 120 [2024-09-13 08:43:45,064 INFO L226 Difference]: Without dead ends: 112 [2024-09-13 08:43:45,064 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-13 08:43:45,065 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.2s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:45,065 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.2s Time] [2024-09-13 08:43:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-13 08:43:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-09-13 08:43:45,086 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-13 08:43:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-09-13 08:43:45,091 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 11 [2024-09-13 08:43:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:45,091 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-09-13 08:43:45,091 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-13 08:43:45,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-09-13 08:43:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-13 08:43:45,092 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:45,092 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:45,092 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 08:43:45,093 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-13 08:43:45,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1762372468, now seen corresponding path program 1 times [2024-09-13 08:43:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602944426] [2024-09-13 08:43:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602944426] [2024-09-13 08:43:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602944426] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:45,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 08:43:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445649794] [2024-09-13 08:43:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:45,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 08:43:45,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 08:43:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 08:43:45,247 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-13 08:43:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:45,489 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-09-13 08:43:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:45,489 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-13 08:43:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:45,491 INFO L225 Difference]: With dead ends: 112 [2024-09-13 08:43:45,492 INFO L226 Difference]: Without dead ends: 110 [2024-09-13 08:43:45,492 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-13 08:43:45,493 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-13 08:43:45,493 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-13 08:43:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-09-13 08:43:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-09-13 08:43:45,512 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-13 08:43:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-09-13 08:43:45,514 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 14 [2024-09-13 08:43:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:45,515 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-09-13 08:43:45,515 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-13 08:43:45,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-09-13 08:43:45,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-13 08:43:45,517 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:45,518 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:45,518 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 08:43:45,518 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-13 08:43:45,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1201025248, now seen corresponding path program 1 times [2024-09-13 08:43:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:45,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683288476] [2024-09-13 08:43:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:45,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:45,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683288476] [2024-09-13 08:43:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683288476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 08:43:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013399811] [2024-09-13 08:43:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:45,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 08:43:45,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 08:43:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:45,604 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-13 08:43:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:45,795 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2024-09-13 08:43:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 08:43:45,795 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-13 08:43:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:45,796 INFO L225 Difference]: With dead ends: 110 [2024-09-13 08:43:45,796 INFO L226 Difference]: Without dead ends: 106 [2024-09-13 08:43:45,797 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-13 08:43:45,797 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 62 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 08:43:45,797 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-13 08:43:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-13 08:43:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-09-13 08:43:45,817 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-13 08:43:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-09-13 08:43:45,818 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 15 [2024-09-13 08:43:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:45,818 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-09-13 08:43:45,818 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-13 08:43:45,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-09-13 08:43:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 08:43:45,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:45,819 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:45,819 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 08:43:45,819 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-13 08:43:45,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1436191013, now seen corresponding path program 1 times [2024-09-13 08:43:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993980718] [2024-09-13 08:43:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993980718] [2024-09-13 08:43:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993980718] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:45,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 08:43:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109910935] [2024-09-13 08:43:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:45,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 08:43:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 08:43:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 08:43:45,913 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-13 08:43:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:46,209 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-09-13 08:43:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:46,210 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-13 08:43:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:46,211 INFO L225 Difference]: With dead ends: 106 [2024-09-13 08:43:46,211 INFO L226 Difference]: Without dead ends: 104 [2024-09-13 08:43:46,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-13 08:43:46,212 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-13 08:43:46,212 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-13 08:43:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-13 08:43:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-09-13 08:43:46,222 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-13 08:43:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2024-09-13 08:43:46,222 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 16 [2024-09-13 08:43:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:46,222 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2024-09-13 08:43:46,223 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-13 08:43:46,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2024-09-13 08:43:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-13 08:43:46,223 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:46,223 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:46,224 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 08:43:46,224 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-13 08:43:46,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1437730213, now seen corresponding path program 1 times [2024-09-13 08:43:46,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:46,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899009978] [2024-09-13 08:43:46,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:46,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:46,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:46,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:46,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899009978] [2024-09-13 08:43:46,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899009978] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:46,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:46,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 08:43:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681180932] [2024-09-13 08:43:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:46,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 08:43:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 08:43:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 08:43:46,278 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-13 08:43:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:46,493 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2024-09-13 08:43:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:46,494 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-13 08:43:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:46,495 INFO L225 Difference]: With dead ends: 104 [2024-09-13 08:43:46,495 INFO L226 Difference]: Without dead ends: 102 [2024-09-13 08:43:46,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-13 08:43:46,496 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 129 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 08:43:46,496 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-13 08:43:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-13 08:43:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-13 08:43:46,505 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-13 08:43:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-09-13 08:43:46,506 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 16 [2024-09-13 08:43:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:46,506 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-09-13 08:43:46,506 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-13 08:43:46,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-09-13 08:43:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 08:43:46,507 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:46,507 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:46,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 08:43:46,508 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-13 08:43:46,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1572251555, now seen corresponding path program 1 times [2024-09-13 08:43:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853025246] [2024-09-13 08:43:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:46,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:46,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:46,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853025246] [2024-09-13 08:43:46,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853025246] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:46,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:46,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290892993] [2024-09-13 08:43:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:46,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:46,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:46,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:46,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:46,609 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-13 08:43:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:46,964 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2024-09-13 08:43:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:46,965 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-13 08:43:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:46,966 INFO L225 Difference]: With dead ends: 119 [2024-09-13 08:43:46,966 INFO L226 Difference]: Without dead ends: 117 [2024-09-13 08:43:46,966 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-13 08:43:46,966 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:46,967 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.3s Time] [2024-09-13 08:43:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-09-13 08:43:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-09-13 08:43:46,983 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-13 08:43:46,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-09-13 08:43:46,983 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 17 [2024-09-13 08:43:46,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:46,984 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-09-13 08:43:46,984 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-13 08:43:46,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,984 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-09-13 08:43:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 08:43:46,985 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:46,985 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:46,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 08:43:46,985 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-13 08:43:46,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1573616975, now seen corresponding path program 1 times [2024-09-13 08:43:46,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:46,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726714606] [2024-09-13 08:43:46,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:46,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:47,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:47,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726714606] [2024-09-13 08:43:47,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726714606] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:47,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:47,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 08:43:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981677363] [2024-09-13 08:43:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:47,067 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 08:43:47,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:47,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 08:43:47,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-13 08:43:47,070 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-13 08:43:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:47,446 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-09-13 08:43:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 08:43:47,446 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-13 08:43:47,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:47,447 INFO L225 Difference]: With dead ends: 108 [2024-09-13 08:43:47,447 INFO L226 Difference]: Without dead ends: 106 [2024-09-13 08:43:47,447 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-13 08:43:47,448 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 126 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:47,449 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.3s Time] [2024-09-13 08:43:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-13 08:43:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-09-13 08:43:47,462 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-13 08:43:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2024-09-13 08:43:47,463 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 17 [2024-09-13 08:43:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:47,463 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2024-09-13 08:43:47,463 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-13 08:43:47,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:47,463 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2024-09-13 08:43:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 08:43:47,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:47,464 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 08:43:47,464 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 08:43:47,464 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-13 08:43:47,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1619966805, now seen corresponding path program 1 times [2024-09-13 08:43:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:47,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574916296] [2024-09-13 08:43:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:47,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574916296] [2024-09-13 08:43:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574916296] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180579195] [2024-09-13 08:43:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:47,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:47,625 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-13 08:43:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:48,069 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2024-09-13 08:43:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:48,070 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-13 08:43:48,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:48,071 INFO L225 Difference]: With dead ends: 116 [2024-09-13 08:43:48,071 INFO L226 Difference]: Without dead ends: 112 [2024-09-13 08:43:48,071 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-13 08:43:48,071 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 73 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:48,072 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.4s Time] [2024-09-13 08:43:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-13 08:43:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2024-09-13 08:43:48,079 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-13 08:43:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-09-13 08:43:48,080 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 17 [2024-09-13 08:43:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:48,080 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-09-13 08:43:48,080 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-13 08:43:48,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-09-13 08:43:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-13 08:43:48,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:48,081 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-13 08:43:48,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-13 08:43:48,082 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-13 08:43:48,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1537489112, now seen corresponding path program 1 times [2024-09-13 08:43:48,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:48,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192834387] [2024-09-13 08:43:48,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:48,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:48,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192834387] [2024-09-13 08:43:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192834387] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193125987] [2024-09-13 08:43:48,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:48,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:48,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:48,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:48,230 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-13 08:43:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:48,533 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-09-13 08:43:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:48,534 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-13 08:43:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:48,535 INFO L225 Difference]: With dead ends: 112 [2024-09-13 08:43:48,535 INFO L226 Difference]: Without dead ends: 110 [2024-09-13 08:43:48,535 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-13 08:43:48,536 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.2s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:48,536 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.2s Time] [2024-09-13 08:43:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-09-13 08:43:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-09-13 08:43:48,545 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-13 08:43:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2024-09-13 08:43:48,546 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 18 [2024-09-13 08:43:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:48,547 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2024-09-13 08:43:48,547 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-13 08:43:48,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2024-09-13 08:43:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-13 08:43:48,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:48,549 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-13 08:43:48,550 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-13 08:43:48,550 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-13 08:43:48,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -894647034, now seen corresponding path program 1 times [2024-09-13 08:43:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:48,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697770883] [2024-09-13 08:43:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:48,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:48,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697770883] [2024-09-13 08:43:48,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697770883] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:48,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:48,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 08:43:48,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669757167] [2024-09-13 08:43:48,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:48,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 08:43:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:48,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 08:43:48,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:48,631 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-13 08:43:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:48,782 INFO L93 Difference]: Finished difference Result 110 states and 124 transitions. [2024-09-13 08:43:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 08:43:48,783 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-13 08:43:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:48,783 INFO L225 Difference]: With dead ends: 110 [2024-09-13 08:43:48,784 INFO L226 Difference]: Without dead ends: 108 [2024-09-13 08:43:48,784 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-13 08:43:48,785 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:48,785 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.1s Time] [2024-09-13 08:43:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-13 08:43:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-09-13 08:43:48,794 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-13 08:43:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2024-09-13 08:43:48,794 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 19 [2024-09-13 08:43:48,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:48,795 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2024-09-13 08:43:48,795 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-13 08:43:48,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,795 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2024-09-13 08:43:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-13 08:43:48,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:48,796 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-13 08:43:48,796 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-13 08:43:48,796 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-13 08:43:48,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1964251151, now seen corresponding path program 1 times [2024-09-13 08:43:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678171489] [2024-09-13 08:43:48,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:48,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:48,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678171489] [2024-09-13 08:43:48,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678171489] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:48,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:48,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 08:43:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318408183] [2024-09-13 08:43:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:48,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 08:43:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 08:43:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 08:43:48,856 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-13 08:43:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:49,014 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2024-09-13 08:43:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 08:43:49,015 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-13 08:43:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:49,016 INFO L225 Difference]: With dead ends: 108 [2024-09-13 08:43:49,016 INFO L226 Difference]: Without dead ends: 104 [2024-09-13 08:43:49,016 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-13 08:43:49,016 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:49,017 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.1s Time] [2024-09-13 08:43:49,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-13 08:43:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-09-13 08:43:49,042 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-13 08:43:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2024-09-13 08:43:49,043 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 20 [2024-09-13 08:43:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:49,043 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2024-09-13 08:43:49,043 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-13 08:43:49,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2024-09-13 08:43:49,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 08:43:49,044 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:49,044 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-13 08:43:49,046 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-13 08:43:49,046 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-13 08:43:49,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1590454791, now seen corresponding path program 1 times [2024-09-13 08:43:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913312269] [2024-09-13 08:43:49,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:49,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:49,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913312269] [2024-09-13 08:43:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913312269] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:49,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444761606] [2024-09-13 08:43:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:49,145 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:49,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:49,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:49,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:49,146 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-13 08:43:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:49,365 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-09-13 08:43:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:49,366 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-13 08:43:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:49,366 INFO L225 Difference]: With dead ends: 104 [2024-09-13 08:43:49,366 INFO L226 Difference]: Without dead ends: 102 [2024-09-13 08:43:49,367 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-13 08:43:49,367 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 182 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-13 08:43:49,367 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-13 08:43:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-13 08:43:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-09-13 08:43:49,376 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-13 08:43:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2024-09-13 08:43:49,377 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 21 [2024-09-13 08:43:49,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:49,377 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2024-09-13 08:43:49,377 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-13 08:43:49,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2024-09-13 08:43:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 08:43:49,378 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:49,378 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-13 08:43:49,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-13 08:43:49,378 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-13 08:43:49,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1542739541, now seen corresponding path program 1 times [2024-09-13 08:43:49,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:49,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202624249] [2024-09-13 08:43:49,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:49,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202624249] [2024-09-13 08:43:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202624249] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:49,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6860670] [2024-09-13 08:43:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:49,455 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:49,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:49,456 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-13 08:43:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:49,650 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2024-09-13 08:43:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:49,650 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-13 08:43:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:49,652 INFO L225 Difference]: With dead ends: 100 [2024-09-13 08:43:49,652 INFO L226 Difference]: Without dead ends: 96 [2024-09-13 08:43:49,653 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-13 08:43:49,653 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 182 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:49,654 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.1s Time] [2024-09-13 08:43:49,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-13 08:43:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-09-13 08:43:49,664 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-13 08:43:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-09-13 08:43:49,665 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 21 [2024-09-13 08:43:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:49,665 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-09-13 08:43:49,665 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-13 08:43:49,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-09-13 08:43:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 08:43:49,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:49,667 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-13 08:43:49,667 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-13 08:43:49,667 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-13 08:43:49,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -749003270, now seen corresponding path program 1 times [2024-09-13 08:43:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:49,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727749995] [2024-09-13 08:43:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727749995] [2024-09-13 08:43:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727749995] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:49,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293405028] [2024-09-13 08:43:49,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:49,775 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:49,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:49,776 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-13 08:43:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:49,980 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-09-13 08:43:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:49,980 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-13 08:43:49,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:49,981 INFO L225 Difference]: With dead ends: 96 [2024-09-13 08:43:49,981 INFO L226 Difference]: Without dead ends: 57 [2024-09-13 08:43:49,981 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-13 08:43:49,981 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.1s IncrementalHoareTripleChecker+Time [2024-09-13 08:43:49,982 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.1s Time] [2024-09-13 08:43:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-13 08:43:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-13 08:43:49,988 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-13 08:43:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-09-13 08:43:49,988 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 21 [2024-09-13 08:43:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:49,988 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-09-13 08:43:49,988 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-13 08:43:49,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-09-13 08:43:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 08:43:49,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:49,989 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-13 08:43:49,989 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-13 08:43:49,990 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-13 08:43:49,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:49,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1215413267, now seen corresponding path program 1 times [2024-09-13 08:43:49,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:49,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609387919] [2024-09-13 08:43:49,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:50,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609387919] [2024-09-13 08:43:50,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609387919] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:50,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:50,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-13 08:43:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809762625] [2024-09-13 08:43:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:50,156 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 08:43:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 08:43:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-09-13 08:43:50,157 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-13 08:43:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:50,391 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2024-09-13 08:43:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 08:43:50,391 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-13 08:43:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:50,392 INFO L225 Difference]: With dead ends: 57 [2024-09-13 08:43:50,392 INFO L226 Difference]: Without dead ends: 55 [2024-09-13 08:43:50,392 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-13 08:43:50,392 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-13 08:43:50,393 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-13 08:43:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-13 08:43:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-13 08:43:50,420 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-13 08:43:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2024-09-13 08:43:50,420 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 47 [2024-09-13 08:43:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:50,421 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2024-09-13 08:43:50,421 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-13 08:43:50,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2024-09-13 08:43:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 08:43:50,422 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:50,422 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-13 08:43:50,422 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-13 08:43:50,422 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-13 08:43:50,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1215399365, now seen corresponding path program 1 times [2024-09-13 08:43:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:50,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196682318] [2024-09-13 08:43:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196682318] [2024-09-13 08:43:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196682318] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-09-13 08:43:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164526304] [2024-09-13 08:43:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:50,610 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 08:43:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 08:43:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-09-13 08:43:50,611 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-13 08:43:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:50,840 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2024-09-13 08:43:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 08:43:50,841 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-13 08:43:50,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:50,841 INFO L225 Difference]: With dead ends: 55 [2024-09-13 08:43:50,841 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 08:43:50,842 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-13 08:43:50,842 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-13 08:43:50,842 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-13 08:43:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 08:43:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 08:43:50,848 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-13 08:43:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-09-13 08:43:50,849 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 47 [2024-09-13 08:43:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:50,849 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-09-13 08:43:50,849 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-13 08:43:50,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-09-13 08:43:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-13 08:43:50,850 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:50,850 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-13 08:43:50,850 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-13 08:43:50,850 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-13 08:43:50,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -976890969, now seen corresponding path program 1 times [2024-09-13 08:43:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:50,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647101463] [2024-09-13 08:43:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:50,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:50,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:50,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647101463] [2024-09-13 08:43:50,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647101463] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:50,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:50,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:50,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701399429] [2024-09-13 08:43:50,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:50,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:50,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:50,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:50,973 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-13 08:43:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:51,083 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-09-13 08:43:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:51,084 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-13 08:43:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:51,084 INFO L225 Difference]: With dead ends: 53 [2024-09-13 08:43:51,084 INFO L226 Difference]: Without dead ends: 51 [2024-09-13 08:43:51,085 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-13 08:43:51,085 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-13 08:43:51,085 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-13 08:43:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-13 08:43:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-13 08:43:51,109 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-13 08:43:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-09-13 08:43:51,110 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2024-09-13 08:43:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:51,110 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-09-13 08:43:51,110 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-13 08:43:51,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-09-13 08:43:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-13 08:43:51,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 08:43:51,111 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-13 08:43:51,111 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-13 08:43:51,111 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-13 08:43:51,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash -977321945, now seen corresponding path program 1 times [2024-09-13 08:43:51,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 08:43:51,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773524772] [2024-09-13 08:43:51,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 08:43:51,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 08:43:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:51,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 08:43:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 08:43:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-13 08:43:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 08:43:51,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773524772] [2024-09-13 08:43:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773524772] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 08:43:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 08:43:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 08:43:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692426067] [2024-09-13 08:43:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 08:43:51,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 08:43:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 08:43:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 08:43:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-13 08:43:51,240 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-13 08:43:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 08:43:51,353 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-09-13 08:43:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 08:43:51,354 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-13 08:43:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 08:43:51,354 INFO L225 Difference]: With dead ends: 51 [2024-09-13 08:43:51,354 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 08:43:51,355 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-13 08:43:51,355 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-13 08:43:51,355 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-13 08:43:51,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 08:43:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 08:43:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-13 08:43:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 08:43:51,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2024-09-13 08:43:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 08:43:51,356 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 08:43:51,356 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-13 08:43:51,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 08:43:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 08:43:51,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 08:43:51,359 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2024-09-13 08:43:51,359 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2024-09-13 08:43:51,359 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2024-09-13 08:43:51,359 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2024-09-13 08:43:51,360 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2024-09-13 08:43:51,361 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2024-09-13 08:43:51,361 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2024-09-13 08:43:51,361 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-13 08:43:51,363 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-13 08:43:51,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 08:43:52,511 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 08:43:52,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 08:43:52 BoogieIcfgContainer [2024-09-13 08:43:52,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 08:43:52,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 08:43:52,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 08:43:52,530 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 08:43:52,530 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 08:43:43" (3/4) ... [2024-09-13 08:43:52,538 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 08:43:52,545 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 08:43:52,545 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 08:43:52,564 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-09-13 08:43:52,565 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-13 08:43:52,570 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-13 08:43:52,570 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 08:43:52,778 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 08:43:52,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 08:43:52,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 08:43:52,781 INFO L158 Benchmark]: Toolchain (without parser) took 10183.08ms. Allocated memory was 159.4MB in the beginning and 325.1MB in the end (delta: 165.7MB). Free memory was 86.6MB in the beginning and 262.7MB in the end (delta: -176.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 08:43:52,781 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 08:43:52,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.04ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 86.4MB in the beginning and 177.7MB in the end (delta: -91.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.08ms. Allocated memory is still 224.4MB. Free memory was 177.7MB in the beginning and 176.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,781 INFO L158 Benchmark]: Boogie Preprocessor took 80.12ms. Allocated memory is still 224.4MB. Free memory was 176.6MB in the beginning and 172.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,781 INFO L158 Benchmark]: RCFGBuilder took 579.23ms. Allocated memory is still 224.4MB. Free memory was 172.5MB in the beginning and 134.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,782 INFO L158 Benchmark]: TraceAbstraction took 8826.90ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 133.7MB in the beginning and 274.2MB in the end (delta: -140.5MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,782 INFO L158 Benchmark]: Witness Printer took 250.81ms. Allocated memory is still 325.1MB. Free memory was 274.2MB in the beginning and 262.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 08:43:52,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.04ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 86.4MB in the beginning and 177.7MB in the end (delta: -91.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.08ms. Allocated memory is still 224.4MB. Free memory was 177.7MB in the beginning and 176.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.12ms. Allocated memory is still 224.4MB. Free memory was 176.6MB in the beginning and 172.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 579.23ms. Allocated memory is still 224.4MB. Free memory was 172.5MB in the beginning and 134.7MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8826.90ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 133.7MB in the beginning and 274.2MB in the end (delta: -140.5MB). Peak memory consumption was 131.0MB. Max. memory is 16.1GB. * Witness Printer took 250.81ms. Allocated memory is still 325.1MB. Free memory was 274.2MB in the beginning and 262.7MB in the end (delta: 11.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: 7.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 1661 SdHoareTripleChecker+Invalid, 2.9s 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.4s 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.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s 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-13 08:43:52,831 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE