/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 09:40:41,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 09:40:41,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 09:40:41,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 09:40:41,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 09:40:41,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 09:40:41,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 09:40:41,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 09:40:41,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 09:40:41,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 09:40:41,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 09:40:41,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 09:40:41,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 09:40:41,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 09:40:41,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 09:40:41,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 09:40:41,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 09:40:41,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 09:40:41,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 09:40:41,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 09:40:41,533 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 09:40:41,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 09:40:41,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 09:40:41,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 09:40:41,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 09:40:41,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 09:40:41,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 09:40:41,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 09:40:41,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 09:40:41,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 09:40:41,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 09:40:41,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 09:40:41,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 09:40:41,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 09:40:41,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 09:40:41,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 09:40:41,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 09:40:41,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 09:40:41,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 09:40:41,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 09:40:41,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 09:40:41,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 09:40:41,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 09:40:41,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 09:40:41,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 09:40:41,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 09:40:41,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 09:40:41,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 09:40:41,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 09:40:41,567 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 09:40:41,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 09:40:41,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 09:40:41,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 09:40:41,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 09:40:41,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 09:40:41,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 09:40:41,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:40:41,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 09:40:41,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 09:40:41,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 09:40:41,571 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 09:40:41,571 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-06 09:40:41,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 09:40:41,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 09:40:41,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 09:40:41,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 09:40:41,773 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 09:40:41,774 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.v+lhb-reducer.c [2022-04-06 09:40:41,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4220a3807/042f18ff72254c459ed902235a2d80c4/FLAGfd5fdfb97 [2022-04-06 09:40:42,185 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 09:40:42,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-04-06 09:40:42,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4220a3807/042f18ff72254c459ed902235a2d80c4/FLAGfd5fdfb97 [2022-04-06 09:40:42,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4220a3807/042f18ff72254c459ed902235a2d80c4 [2022-04-06 09:40:42,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 09:40:42,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 09:40:42,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 09:40:42,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 09:40:42,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 09:40:42,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a104a6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42, skipping insertion in model container [2022-04-06 09:40:42,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 09:40:42,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 09:40:42,756 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.v+lhb-reducer.c[1224,1237] [2022-04-06 09:40:42,761 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.v+lhb-reducer.c[1636,1649] [2022-04-06 09:40:42,767 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.v+lhb-reducer.c[1851,1864] [2022-04-06 09:40:42,770 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.v+lhb-reducer.c[2384,2397] [2022-04-06 09:40:42,773 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.v+lhb-reducer.c[2599,2612] [2022-04-06 09:40:42,774 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.v+lhb-reducer.c[2901,2914] [2022-04-06 09:40:42,776 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.v+lhb-reducer.c[3116,3129] [2022-04-06 09:40:42,778 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.v+lhb-reducer.c[3386,3399] [2022-04-06 09:40:42,780 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.v+lhb-reducer.c[3604,3617] [2022-04-06 09:40:42,783 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.v+lhb-reducer.c[4088,4101] [2022-04-06 09:40:42,784 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.v+lhb-reducer.c[4306,4319] [2022-04-06 09:40:42,787 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.v+lhb-reducer.c[4802,4815] [2022-04-06 09:40:42,792 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.v+lhb-reducer.c[5203,5216] [2022-04-06 09:40:42,794 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.v+lhb-reducer.c[5421,5434] [2022-04-06 09:40:42,796 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.v+lhb-reducer.c[5792,5805] [2022-04-06 09:40:42,797 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.v+lhb-reducer.c[6010,6023] [2022-04-06 09:40:42,798 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.v+lhb-reducer.c[6296,6309] [2022-04-06 09:40:42,798 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.v+lhb-reducer.c[6514,6527] [2022-04-06 09:40:42,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:40:42,804 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 09:40:42,819 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.v+lhb-reducer.c[1224,1237] [2022-04-06 09:40:42,820 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.v+lhb-reducer.c[1636,1649] [2022-04-06 09:40:42,820 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.v+lhb-reducer.c[1851,1864] [2022-04-06 09:40:42,821 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.v+lhb-reducer.c[2384,2397] [2022-04-06 09:40:42,822 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.v+lhb-reducer.c[2599,2612] [2022-04-06 09:40:42,823 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.v+lhb-reducer.c[2901,2914] [2022-04-06 09:40:42,824 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.v+lhb-reducer.c[3116,3129] [2022-04-06 09:40:42,824 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.v+lhb-reducer.c[3386,3399] [2022-04-06 09:40:42,825 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.v+lhb-reducer.c[3604,3617] [2022-04-06 09:40:42,826 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.v+lhb-reducer.c[4088,4101] [2022-04-06 09:40:42,827 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.v+lhb-reducer.c[4306,4319] [2022-04-06 09:40:42,828 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.v+lhb-reducer.c[4802,4815] [2022-04-06 09:40:42,829 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.v+lhb-reducer.c[5203,5216] [2022-04-06 09:40:42,829 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.v+lhb-reducer.c[5421,5434] [2022-04-06 09:40:42,834 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.v+lhb-reducer.c[5792,5805] [2022-04-06 09:40:42,839 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.v+lhb-reducer.c[6010,6023] [2022-04-06 09:40:42,840 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.v+lhb-reducer.c[6296,6309] [2022-04-06 09:40:42,841 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.v+lhb-reducer.c[6514,6527] [2022-04-06 09:40:42,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 09:40:42,850 INFO L208 MainTranslator]: Completed translation [2022-04-06 09:40:42,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42 WrapperNode [2022-04-06 09:40:42,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 09:40:42,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 09:40:42,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 09:40:42,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 09:40:42,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 09:40:42,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 09:40:42,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 09:40:42,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 09:40:42,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (1/1) ... [2022-04-06 09:40:42,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 09:40:42,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:42,909 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-06 09:40:42,914 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-06 09:40:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 09:40:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 09:40:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 09:40:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 09:40:42,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 09:40:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 09:40:42,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 09:40:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 09:40:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 09:40:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 09:40:42,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 09:40:43,006 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 09:40:43,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 09:40:43,175 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 09:40:43,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 09:40:43,180 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-06 09:40:43,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:43 BoogieIcfgContainer [2022-04-06 09:40:43,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 09:40:43,182 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 09:40:43,182 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 09:40:43,182 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 09:40:43,184 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:43" (1/1) ... [2022-04-06 09:40:43,185 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 09:40:43,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:40:43 BasicIcfg [2022-04-06 09:40:43,199 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 09:40:43,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 09:40:43,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 09:40:43,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 09:40:43,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:40:42" (1/4) ... [2022-04-06 09:40:43,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@803755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:40:43, skipping insertion in model container [2022-04-06 09:40:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:40:42" (2/4) ... [2022-04-06 09:40:43,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@803755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:40:43, skipping insertion in model container [2022-04-06 09:40:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:40:43" (3/4) ... [2022-04-06 09:40:43,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@803755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:40:43, skipping insertion in model container [2022-04-06 09:40:43,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 09:40:43" (4/4) ... [2022-04-06 09:40:43,211 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.cqvasr [2022-04-06 09:40:43,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 09:40:43,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-06 09:40:43,240 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 09:40:43,243 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=FINITE_AUTOMATA, 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-06 09:40:43,244 INFO L341 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-06 09:40:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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-06 09:40:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 09:40:43,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:43,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:43,257 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1731584118, now seen corresponding path program 1 times [2022-04-06 09:40:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:43,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075711082] [2022-04-06 09:40:43,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:43,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:43,470 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-06 09:40:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:43,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075711082] [2022-04-06 09:40:43,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075711082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:43,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:43,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:43,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127016495] [2022-04-06 09:40:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:43,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:43,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:43,520 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 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.8) internal successors, (9), 4 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-06 09:40:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:43,725 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2022-04-06 09:40:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:43,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 09:40:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:43,732 INFO L225 Difference]: With dead ends: 129 [2022-04-06 09:40:43,732 INFO L226 Difference]: Without dead ends: 111 [2022-04-06 09:40:43,734 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-06 09:40:43,736 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:43,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-06 09:40:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2022-04-06 09:40:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 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-06 09:40:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-04-06 09:40:43,761 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2022-04-06 09:40:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:43,762 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-04-06 09:40:43,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 09:40:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-06 09:40:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 09:40:43,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:43,763 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:43,764 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 09:40:43,764 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:43,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1731615896, now seen corresponding path program 1 times [2022-04-06 09:40:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:43,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785611123] [2022-04-06 09:40:43,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:43,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:43,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-06 09:40:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:43,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785611123] [2022-04-06 09:40:43,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785611123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:43,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:43,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855317810] [2022-04-06 09:40:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:43,831 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:43,832 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 09:40:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,013 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-04-06 09:40:44,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:44,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 09:40:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,017 INFO L225 Difference]: With dead ends: 111 [2022-04-06 09:40:44,017 INFO L226 Difference]: Without dead ends: 109 [2022-04-06 09:40:44,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:44,019 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 218 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-06 09:40:44,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2022-04-06 09:40:44,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 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-06 09:40:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-06 09:40:44,038 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2022-04-06 09:40:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,038 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-06 09:40:44,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-06 09:40:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-06 09:40:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-06 09:40:44,039 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,039 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-06 09:40:44,040 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1228530226, now seen corresponding path program 1 times [2022-04-06 09:40:44,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457673201] [2022-04-06 09:40:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,127 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-06 09:40:44,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457673201] [2022-04-06 09:40:44,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457673201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290404394] [2022-04-06 09:40:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:44,130 INFO L87 Difference]: Start difference. First operand 71 states and 75 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-06 09:40:44,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,231 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-06 09:40:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:44,232 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-06 09:40:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,240 INFO L225 Difference]: With dead ends: 73 [2022-04-06 09:40:44,240 INFO L226 Difference]: Without dead ends: 71 [2022-04-06 09:40:44,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:44,243 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 132 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-06 09:40:44,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-04-06 09:40:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 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-06 09:40:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-04-06 09:40:44,255 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2022-04-06 09:40:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,255 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-04-06 09:40:44,255 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-06 09:40:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-06 09:40:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-06 09:40:44,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,257 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-06 09:40:44,259 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash -281829774, now seen corresponding path program 1 times [2022-04-06 09:40:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353937279] [2022-04-06 09:40:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,316 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-06 09:40:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353937279] [2022-04-06 09:40:44,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353937279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886903143] [2022-04-06 09:40:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:44,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:44,317 INFO L87 Difference]: Start difference. First operand 69 states and 73 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-06 09:40:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,425 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-06 09:40:44,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:44,426 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-06 09:40:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,426 INFO L225 Difference]: With dead ends: 71 [2022-04-06 09:40:44,426 INFO L226 Difference]: Without dead ends: 69 [2022-04-06 09:40:44,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:44,430 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 126 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-06 09:40:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-06 09:40:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 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-06 09:40:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-06 09:40:44,439 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2022-04-06 09:40:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,439 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-06 09:40:44,440 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-06 09:40:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-06 09:40:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 09:40:44,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,440 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,440 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-06 09:40:44,440 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 570269930, now seen corresponding path program 1 times [2022-04-06 09:40:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347483110] [2022-04-06 09:40:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,481 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-06 09:40:44,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347483110] [2022-04-06 09:40:44,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347483110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:44,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485986541] [2022-04-06 09:40:44,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,482 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:44,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:44,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:44,483 INFO L87 Difference]: Start difference. First operand 67 states and 71 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-06 09:40:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,551 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-06 09:40:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:44,552 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-06 09:40:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,553 INFO L225 Difference]: With dead ends: 69 [2022-04-06 09:40:44,553 INFO L226 Difference]: Without dead ends: 65 [2022-04-06 09:40:44,553 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-06 09:40:44,554 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-06 09:40:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-06 09:40:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 states have internal predecessors, (64), 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-06 09:40:44,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-04-06 09:40:44,562 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2022-04-06 09:40:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,563 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-04-06 09:40:44,563 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-06 09:40:44,563 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-04-06 09:40:44,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 09:40:44,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,563 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,563 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-06 09:40:44,564 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -146756306, now seen corresponding path program 1 times [2022-04-06 09:40:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827567866] [2022-04-06 09:40:44,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,609 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-06 09:40:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827567866] [2022-04-06 09:40:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827567866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125397157] [2022-04-06 09:40:44,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:44,611 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,726 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-04-06 09:40:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-06 09:40:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,726 INFO L225 Difference]: With dead ends: 95 [2022-04-06 09:40:44,727 INFO L226 Difference]: Without dead ends: 93 [2022-04-06 09:40:44,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:44,728 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 90 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 153 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-06 09:40:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2022-04-06 09:40:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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-06 09:40:44,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2022-04-06 09:40:44,743 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2022-04-06 09:40:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,743 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2022-04-06 09:40:44,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2022-04-06 09:40:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 09:40:44,743 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,744 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,744 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-06 09:40:44,744 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -146755279, now seen corresponding path program 1 times [2022-04-06 09:40:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792338370] [2022-04-06 09:40:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,809 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-06 09:40:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792338370] [2022-04-06 09:40:44,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792338370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069355312] [2022-04-06 09:40:44,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:44,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:44,810 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:44,941 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-04-06 09:40:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:44,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-06 09:40:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:44,942 INFO L225 Difference]: With dead ends: 104 [2022-04-06 09:40:44,942 INFO L226 Difference]: Without dead ends: 102 [2022-04-06 09:40:44,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:44,943 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:44,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 157 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-06 09:40:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 59. [2022-04-06 09:40:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 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-06 09:40:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-04-06 09:40:44,946 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2022-04-06 09:40:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:44,946 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-04-06 09:40:44,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-04-06 09:40:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-06 09:40:44,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:44,947 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:44,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-06 09:40:44,947 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -146787122, now seen corresponding path program 1 times [2022-04-06 09:40:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:44,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597845092] [2022-04-06 09:40:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:44,979 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-06 09:40:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:44,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597845092] [2022-04-06 09:40:44,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597845092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:44,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:44,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:44,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8074260] [2022-04-06 09:40:44,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:44,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:44,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:44,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:44,980 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-06 09:40:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,036 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-06 09:40:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:45,036 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-06 09:40:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,037 INFO L225 Difference]: With dead ends: 61 [2022-04-06 09:40:45,037 INFO L226 Difference]: Without dead ends: 57 [2022-04-06 09:40:45,037 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-06 09:40:45,038 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,038 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 129 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-06 09:40:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-06 09:40:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 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-06 09:40:45,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-04-06 09:40:45,046 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2022-04-06 09:40:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,046 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-04-06 09:40:45,046 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-06 09:40:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-04-06 09:40:45,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 09:40:45,049 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,049 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:45,049 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-06 09:40:45,050 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash 499454240, now seen corresponding path program 1 times [2022-04-06 09:40:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141112453] [2022-04-06 09:40:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,093 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-06 09:40:45,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:45,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141112453] [2022-04-06 09:40:45,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141112453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:45,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:45,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:45,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063789186] [2022-04-06 09:40:45,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:45,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:45,095 INFO L87 Difference]: Start difference. First operand 55 states and 59 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-06 09:40:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,185 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-06 09:40:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:45,185 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-06 09:40:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,186 INFO L225 Difference]: With dead ends: 74 [2022-04-06 09:40:45,186 INFO L226 Difference]: Without dead ends: 72 [2022-04-06 09:40:45,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:45,188 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 116 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-06 09:40:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2022-04-06 09:40:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-04-06 09:40:45,192 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2022-04-06 09:40:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,193 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-04-06 09:40:45,193 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-06 09:40:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-04-06 09:40:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 09:40:45,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,194 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:45,194 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-06 09:40:45,194 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 499486052, now seen corresponding path program 1 times [2022-04-06 09:40:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634997549] [2022-04-06 09:40:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,272 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-06 09:40:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:45,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634997549] [2022-04-06 09:40:45,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634997549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:45,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:45,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882522357] [2022-04-06 09:40:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:45,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:45,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:45,274 INFO L87 Difference]: Start difference. First operand 53 states and 57 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-06 09:40:45,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,341 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-06 09:40:45,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:45,342 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-06 09:40:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,342 INFO L225 Difference]: With dead ends: 55 [2022-04-06 09:40:45,342 INFO L226 Difference]: Without dead ends: 53 [2022-04-06 09:40:45,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:45,343 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-06 09:40:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-06 09:40:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-06 09:40:45,346 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2022-04-06 09:40:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,347 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-06 09:40:45,347 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-06 09:40:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-06 09:40:45,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 09:40:45,348 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,348 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:45,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-06 09:40:45,348 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,349 INFO L85 PathProgramCache]: Analyzing trace with hash -254476890, now seen corresponding path program 1 times [2022-04-06 09:40:45,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637076179] [2022-04-06 09:40:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,448 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-06 09:40:45,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:45,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637076179] [2022-04-06 09:40:45,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637076179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:45,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:45,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132158658] [2022-04-06 09:40:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:45,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:45,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:45,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:45,450 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,579 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-04-06 09:40:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:45,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-06 09:40:45,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,580 INFO L225 Difference]: With dead ends: 110 [2022-04-06 09:40:45,580 INFO L226 Difference]: Without dead ends: 108 [2022-04-06 09:40:45,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:45,581 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 210 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-06 09:40:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2022-04-06 09:40:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 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-06 09:40:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-06 09:40:45,585 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2022-04-06 09:40:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,585 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-06 09:40:45,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-06 09:40:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-06 09:40:45,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:45,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-06 09:40:45,586 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,587 INFO L85 PathProgramCache]: Analyzing trace with hash -254445051, now seen corresponding path program 1 times [2022-04-06 09:40:45,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133335506] [2022-04-06 09:40:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,666 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-06 09:40:45,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:45,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133335506] [2022-04-06 09:40:45,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133335506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:45,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:45,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:45,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110287765] [2022-04-06 09:40:45,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:45,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:45,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:45,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:45,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:45,667 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,799 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-04-06 09:40:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-06 09:40:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,800 INFO L225 Difference]: With dead ends: 108 [2022-04-06 09:40:45,800 INFO L226 Difference]: Without dead ends: 106 [2022-04-06 09:40:45,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:45,801 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,801 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 225 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-06 09:40:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2022-04-06 09:40:45,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 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-06 09:40:45,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-04-06 09:40:45,804 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2022-04-06 09:40:45,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,804 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-04-06 09:40:45,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-04-06 09:40:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 09:40:45,804 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,804 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-06 09:40:45,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-06 09:40:45,805 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1696786440, now seen corresponding path program 1 times [2022-04-06 09:40:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785414071] [2022-04-06 09:40:45,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:45,869 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-06 09:40:45,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:45,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785414071] [2022-04-06 09:40:45,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785414071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:45,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:45,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:45,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740614638] [2022-04-06 09:40:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:45,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:45,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:45,871 INFO L87 Difference]: Start difference. First operand 58 states and 63 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-06 09:40:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:45,975 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2022-04-06 09:40:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:45,976 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-06 09:40:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:45,977 INFO L225 Difference]: With dead ends: 96 [2022-04-06 09:40:45,977 INFO L226 Difference]: Without dead ends: 94 [2022-04-06 09:40:45,977 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:45,978 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 68 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:45,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 146 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-06 09:40:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 64. [2022-04-06 09:40:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 60 states have internal predecessors, (68), 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-06 09:40:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-06 09:40:45,982 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 18 [2022-04-06 09:40:45,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:45,982 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-06 09:40:45,982 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-06 09:40:45,982 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-06 09:40:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 09:40:45,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:45,983 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-06 09:40:45,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-06 09:40:45,983 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:45,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1696755622, now seen corresponding path program 1 times [2022-04-06 09:40:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:45,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539259788] [2022-04-06 09:40:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:45,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,012 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-06 09:40:46,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539259788] [2022-04-06 09:40:46,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539259788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-06 09:40:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028311718] [2022-04-06 09:40:46,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-06 09:40:46,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-06 09:40:46,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-06 09:40:46,013 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-06 09:40:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,103 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-04-06 09:40:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 09:40:46,104 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-06 09:40:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,104 INFO L225 Difference]: With dead ends: 84 [2022-04-06 09:40:46,104 INFO L226 Difference]: Without dead ends: 82 [2022-04-06 09:40:46,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:46,105 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 65 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 108 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-06 09:40:46,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2022-04-06 09:40:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 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-06 09:40:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-06 09:40:46,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2022-04-06 09:40:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,111 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-06 09:40:46,111 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-06 09:40:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-06 09:40:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-06 09:40:46,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,112 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-06 09:40:46,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-06 09:40:46,113 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1695800260, now seen corresponding path program 1 times [2022-04-06 09:40:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824145985] [2022-04-06 09:40:46,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,208 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-06 09:40:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824145985] [2022-04-06 09:40:46,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824145985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909448769] [2022-04-06 09:40:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,209 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:46,210 INFO L87 Difference]: Start difference. First operand 62 states and 69 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-06 09:40:46,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,323 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-06 09:40:46,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:46,324 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-06 09:40:46,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,324 INFO L225 Difference]: With dead ends: 74 [2022-04-06 09:40:46,324 INFO L226 Difference]: Without dead ends: 70 [2022-04-06 09:40:46,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:46,326 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 136 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-06 09:40:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2022-04-06 09:40:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 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-06 09:40:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-04-06 09:40:46,330 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2022-04-06 09:40:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,330 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-04-06 09:40:46,330 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-06 09:40:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-06 09:40:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-06 09:40:46,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,332 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-06 09:40:46,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-06 09:40:46,332 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1059815414, now seen corresponding path program 1 times [2022-04-06 09:40:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338264484] [2022-04-06 09:40:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,397 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-06 09:40:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338264484] [2022-04-06 09:40:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338264484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910582333] [2022-04-06 09:40:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:46,398 INFO L87 Difference]: Start difference. First operand 63 states and 70 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-06 09:40:46,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,516 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-06 09:40:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:46,516 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-06 09:40:46,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,517 INFO L225 Difference]: With dead ends: 91 [2022-04-06 09:40:46,517 INFO L226 Difference]: Without dead ends: 89 [2022-04-06 09:40:46,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-06 09:40:46,518 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-06 09:40:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2022-04-06 09:40:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 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-06 09:40:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-04-06 09:40:46,521 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2022-04-06 09:40:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,521 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-04-06 09:40:46,521 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-06 09:40:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-04-06 09:40:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 09:40:46,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,522 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-06 09:40:46,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-06 09:40:46,522 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1475844669, now seen corresponding path program 1 times [2022-04-06 09:40:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162205270] [2022-04-06 09:40:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,551 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-06 09:40:46,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162205270] [2022-04-06 09:40:46,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162205270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:46,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13548425] [2022-04-06 09:40:46,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:46,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:46,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:46,552 INFO L87 Difference]: Start difference. First operand 66 states and 73 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-06 09:40:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,601 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-04-06 09:40:46,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:46,601 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-06 09:40:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,601 INFO L225 Difference]: With dead ends: 66 [2022-04-06 09:40:46,601 INFO L226 Difference]: Without dead ends: 64 [2022-04-06 09:40:46,602 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-06 09:40:46,602 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,602 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-06 09:40:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-06 09:40:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 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-06 09:40:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-06 09:40:46,605 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2022-04-06 09:40:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,605 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-06 09:40:46,605 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-06 09:40:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-06 09:40:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-06 09:40:46,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,606 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-06 09:40:46,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-06 09:40:46,606 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1493454195, now seen corresponding path program 1 times [2022-04-06 09:40:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719441065] [2022-04-06 09:40:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,635 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-06 09:40:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719441065] [2022-04-06 09:40:46,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719441065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 09:40:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46519595] [2022-04-06 09:40:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 09:40:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 09:40:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 09:40:46,637 INFO L87 Difference]: Start difference. First operand 64 states and 71 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-06 09:40:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,685 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2022-04-06 09:40:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 09:40:46,686 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-06 09:40:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,686 INFO L225 Difference]: With dead ends: 64 [2022-04-06 09:40:46,686 INFO L226 Difference]: Without dead ends: 60 [2022-04-06 09:40:46,686 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-06 09:40:46,687 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,687 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 101 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 09:40:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-06 09:40:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-06 09:40:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 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-06 09:40:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-04-06 09:40:46,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2022-04-06 09:40:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,690 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-04-06 09:40:46,690 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-06 09:40:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-06 09:40:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 09:40:46,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,690 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-06 09:40:46,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-06 09:40:46,690 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 947327570, now seen corresponding path program 1 times [2022-04-06 09:40:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353361835] [2022-04-06 09:40:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,732 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-06 09:40:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353361835] [2022-04-06 09:40:46,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353361835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:46,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:46,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-06 09:40:46,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562561479] [2022-04-06 09:40:46,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:46,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-06 09:40:46,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:46,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-06 09:40:46,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-06 09:40:46,733 INFO L87 Difference]: Start difference. First operand 60 states and 67 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-06 09:40:46,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:46,835 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-04-06 09:40:46,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:46,836 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-06 09:40:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:46,836 INFO L225 Difference]: With dead ends: 75 [2022-04-06 09:40:46,836 INFO L226 Difference]: Without dead ends: 73 [2022-04-06 09:40:46,837 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-06 09:40:46,837 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:46,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:46,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-06 09:40:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2022-04-06 09:40:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 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-06 09:40:46,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-06 09:40:46,840 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2022-04-06 09:40:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:46,840 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-06 09:40:46,840 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-06 09:40:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-06 09:40:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 09:40:46,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:46,841 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:46,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-06 09:40:46,841 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:46,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:46,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1627954806, now seen corresponding path program 1 times [2022-04-06 09:40:46,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:46,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398998895] [2022-04-06 09:40:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:40:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398998895] [2022-04-06 09:40:46,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398998895] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:40:46,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532902381] [2022-04-06 09:40:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:46,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:46,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:40:46,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 09:40:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:46,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 09:40:46,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:40:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:40:47,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:40:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 09:40:47,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532902381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:40:47,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:40:47,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-06 09:40:47,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546489072] [2022-04-06 09:40:47,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:40:47,262 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 09:40:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:47,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 09:40:47,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-06 09:40:47,263 INFO L87 Difference]: Start difference. First operand 55 states and 62 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:47,448 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-04-06 09:40:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-06 09:40:47,448 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-06 09:40:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:47,449 INFO L225 Difference]: With dead ends: 117 [2022-04-06 09:40:47,449 INFO L226 Difference]: Without dead ends: 115 [2022-04-06 09:40:47,449 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-06 09:40:47,450 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 277 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:47,450 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 123 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-06 09:40:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 51. [2022-04-06 09:40:47,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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-06 09:40:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-04-06 09:40:47,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2022-04-06 09:40:47,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:47,454 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-04-06 09:40:47,454 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-04-06 09:40:47,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 09:40:47,454 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:47,454 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 09:40:47,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-06 09:40:47,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:47,655 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1627986645, now seen corresponding path program 1 times [2022-04-06 09:40:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:47,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842051148] [2022-04-06 09:40:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:40:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842051148] [2022-04-06 09:40:47,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842051148] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-06 09:40:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817161871] [2022-04-06 09:40:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:47,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 09:40:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 09:40:47,720 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 09:40:47,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 09:40:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:47,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 09:40:47,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 09:40:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 09:40:47,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 09:40:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-06 09:40:47,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817161871] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 09:40:47,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-06 09:40:47,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 14 [2022-04-06 09:40:47,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071474185] [2022-04-06 09:40:47,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-06 09:40:47,990 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 09:40:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 09:40:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-06 09:40:47,991 INFO L87 Difference]: Start difference. First operand 51 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:48,208 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2022-04-06 09:40:48,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-06 09:40:48,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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-06 09:40:48,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:48,209 INFO L225 Difference]: With dead ends: 98 [2022-04-06 09:40:48,209 INFO L226 Difference]: Without dead ends: 96 [2022-04-06 09:40:48,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2022-04-06 09:40:48,210 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 250 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:48,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 144 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-06 09:40:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 44. [2022-04-06 09:40:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 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-06 09:40:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-04-06 09:40:48,213 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2022-04-06 09:40:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:48,213 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-04-06 09:40:48,214 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,214 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-04-06 09:40:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 09:40:48,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:48,214 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] [2022-04-06 09:40:48,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 09:40:48,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-06 09:40:48,424 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:48,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1633367914, now seen corresponding path program 1 times [2022-04-06 09:40:48,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:48,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223245215] [2022-04-06 09:40:48,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:48,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:48,475 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-06 09:40:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223245215] [2022-04-06 09:40:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223245215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:48,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 09:40:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391814169] [2022-04-06 09:40:48,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:48,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:40:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:40:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:48,476 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:48,553 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-04-06 09:40:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-06 09:40:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-06 09:40:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:48,554 INFO L225 Difference]: With dead ends: 56 [2022-04-06 09:40:48,554 INFO L226 Difference]: Without dead ends: 54 [2022-04-06 09:40:48,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-04-06 09:40:48,555 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:48,556 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 53 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-06 09:40:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2022-04-06 09:40:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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-06 09:40:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-04-06 09:40:48,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2022-04-06 09:40:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:48,559 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-04-06 09:40:48,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-04-06 09:40:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 09:40:48,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 09:40:48,559 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] [2022-04-06 09:40:48,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-06 09:40:48,560 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-06 09:40:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 09:40:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1634354094, now seen corresponding path program 1 times [2022-04-06 09:40:48,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 09:40:48,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415621552] [2022-04-06 09:40:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 09:40:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 09:40:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 09:40:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 09:40:48,615 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-06 09:40:48,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 09:40:48,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415621552] [2022-04-06 09:40:48,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415621552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 09:40:48,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 09:40:48,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 09:40:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162764083] [2022-04-06 09:40:48,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 09:40:48,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 09:40:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 09:40:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 09:40:48,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-06 09:40:48,616 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 09:40:48,690 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-06 09:40:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 09:40:48,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-06 09:40:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 09:40:48,691 INFO L225 Difference]: With dead ends: 39 [2022-04-06 09:40:48,691 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 09:40:48,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-06 09:40:48,692 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 09:40:48,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 09:40:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 09:40:48,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 09:40:48,693 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-06 09:40:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 09:40:48,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-04-06 09:40:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 09:40:48,694 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 09:40:48,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 09:40:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 09:40:48,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 09:40:48,696 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-06 09:40:48,696 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-06 09:40:48,696 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-06 09:40:48,696 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-06 09:40:48,697 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-06 09:40:48,698 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-06 09:40:48,698 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-06 09:40:48,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 09:42:24,431 WARN L232 SmtUtils]: Spent 1.60m on a formula simplification. DAG size of input: 88 DAG size of output: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 09:42:30,939 WARN L232 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 87 DAG size of output: 46 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 09:43:37,101 WARN L232 SmtUtils]: Spent 1.09m on a formula simplification. DAG size of input: 76 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-06 09:43:37,631 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 09:43:37,631 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 15 402) no Hoare annotation was computed. [2022-04-06 09:43:37,631 INFO L882 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 15 402) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L878 garLoopResultBuilder]: At program point L351(lines 32 395) the Hoare annotation is: (or (and (let ((.cse0 (<= main_~main__t~0 1))) (let ((.cse1 (<= 1 main_~__VERIFIER_assert__cond~17)) (.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~17 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse6 (<= 1 main_~main__t~0))) (or (and .cse3 .cse4 .cse5 .cse6 (not (= main_~__VERIFIER_assert__cond~19 0))) (and .cse0 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse2 (<= 1 main_~__VERIFIER_assert__cond~19))))) (not (<= main_~main__tagbuf_len~0 main_~main__t~0))) (and (= main_~main__t~0 0) (< 0 main_~main__tagbuf_len~0))) [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L878 garLoopResultBuilder]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 (<= 1 main_~main__t~0)) (and .cse3 .cse1))))) (or (and .cse2 (not (= main_~__VERIFIER_assert__cond~18 0))) (and .cse2 .cse1))))) (or (and .cse0 .cse1 (< 0 main_~main__tagbuf_len~0)) (and (<= 1 main_~__VERIFIER_assert__cond~19) .cse0 (not (<= main_~main__tagbuf_len~0 main_~main__t~0)))))) [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L878 garLoopResultBuilder]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-04-06 09:43:37,632 INFO L882 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L885 garLoopResultBuilder]: At program point L314(lines 32 395) the Hoare annotation is: true [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-04-06 09:43:37,633 INFO L878 garLoopResultBuilder]: At program point L249(lines 101 251) the Hoare annotation is: (and (not (<= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2022-04-06 09:43:37,633 INFO L882 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-04-06 09:43:37,634 INFO L882 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-04-06 09:43:37,635 INFO L882 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-04-06 09:43:37,636 INFO L882 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-04-06 09:43:37,637 INFO L882 garLoopResultBuilder]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-04-06 09:43:37,640 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, 1, 1, 1, 1] [2022-04-06 09:43:37,640 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 09:43:37,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:43:37 BasicIcfg [2022-04-06 09:43:37,665 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 09:43:37,665 INFO L158 Benchmark]: Toolchain (without parser) took 175072.94ms. Allocated memory was 182.5MB in the beginning and 440.4MB in the end (delta: 257.9MB). Free memory was 130.4MB in the beginning and 365.7MB in the end (delta: -235.3MB). Peak memory consumption was 243.9MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,665 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 146.7MB in the beginning and 146.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 09:43:37,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.79ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 151.3MB in the end (delta: -21.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,666 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,666 INFO L158 Benchmark]: RCFGBuilder took 292.68ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 134.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,666 INFO L158 Benchmark]: IcfgTransformer took 17.33ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,666 INFO L158 Benchmark]: TraceAbstraction took 174464.99ms. Allocated memory was 182.5MB in the beginning and 440.4MB in the end (delta: 257.9MB). Free memory was 132.4MB in the beginning and 365.7MB in the end (delta: -233.3MB). Peak memory consumption was 245.4MB. Max. memory is 8.0GB. [2022-04-06 09:43:37,667 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 182.5MB. Free memory was 146.7MB in the beginning and 146.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.79ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 151.3MB in the end (delta: -21.2MB). Peak memory consumption was 11.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 182.5MB. Free memory was 151.3MB in the beginning and 149.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.68ms. Allocated memory is still 182.5MB. Free memory was 149.2MB in the beginning and 134.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 17.33ms. Allocated memory is still 182.5MB. Free memory was 134.5MB in the beginning and 132.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 174464.99ms. Allocated memory was 182.5MB in the beginning and 440.4MB in the end (delta: 257.9MB). Free memory was 132.4MB in the beginning and 365.7MB in the end (delta: -233.3MB). Peak memory consumption was 245.4MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: 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 3 procedures, 80 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 174.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 168.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1813 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1813 mSDsluCounter, 3065 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1972 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3603 IncrementalHoareTripleChecker+Invalid, 3823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1093 mSDtfsCounter, 3603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 147 SyntacticMatches, 10 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 193, 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, 23 MinimizatonAttempts, 509 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 259 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3325031 FormulaSimplificationTreeSizeReduction, 168.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 6109741 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1950 SizeOfPredicates, 6 NumberOfNonLiveVariables, 301 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t <= 1 && 1 <= __VERIFIER_assert__cond) && (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t))) || ((1 <= __VERIFIER_assert__cond && (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((main__t <= 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t))) && 1 <= __VERIFIER_assert__cond)) && !(main__tagbuf_len <= main__t)) || (main__t == 0 && 0 < main__tagbuf_len) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0)) && main__t == 0) && 0 < main__tagbuf_len) || ((1 <= __VERIFIER_assert__cond && ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && !(__VERIFIER_assert__cond == 0)) || (((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0))) && !(main__tagbuf_len <= main__t)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len RESULT: Ultimate proved your program to be correct! [2022-04-06 09:43:37,697 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...