/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-05 23:41:27,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 23:41:27,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 23:41:27,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 23:41:27,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 23:41:27,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 23:41:27,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 23:41:27,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 23:41:27,074 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 23:41:27,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 23:41:27,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 23:41:27,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 23:41:27,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 23:41:27,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 23:41:27,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 23:41:27,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 23:41:27,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 23:41:27,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 23:41:27,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 23:41:27,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 23:41:27,083 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 23:41:27,084 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 23:41:27,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 23:41:27,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 23:41:27,085 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 23:41:27,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 23:41:27,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 23:41:27,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 23:41:27,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 23:41:27,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 23:41:27,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 23:41:27,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 23:41:27,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 23:41:27,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 23:41:27,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 23:41:27,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 23:41:27,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 23:41:27,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 23:41:27,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 23:41:27,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 23:41:27,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 23:41:27,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 23:41:27,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-05 23:41:27,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 23:41:27,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 23:41:27,106 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-05 23:41:27,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-05 23:41:27,107 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-05 23:41:27,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-05 23:41:27,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-05 23:41:27,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * Use SBE=true [2022-04-05 23:41:27,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 23:41:27,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 23:41:27,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 23:41:27,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 23:41:27,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-05 23:41:27,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-05 23:41:27,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-05 23:41:27,111 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/ultimate/releaseScripts/default/UAutomizer-linux/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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-05 23:41:27,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 23:41:27,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 23:41:27,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 23:41:27,299 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 23:41:27,299 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 23:41:27,300 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-05 23:41:27,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef819287/5dde16ae2eb74b1fa6d4b578c2880a49/FLAG35b61aad7 [2022-04-05 23:41:27,738 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 23:41:27,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-04-05 23:41:27,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef819287/5dde16ae2eb74b1fa6d4b578c2880a49/FLAG35b61aad7 [2022-04-05 23:41:27,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef819287/5dde16ae2eb74b1fa6d4b578c2880a49 [2022-04-05 23:41:27,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 23:41:27,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-05 23:41:27,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 23:41:27,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 23:41:27,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 23:41:27,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 11:41:27" (1/1) ... [2022-04-05 23:41:27,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33341470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:27, skipping insertion in model container [2022-04-05 23:41:27,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 11:41:27" (1/1) ... [2022-04-05 23:41:27,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 23:41:27,804 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 23:41:27,933 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-04-05 23:41:27,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-04-05 23:41:27,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-05 23:41:27,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-05 23:41:27,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-05 23:41:27,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-05 23:41:27,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-05 23:41:27,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-05 23:41:27,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-05 23:41:27,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-05 23:41:27,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-05 23:41:27,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-05 23:41:27,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-05 23:41:27,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-05 23:41:27,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-05 23:41:27,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-05 23:41:27,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 23:41:27,999 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 23:41:28,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-04-05 23:41:28,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-04-05 23:41:28,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-04-05 23:41:28,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-04-05 23:41:28,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-04-05 23:41:28,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-04-05 23:41:28,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-04-05 23:41:28,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-04-05 23:41:28,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-04-05 23:41:28,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-04-05 23:41:28,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-04-05 23:41:28,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-04-05 23:41:28,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-04-05 23:41:28,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-04-05 23:41:28,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-04-05 23:41:28,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-04-05 23:41:28,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 23:41:28,065 INFO L208 MainTranslator]: Completed translation [2022-04-05 23:41:28,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28 WrapperNode [2022-04-05 23:41:28,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 23:41:28,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 23:41:28,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 23:41:28,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 23:41:28,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 23:41:28,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 23:41:28,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 23:41:28,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 23:41:28,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (1/1) ... [2022-04-05 23:41:28,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 23:41:28,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 23:41:28,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-05 23:41:28,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-05 23:41:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 23:41:28,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 23:41:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 23:41:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-05 23:41:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-05 23:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-05 23:41:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 23:41:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 23:41:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 23:41:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 23:41:28,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 23:41:28,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 23:41:28,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 23:41:28,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 23:41:28,236 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 23:41:28,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 23:41:28,501 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 23:41:28,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 23:41:28,505 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-05 23:41:28,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:41:28 BoogieIcfgContainer [2022-04-05 23:41:28,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 23:41:28,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 23:41:28,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 23:41:28,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 23:41:28,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 11:41:27" (1/3) ... [2022-04-05 23:41:28,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51812059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:41:28, skipping insertion in model container [2022-04-05 23:41:28,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 11:41:28" (2/3) ... [2022-04-05 23:41:28,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51812059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 11:41:28, skipping insertion in model container [2022-04-05 23:41:28,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 11:41:28" (3/3) ... [2022-04-05 23:41:28,512 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-04-05 23:41:28,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-05 23:41:28,515 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-04-05 23:41:28,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 23:41:28,558 INFO L340 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-04-05 23:41:28,558 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-04-05 23:41:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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) [2022-04-05 23:41:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-05 23:41:28,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:28,574 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:28,575 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:28,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1600664684, now seen corresponding path program 1 times [2022-04-05 23:41:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:28,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028678359] [2022-04-05 23:41:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028678359] [2022-04-05 23:41:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028678359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:28,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:28,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 23:41:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131728712] [2022-04-05 23:41:28,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:28,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 23:41:28,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 23:41:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 23:41:28,831 INFO L87 Difference]: Start difference. First operand has 125 states, 104 states have (on average 1.9038461538461537) internal successors, (198), 120 states have internal predecessors, (198), 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.6) internal successors, (8), 4 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) [2022-04-05 23:41:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:29,172 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2022-04-05 23:41:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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 [2022-04-05 23:41:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:29,180 INFO L225 Difference]: With dead ends: 143 [2022-04-05 23:41:29,180 INFO L226 Difference]: Without dead ends: 123 [2022-04-05 23:41:29,182 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:29,185 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 269 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:29,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 118 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-05 23:41:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2022-04-05 23:41:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.36) internal successors, (136), 114 states have internal predecessors, (136), 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) [2022-04-05 23:41:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2022-04-05 23:41:29,215 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 11 [2022-04-05 23:41:29,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:29,215 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2022-04-05 23:41:29,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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) [2022-04-05 23:41:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2022-04-05 23:41:29,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-05 23:41:29,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:29,216 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:29,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 23:41:29,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1919005414, now seen corresponding path program 1 times [2022-04-05 23:41:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:29,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695251627] [2022-04-05 23:41:29,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:29,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:29,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695251627] [2022-04-05 23:41:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695251627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:29,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 23:41:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460898598] [2022-04-05 23:41:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:29,324 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 23:41:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:29,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 23:41:29,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-05 23:41:29,325 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-05 23:41:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:29,562 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2022-04-05 23:41:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 12 [2022-04-05 23:41:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:29,564 INFO L225 Difference]: With dead ends: 121 [2022-04-05 23:41:29,564 INFO L226 Difference]: Without dead ends: 113 [2022-04-05 23:41:29,565 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-05 23:41:29,566 INFO L913 BasicCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:29,566 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 248 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:29,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-05 23:41:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-05 23:41:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 109 states have internal predecessors, (122), 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) [2022-04-05 23:41:29,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-04-05 23:41:29,573 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 12 [2022-04-05 23:41:29,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:29,573 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-04-05 23:41:29,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-04-05 23:41:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-04-05 23:41:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-05 23:41:29,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:29,574 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:29,574 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 23:41:29,574 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:29,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1908131676, now seen corresponding path program 1 times [2022-04-05 23:41:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:29,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519050028] [2022-04-05 23:41:29,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:29,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519050028] [2022-04-05 23:41:29,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519050028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:29,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:29,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 23:41:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996153708] [2022-04-05 23:41:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:29,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 23:41:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 23:41:29,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 23:41:29,626 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-05 23:41:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:29,816 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-04-05 23:41:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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 [2022-04-05 23:41:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:29,817 INFO L225 Difference]: With dead ends: 113 [2022-04-05 23:41:29,817 INFO L226 Difference]: Without dead ends: 111 [2022-04-05 23:41:29,817 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:29,818 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 140 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:29,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 118 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-05 23:41:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-05 23:41:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.263157894736842) internal successors, (120), 107 states have internal predecessors, (120), 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) [2022-04-05 23:41:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-04-05 23:41:29,825 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 15 [2022-04-05 23:41:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:29,827 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-04-05 23:41:29,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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) [2022-04-05 23:41:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-04-05 23:41:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-05 23:41:29,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:29,827 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:29,827 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 23:41:29,828 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:29,828 INFO L85 PathProgramCache]: Analyzing trace with hash -977457091, now seen corresponding path program 1 times [2022-04-05 23:41:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:29,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818877324] [2022-04-05 23:41:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:29,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:29,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818877324] [2022-04-05 23:41:29,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818877324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:29,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:29,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 23:41:29,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366160837] [2022-04-05 23:41:29,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:29,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 23:41:29,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:29,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 23:41:29,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 23:41:29,897 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 23:41:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:30,029 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-04-05 23:41:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 23:41:30,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-05 23:41:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:30,030 INFO L225 Difference]: With dead ends: 111 [2022-04-05 23:41:30,030 INFO L226 Difference]: Without dead ends: 107 [2022-04-05 23:41:30,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:30,031 INFO L913 BasicCegarLoop]: 112 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:30,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 199 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:30,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-05 23:41:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-05 23:41:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2608695652173914) internal successors, (116), 103 states have internal predecessors, (116), 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) [2022-04-05 23:41:30,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-04-05 23:41:30,036 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 16 [2022-04-05 23:41:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:30,036 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-04-05 23:41:30,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-05 23:41:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-04-05 23:41:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 23:41:30,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:30,037 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:30,037 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 23:41:30,037 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash -223130707, now seen corresponding path program 1 times [2022-04-05 23:41:30,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:30,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393425156] [2022-04-05 23:41:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:30,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393425156] [2022-04-05 23:41:30,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393425156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:30,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:30,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 23:41:30,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095482083] [2022-04-05 23:41:30,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:30,096 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 23:41:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:30,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 23:41:30,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 23:41:30,097 INFO L87 Difference]: Start difference. First operand 107 states and 119 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) [2022-04-05 23:41:30,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:30,294 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2022-04-05 23:41:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:30,295 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 [2022-04-05 23:41:30,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:30,295 INFO L225 Difference]: With dead ends: 125 [2022-04-05 23:41:30,295 INFO L226 Difference]: Without dead ends: 123 [2022-04-05 23:41:30,296 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:30,296 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 157 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:30,297 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 128 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-05 23:41:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-04-05 23:41:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 101 states have internal predecessors, (114), 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) [2022-04-05 23:41:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-04-05 23:41:30,301 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-04-05 23:41:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:30,301 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-04-05 23:41:30,301 INFO L479 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) [2022-04-05 23:41:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-04-05 23:41:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-05 23:41:30,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:30,302 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:30,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 23:41:30,302 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -221591507, now seen corresponding path program 1 times [2022-04-05 23:41:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:30,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577764812] [2022-04-05 23:41:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:30,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577764812] [2022-04-05 23:41:30,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577764812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:30,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:30,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 23:41:30,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75999677] [2022-04-05 23:41:30,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:30,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 23:41:30,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:30,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 23:41:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 23:41:30,361 INFO L87 Difference]: Start difference. First operand 105 states and 117 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) [2022-04-05 23:41:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:30,543 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2022-04-05 23:41:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:30,544 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 [2022-04-05 23:41:30,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:30,544 INFO L225 Difference]: With dead ends: 105 [2022-04-05 23:41:30,544 INFO L226 Difference]: Without dead ends: 103 [2022-04-05 23:41:30,545 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:30,545 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:30,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 100 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-05 23:41:30,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-05 23:41:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 99 states have internal predecessors, (112), 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) [2022-04-05 23:41:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-04-05 23:41:30,549 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 17 [2022-04-05 23:41:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:30,550 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-04-05 23:41:30,550 INFO L479 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) [2022-04-05 23:41:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-04-05 23:41:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 23:41:30,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:30,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:30,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 23:41:30,551 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:30,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1674251212, now seen corresponding path program 1 times [2022-04-05 23:41:30,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:30,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684619392] [2022-04-05 23:41:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:30,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684619392] [2022-04-05 23:41:30,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684619392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:30,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:30,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 23:41:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854451281] [2022-04-05 23:41:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:30,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 23:41:30,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 23:41:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-05 23:41:30,595 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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) [2022-04-05 23:41:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:30,790 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-04-05 23:41:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 23:41:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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 [2022-04-05 23:41:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:30,791 INFO L225 Difference]: With dead ends: 124 [2022-04-05 23:41:30,791 INFO L226 Difference]: Without dead ends: 122 [2022-04-05 23:41:30,791 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:30,792 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:30,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 120 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-05 23:41:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2022-04-05 23:41:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 97 states have internal predecessors, (110), 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) [2022-04-05 23:41:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-04-05 23:41:30,796 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 18 [2022-04-05 23:41:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:30,796 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-04-05 23:41:30,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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) [2022-04-05 23:41:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-04-05 23:41:30,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 23:41:30,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:30,796 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:30,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 23:41:30,797 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:30,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:30,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1672885792, now seen corresponding path program 1 times [2022-04-05 23:41:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:30,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52036593] [2022-04-05 23:41:30,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:30,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52036593] [2022-04-05 23:41:30,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52036593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:30,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:30,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381125713] [2022-04-05 23:41:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:30,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:30,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:30,905 INFO L87 Difference]: Start difference. First operand 101 states and 113 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) [2022-04-05 23:41:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:31,135 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2022-04-05 23:41:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 23:41:31,136 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 [2022-04-05 23:41:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:31,137 INFO L225 Difference]: With dead ends: 134 [2022-04-05 23:41:31,137 INFO L226 Difference]: Without dead ends: 132 [2022-04-05 23:41:31,137 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:31,138 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 100 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:31,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 252 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-05 23:41:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2022-04-05 23:41:31,142 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) [2022-04-05 23:41:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-04-05 23:41:31,143 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 18 [2022-04-05 23:41:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:31,143 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-04-05 23:41:31,143 INFO L479 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) [2022-04-05 23:41:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-04-05 23:41:31,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-05 23:41:31,143 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:31,144 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:31,144 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 23:41:31,144 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1720601042, now seen corresponding path program 1 times [2022-04-05 23:41:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:31,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073053576] [2022-04-05 23:41:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:31,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073053576] [2022-04-05 23:41:31,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073053576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:31,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:31,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221672557] [2022-04-05 23:41:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:31,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:31,269 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) [2022-04-05 23:41:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:31,509 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2022-04-05 23:41:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 23:41:31,510 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 [2022-04-05 23:41:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:31,511 INFO L225 Difference]: With dead ends: 117 [2022-04-05 23:41:31,511 INFO L226 Difference]: Without dead ends: 113 [2022-04-05 23:41:31,511 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:31,512 INFO L913 BasicCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:31,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-05 23:41:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-04-05 23:41:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.2395833333333333) 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) [2022-04-05 23:41:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2022-04-05 23:41:31,515 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 18 [2022-04-05 23:41:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:31,515 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2022-04-05 23:41:31,515 INFO L479 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) [2022-04-05 23:41:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2022-04-05 23:41:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-05 23:41:31,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:31,516 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:31,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 23:41:31,516 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash 362183168, now seen corresponding path program 1 times [2022-04-05 23:41:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:31,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565268433] [2022-04-05 23:41:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:31,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565268433] [2022-04-05 23:41:31,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565268433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:31,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:31,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:31,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390728105] [2022-04-05 23:41:31,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:31,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:31,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:31,586 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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) [2022-04-05 23:41:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:31,793 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-04-05 23:41:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 23:41:31,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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 [2022-04-05 23:41:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:31,795 INFO L225 Difference]: With dead ends: 135 [2022-04-05 23:41:31,795 INFO L226 Difference]: Without dead ends: 133 [2022-04-05 23:41:31,795 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:31,795 INFO L913 BasicCegarLoop]: 116 mSDtfsCounter, 97 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:31,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 242 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-05 23:41:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2022-04-05 23:41:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 107 states have internal predecessors, (122), 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) [2022-04-05 23:41:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-04-05 23:41:31,799 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 19 [2022-04-05 23:41:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:31,799 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-04-05 23:41:31,799 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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) [2022-04-05 23:41:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-04-05 23:41:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 23:41:31,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:31,800 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:31,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 23:41:31,800 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:31,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:31,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1325574371, now seen corresponding path program 1 times [2022-04-05 23:41:31,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:31,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5128147] [2022-04-05 23:41:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5128147] [2022-04-05 23:41:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5128147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:31,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:31,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 23:41:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911851273] [2022-04-05 23:41:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:31,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 23:41:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 23:41:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 23:41:31,832 INFO L87 Difference]: Start difference. First operand 111 states and 125 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) [2022-04-05 23:41:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:31,940 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2022-04-05 23:41:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 23:41:31,940 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 [2022-04-05 23:41:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:31,941 INFO L225 Difference]: With dead ends: 111 [2022-04-05 23:41:31,941 INFO L226 Difference]: Without dead ends: 109 [2022-04-05 23:41:31,941 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:31,941 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 152 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:31,942 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-05 23:41:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-05 23:41:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 105 states have internal predecessors, (120), 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) [2022-04-05 23:41:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-04-05 23:41:31,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 20 [2022-04-05 23:41:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:31,945 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-04-05 23:41:31,945 INFO L479 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) [2022-04-05 23:41:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-04-05 23:41:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-05 23:41:31,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:31,945 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:31,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 23:41:31,946 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1856864327, now seen corresponding path program 1 times [2022-04-05 23:41:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:31,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63852508] [2022-04-05 23:41:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:31,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63852508] [2022-04-05 23:41:31,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63852508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:31,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:31,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 23:41:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192917957] [2022-04-05 23:41:31,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:31,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 23:41:31,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:31,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 23:41:31,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-05 23:41:31,994 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-04-05 23:41:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:32,095 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-04-05 23:41:32,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 23:41:32,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 [2022-04-05 23:41:32,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:32,096 INFO L225 Difference]: With dead ends: 109 [2022-04-05 23:41:32,096 INFO L226 Difference]: Without dead ends: 105 [2022-04-05 23:41:32,096 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:32,097 INFO L913 BasicCegarLoop]: 101 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:32,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-05 23:41:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-05 23:41:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 101 states have internal predecessors, (116), 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) [2022-04-05 23:41:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-05 23:41:32,100 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 21 [2022-04-05 23:41:32,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:32,100 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-05 23:41:32,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-04-05 23:41:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-05 23:41:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 23:41:32,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:32,101 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:32,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 23:41:32,101 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:32,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:32,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1714979017, now seen corresponding path program 1 times [2022-04-05 23:41:32,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:32,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399510692] [2022-04-05 23:41:32,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:32,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399510692] [2022-04-05 23:41:32,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399510692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:32,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:32,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:32,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841130863] [2022-04-05 23:41:32,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:32,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:32,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:32,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:32,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:32,158 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:32,358 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-04-05 23:41:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 23:41:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2022-04-05 23:41:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:32,359 INFO L225 Difference]: With dead ends: 121 [2022-04-05 23:41:32,359 INFO L226 Difference]: Without dead ends: 119 [2022-04-05 23:41:32,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 23:41:32,360 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:32,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 72 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:32,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-05 23:41:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-04-05 23:41:32,362 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) [2022-04-05 23:41:32,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-05 23:41:32,363 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 22 [2022-04-05 23:41:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:32,363 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-05 23:41:32,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-05 23:41:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 23:41:32,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:32,364 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:32,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 23:41:32,364 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1738536758, now seen corresponding path program 1 times [2022-04-05 23:41:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:32,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157094228] [2022-04-05 23:41:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:32,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:32,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157094228] [2022-04-05 23:41:32,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157094228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:32,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:32,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:32,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680863607] [2022-04-05 23:41:32,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:32,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:32,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:32,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:32,461 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:32,666 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-04-05 23:41:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 23:41:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2022-04-05 23:41:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:32,666 INFO L225 Difference]: With dead ends: 113 [2022-04-05 23:41:32,667 INFO L226 Difference]: Without dead ends: 111 [2022-04-05 23:41:32,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 23:41:32,667 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 249 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:32,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 66 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-05 23:41:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-05 23:41:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2022-04-05 23:41:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.206896551724138) internal successors, (105), 91 states have internal predecessors, (105), 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) [2022-04-05 23:41:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-04-05 23:41:32,670 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 22 [2022-04-05 23:41:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:32,670 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-04-05 23:41:32,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-04-05 23:41:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-05 23:41:32,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:32,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:32,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 23:41:32,671 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1786252008, now seen corresponding path program 1 times [2022-04-05 23:41:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805075695] [2022-04-05 23:41:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:32,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:32,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805075695] [2022-04-05 23:41:32,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805075695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:32,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:32,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 23:41:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779338007] [2022-04-05 23:41:32,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:32,723 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 23:41:32,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:32,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 23:41:32,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-05 23:41:32,724 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:32,893 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2022-04-05 23:41:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 23:41:32,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 22 [2022-04-05 23:41:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:32,894 INFO L225 Difference]: With dead ends: 95 [2022-04-05 23:41:32,894 INFO L226 Difference]: Without dead ends: 58 [2022-04-05 23:41:32,894 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:32,894 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 229 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:32,895 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 54 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-05 23:41:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-05 23:41:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 54 states have internal predecessors, (55), 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) [2022-04-05 23:41:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-05 23:41:32,896 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 22 [2022-04-05 23:41:32,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:32,896 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-05 23:41:32,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-04-05 23:41:32,896 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-05 23:41:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 23:41:32,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:32,897 INFO L499 BasicCegarLoop]: 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] [2022-04-05 23:41:32,897 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 23:41:32,897 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -563432656, now seen corresponding path program 1 times [2022-04-05 23:41:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299769733] [2022-04-05 23:41:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:32,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:32,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299769733] [2022-04-05 23:41:32,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299769733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:32,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 23:41:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201311487] [2022-04-05 23:41:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:32,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 23:41:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 23:41:32,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-05 23:41:33,000 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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) [2022-04-05 23:41:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:33,209 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-05 23:41:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 23:41:33,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 [2022-04-05 23:41:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:33,210 INFO L225 Difference]: With dead ends: 67 [2022-04-05 23:41:33,210 INFO L226 Difference]: Without dead ends: 65 [2022-04-05 23:41:33,210 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:33,211 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 125 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:33,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 63 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-05 23:41:33,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-04-05 23:41:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.06) internal successors, (53), 52 states have internal predecessors, (53), 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) [2022-04-05 23:41:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-05 23:41:33,212 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 48 [2022-04-05 23:41:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:33,213 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-05 23:41:33,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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) [2022-04-05 23:41:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-05 23:41:33,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 23:41:33,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:33,213 INFO L499 BasicCegarLoop]: 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] [2022-04-05 23:41:33,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 23:41:33,213 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:33,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash -563446558, now seen corresponding path program 1 times [2022-04-05 23:41:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:33,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118580057] [2022-04-05 23:41:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:33,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:33,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118580057] [2022-04-05 23:41:33,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118580057] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:33,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:33,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-05 23:41:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687300318] [2022-04-05 23:41:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:33,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-05 23:41:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-05 23:41:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-04-05 23:41:33,303 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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) [2022-04-05 23:41:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:33,494 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-05 23:41:33,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 23:41:33,494 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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 [2022-04-05 23:41:33,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:33,495 INFO L225 Difference]: With dead ends: 56 [2022-04-05 23:41:33,495 INFO L226 Difference]: Without dead ends: 54 [2022-04-05 23:41:33,495 INFO L912 BasicCegarLoop]: 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 [2022-04-05 23:41:33,496 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:33,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 47 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-05 23:41:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-05 23:41:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 50 states have internal predecessors, (51), 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) [2022-04-05 23:41:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-05 23:41:33,497 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 48 [2022-04-05 23:41:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:33,498 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-05 23:41:33,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 13 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) [2022-04-05 23:41:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-05 23:41:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 23:41:33,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:33,498 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-05 23:41:33,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 23:41:33,498 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -286539729, now seen corresponding path program 1 times [2022-04-05 23:41:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767618] [2022-04-05 23:41:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767618] [2022-04-05 23:41:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 23:41:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798171107] [2022-04-05 23:41:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:33,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 23:41:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 23:41:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 23:41:33,589 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-04-05 23:41:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:33,687 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-05 23:41:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 23:41:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2022-04-05 23:41:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:33,688 INFO L225 Difference]: With dead ends: 62 [2022-04-05 23:41:33,688 INFO L226 Difference]: Without dead ends: 60 [2022-04-05 23:41:33,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-05 23:41:33,689 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 124 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:33,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 35 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-05 23:41:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-04-05 23:41:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 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) [2022-04-05 23:41:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-05 23:41:33,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2022-04-05 23:41:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:33,691 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-05 23:41:33,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-04-05 23:41:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-05 23:41:33,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 23:41:33,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 23:41:33,692 INFO L499 BasicCegarLoop]: 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, 1] [2022-04-05 23:41:33,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 23:41:33,692 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2022-04-05 23:41:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 23:41:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash -286970705, now seen corresponding path program 1 times [2022-04-05 23:41:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 23:41:33,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129612758] [2022-04-05 23:41:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 23:41:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 23:41:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 23:41:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 23:41:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 23:41:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 23:41:33,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129612758] [2022-04-05 23:41:33,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129612758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 23:41:33,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 23:41:33,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 23:41:33,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768848263] [2022-04-05 23:41:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 23:41:33,793 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 23:41:33,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 23:41:33,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 23:41:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-05 23:41:33,794 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-04-05 23:41:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 23:41:33,878 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-05 23:41:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 23:41:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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 49 [2022-04-05 23:41:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 23:41:33,879 INFO L225 Difference]: With dead ends: 52 [2022-04-05 23:41:33,879 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 23:41:33,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-05 23:41:33,881 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-05 23:41:33,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 27 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-05 23:41:33,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 23:41:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 23:41:33,881 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) [2022-04-05 23:41:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 23:41:33,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-05 23:41:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 23:41:33,882 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 23:41:33,882 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 7 states have internal predecessors, (46), 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) [2022-04-05 23:41:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 23:41:33,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 23:41:33,884 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-04-05 23:41:33,884 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-04-05 23:41:33,884 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-04-05 23:41:33,884 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-04-05 23:41:33,885 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-04-05 23:41:33,886 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-04-05 23:41:33,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 23:41:33,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-05 23:41:34,005 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-05 23:41:34,005 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-05 23:41:34,005 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-05 23:41:34,005 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 17 1006) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-04-05 23:41:34,006 INFO L882 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 17 1006) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-04-05 23:41:34,007 INFO L882 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-04-05 23:41:34,008 INFO L882 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L882 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-04-05 23:41:34,009 INFO L878 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-04-05 23:41:34,010 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L878 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L878 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: (or (<= 0 main_~main__t~0) (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|))) [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-04-05 23:41:34,011 INFO L882 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 17 1006) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|)) [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L878 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-04-05 23:41:34,012 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-04-05 23:41:34,013 INFO L882 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L878 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_3137_1~0 |old(~__tmp_3137_1~0)|) (= ~__tmp_2624_1~0 |old(~__tmp_2624_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_3137_0~0 |old(~__tmp_3137_0~0)|) (= |old(~__return_2598~0)| ~__return_2598~0) (= ~__tmp_2624_0~0 |old(~__tmp_2624_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-05 23:41:34,014 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-05 23:41:34,014 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-05 23:41:34,014 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-05 23:41:34,017 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 23:41:34,018 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 23:41:34,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 11:41:34 BoogieIcfgContainer [2022-04-05 23:41:34,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 23:41:34,031 INFO L158 Benchmark]: Toolchain (without parser) took 6275.99ms. Allocated memory was 229.6MB in the beginning and 310.4MB in the end (delta: 80.7MB). Free memory was 176.9MB in the beginning and 218.4MB in the end (delta: -41.5MB). Peak memory consumption was 40.7MB. Max. memory is 8.0GB. [2022-04-05 23:41:34,031 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory was 194.2MB in the beginning and 194.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 23:41:34,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.42ms. Allocated memory is still 229.6MB. Free memory was 176.6MB in the beginning and 194.3MB in the end (delta: -17.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-04-05 23:41:34,031 INFO L158 Benchmark]: Boogie Preprocessor took 38.74ms. Allocated memory is still 229.6MB. Free memory was 194.3MB in the beginning and 191.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 23:41:34,031 INFO L158 Benchmark]: RCFGBuilder took 401.44ms. Allocated memory is still 229.6MB. Free memory was 191.8MB in the beginning and 167.1MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-05 23:41:34,032 INFO L158 Benchmark]: TraceAbstraction took 5522.81ms. Allocated memory was 229.6MB in the beginning and 310.4MB in the end (delta: 80.7MB). Free memory was 166.7MB in the beginning and 218.4MB in the end (delta: -51.7MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2022-04-05 23:41:34,032 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 229.6MB. Free memory was 194.2MB in the beginning and 194.0MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.42ms. Allocated memory is still 229.6MB. Free memory was 176.6MB in the beginning and 194.3MB in the end (delta: -17.7MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.74ms. Allocated memory is still 229.6MB. Free memory was 194.3MB in the beginning and 191.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.44ms. Allocated memory is still 229.6MB. Free memory was 191.8MB in the beginning and 167.1MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5522.81ms. Allocated memory was 229.6MB in the beginning and 310.4MB in the end (delta: 80.7MB). Free memory was 166.7MB in the beginning and 218.4MB in the end (delta: -51.7MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * 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]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 132 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2655 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2655 mSDsluCounter, 2392 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1309 mSDsCounter, 485 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5093 IncrementalHoareTripleChecker+Invalid, 5578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 485 mSolverCounterUnsat, 1083 mSDtfsCounter, 5093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=0, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 148 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 92 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4450 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 261 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 1724 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: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= main__t || ((((__tmp_3137_1 == \old(__tmp_3137_1) && __tmp_2624_1 == \old(__tmp_2624_1)) && __tmp_3137_0 == \old(__tmp_3137_0)) && \old(__return_2598) == __return_2598) && __tmp_2624_0 == \old(__tmp_2624_0)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-05 23:41:34,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...