/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:21:50,533 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:21:50,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:21:50,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:21:50,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:21:50,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:21:50,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:21:50,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:21:50,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:21:50,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:21:50,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:21:50,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:21:50,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:21:50,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:21:50,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:21:50,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:21:50,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:21:50,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:21:50,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:21:50,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:21:50,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:21:50,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:21:50,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:21:50,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:21:50,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:21:50,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:21:50,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:21:50,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:21:50,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:21:50,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:21:50,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:21:50,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:21:50,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:21:50,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:21:50,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:21:50,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:21:50,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:21:50,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:21:50,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:21:50,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:21:50,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:21:50,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:21:50,638 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:21:50,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:21:50,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:21:50,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:21:50,639 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:21:50,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:21:50,639 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:21:50,640 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:21:50,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:21:50,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:21:50,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:21:50,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:21:50,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:21:50,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:21:50,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:21:50,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 12:21:50,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:21:50,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:21:50,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:21:50,912 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:21:50,913 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:21:50,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2021-05-02 12:21:50,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91762d88e/0cbc7648dd6d4070bfdf01a11ef9b185/FLAG40e2bde5d [2021-05-02 12:21:51,396 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:21:51,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2021-05-02 12:21:51,418 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91762d88e/0cbc7648dd6d4070bfdf01a11ef9b185/FLAG40e2bde5d [2021-05-02 12:21:51,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91762d88e/0cbc7648dd6d4070bfdf01a11ef9b185 [2021-05-02 12:21:51,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:21:51,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:21:51,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:51,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:21:51,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:21:51,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:51" (1/1) ... [2021-05-02 12:21:51,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1393323b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:51, skipping insertion in model container [2021-05-02 12:21:51,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:51" (1/1) ... [2021-05-02 12:21:51,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:21:51,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:21:51,634 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2021-05-02 12:21:51,637 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2021-05-02 12:21:51,639 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2021-05-02 12:21:51,640 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2021-05-02 12:21:51,641 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2021-05-02 12:21:51,645 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2021-05-02 12:21:51,647 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2021-05-02 12:21:51,648 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2021-05-02 12:21:51,649 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2021-05-02 12:21:51,650 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2021-05-02 12:21:51,654 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2021-05-02 12:21:51,655 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2021-05-02 12:21:51,657 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2021-05-02 12:21:51,658 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2021-05-02 12:21:51,798 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2021-05-02 12:21:51,801 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2021-05-02 12:21:51,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:51,871 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:21:51,884 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2021-05-02 12:21:51,884 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2021-05-02 12:21:51,885 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2021-05-02 12:21:51,885 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2021-05-02 12:21:51,886 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2021-05-02 12:21:51,886 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2021-05-02 12:21:51,887 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2021-05-02 12:21:51,888 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2021-05-02 12:21:51,888 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2021-05-02 12:21:51,897 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2021-05-02 12:21:51,898 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2021-05-02 12:21:51,899 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2021-05-02 12:21:51,900 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2021-05-02 12:21:51,900 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2021-05-02 12:21:52,014 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2021-05-02 12:21:52,016 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2021-05-02 12:21:52,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:52,035 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:21:52,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52 WrapperNode [2021-05-02 12:21:52,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:52,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:21:52,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:21:52,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:21:52,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... [2021-05-02 12:21:52,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:21:52,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:21:52,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:21:52,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:21:52,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:21:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:21:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:21:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:21:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:21:52,196 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:21:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:21:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:21:52,196 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:21:52,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:21:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:21:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:21:52,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:21:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:21:52,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:21:53,140 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:21:53,140 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 12:21:53,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:53 BoogieIcfgContainer [2021-05-02 12:21:53,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:21:53,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:21:53,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:21:53,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:21:53,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:21:51" (1/3) ... [2021-05-02 12:21:53,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be8fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:53, skipping insertion in model container [2021-05-02 12:21:53,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:52" (2/3) ... [2021-05-02 12:21:53,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be8fe15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:53, skipping insertion in model container [2021-05-02 12:21:53,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:53" (3/3) ... [2021-05-02 12:21:53,146 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2021-05-02 12:21:53,150 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:21:53,152 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-02 12:21:53,162 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-02 12:21:53,177 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:21:53,177 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:21:53,177 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:21:53,177 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:21:53,177 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:21:53,177 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:21:53,177 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:21:53,177 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:21:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 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) [2021-05-02 12:21:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 12:21:53,194 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:53,195 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:53,195 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:53,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash -191009829, now seen corresponding path program 1 times [2021-05-02 12:21:53,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:53,203 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240016042] [2021-05-02 12:21:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:53,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:53,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:53,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240016042] [2021-05-02 12:21:53,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240016042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:53,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:53,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:53,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151709933] [2021-05-02 12:21:53,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:53,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:53,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:53,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:53,387 INFO L87 Difference]: Start difference. First operand has 309 states, 288 states have (on average 1.9652777777777777) internal successors, (566), 304 states have internal predecessors, (566), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:54,559 INFO L93 Difference]: Finished difference Result 327 states and 589 transitions. [2021-05-02 12:21:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:54,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 12:21:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:54,578 INFO L225 Difference]: With dead ends: 327 [2021-05-02 12:21:54,578 INFO L226 Difference]: Without dead ends: 307 [2021-05-02 12:21:54,580 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 112.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:21:54,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-05-02 12:21:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2021-05-02 12:21:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 284 states have (on average 1.4859154929577465) internal successors, (422), 298 states have internal predecessors, (422), 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) [2021-05-02 12:21:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 425 transitions. [2021-05-02 12:21:54,639 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 425 transitions. Word has length 11 [2021-05-02 12:21:54,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:54,640 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 425 transitions. [2021-05-02 12:21:54,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 425 transitions. [2021-05-02 12:21:54,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:21:54,640 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:54,641 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:54,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:21:54,641 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1626334337, now seen corresponding path program 1 times [2021-05-02 12:21:54,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:54,643 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333339415] [2021-05-02 12:21:54,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:54,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:54,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:54,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333339415] [2021-05-02 12:21:54,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333339415] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:54,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:54,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:54,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677414994] [2021-05-02 12:21:54,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:54,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:54,764 INFO L87 Difference]: Start difference. First operand 302 states and 425 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:55,523 INFO L93 Difference]: Finished difference Result 312 states and 435 transitions. [2021-05-02 12:21:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 12:21:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:55,525 INFO L225 Difference]: With dead ends: 312 [2021-05-02 12:21:55,525 INFO L226 Difference]: Without dead ends: 304 [2021-05-02 12:21:55,526 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 97.6ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-05-02 12:21:55,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 297. [2021-05-02 12:21:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 280 states have (on average 1.275) internal successors, (357), 293 states have internal predecessors, (357), 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) [2021-05-02 12:21:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 360 transitions. [2021-05-02 12:21:55,532 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 360 transitions. Word has length 12 [2021-05-02 12:21:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 360 transitions. [2021-05-02 12:21:55,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 360 transitions. [2021-05-02 12:21:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:21:55,532 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:55,532 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:55,532 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:21:55,532 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:55,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1610084340, now seen corresponding path program 1 times [2021-05-02 12:21:55,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:55,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455689789] [2021-05-02 12:21:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:55,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:55,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:55,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455689789] [2021-05-02 12:21:55,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455689789] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:55,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:55,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:55,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516038227] [2021-05-02 12:21:55,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:55,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:55,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:55,584 INFO L87 Difference]: Start difference. First operand 297 states and 360 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) [2021-05-02 12:21:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:56,173 INFO L93 Difference]: Finished difference Result 297 states and 360 transitions. [2021-05-02 12:21:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:56,173 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 [2021-05-02 12:21:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:56,174 INFO L225 Difference]: With dead ends: 297 [2021-05-02 12:21:56,174 INFO L226 Difference]: Without dead ends: 295 [2021-05-02 12:21:56,175 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-05-02 12:21:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2021-05-02 12:21:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 291 states have internal predecessors, (355), 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) [2021-05-02 12:21:56,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2021-05-02 12:21:56,180 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 12 [2021-05-02 12:21:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:56,180 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2021-05-02 12:21:56,180 INFO L481 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) [2021-05-02 12:21:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2021-05-02 12:21:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 12:21:56,181 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:56,181 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:56,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:21:56,181 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1626996098, now seen corresponding path program 1 times [2021-05-02 12:21:56,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:56,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969830793] [2021-05-02 12:21:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:56,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:56,243 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:56,243 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969830793] [2021-05-02 12:21:56,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969830793] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:56,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:56,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:56,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118493354] [2021-05-02 12:21:56,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:56,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:56,247 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-05-02 12:21:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:56,858 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2021-05-02 12:21:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2021-05-02 12:21:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:56,859 INFO L225 Difference]: With dead ends: 300 [2021-05-02 12:21:56,859 INFO L226 Difference]: Without dead ends: 298 [2021-05-02 12:21:56,860 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-05-02 12:21:56,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2021-05-02 12:21:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 282 states have (on average 1.2695035460992907) internal successors, (358), 294 states have internal predecessors, (358), 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) [2021-05-02 12:21:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 361 transitions. [2021-05-02 12:21:56,865 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 361 transitions. Word has length 13 [2021-05-02 12:21:56,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:56,865 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 361 transitions. [2021-05-02 12:21:56,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-05-02 12:21:56,865 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 361 transitions. [2021-05-02 12:21:56,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:21:56,866 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:56,866 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:56,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:21:56,866 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 175251398, now seen corresponding path program 1 times [2021-05-02 12:21:56,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:56,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709257706] [2021-05-02 12:21:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:56,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:56,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:56,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709257706] [2021-05-02 12:21:56,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709257706] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:56,920 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:56,920 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:56,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851456801] [2021-05-02 12:21:56,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:56,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:56,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:56,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:56,921 INFO L87 Difference]: Start difference. First operand 298 states and 361 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) [2021-05-02 12:21:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:57,597 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-05-02 12:21:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:57,598 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 [2021-05-02 12:21:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:57,603 INFO L225 Difference]: With dead ends: 298 [2021-05-02 12:21:57,603 INFO L226 Difference]: Without dead ends: 296 [2021-05-02 12:21:57,603 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-05-02 12:21:57,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-05-02 12:21:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 292 states have internal predecessors, (356), 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) [2021-05-02 12:21:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 359 transitions. [2021-05-02 12:21:57,608 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 359 transitions. Word has length 15 [2021-05-02 12:21:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:57,609 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 359 transitions. [2021-05-02 12:21:57,609 INFO L481 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) [2021-05-02 12:21:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 359 transitions. [2021-05-02 12:21:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:21:57,610 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:57,610 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:57,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:21:57,610 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1137829144, now seen corresponding path program 1 times [2021-05-02 12:21:57,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:57,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628155733] [2021-05-02 12:21:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:57,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:57,685 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:57,685 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628155733] [2021-05-02 12:21:57,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628155733] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:57,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:57,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:57,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895926229] [2021-05-02 12:21:57,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:57,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:57,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:57,687 INFO L87 Difference]: Start difference. First operand 296 states and 359 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) [2021-05-02 12:21:58,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:58,270 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2021-05-02 12:21:58,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:58,271 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 [2021-05-02 12:21:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:58,272 INFO L225 Difference]: With dead ends: 296 [2021-05-02 12:21:58,272 INFO L226 Difference]: Without dead ends: 292 [2021-05-02 12:21:58,272 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-02 12:21:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-05-02 12:21:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 288 states have internal predecessors, (352), 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) [2021-05-02 12:21:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2021-05-02 12:21:58,277 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 16 [2021-05-02 12:21:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:58,277 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2021-05-02 12:21:58,277 INFO L481 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) [2021-05-02 12:21:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2021-05-02 12:21:58,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:21:58,278 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:58,278 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:58,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:21:58,278 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 926233143, now seen corresponding path program 1 times [2021-05-02 12:21:58,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:58,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226211259] [2021-05-02 12:21:58,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:58,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:58,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:58,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226211259] [2021-05-02 12:21:58,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226211259] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:58,329 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:58,329 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:58,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748002692] [2021-05-02 12:21:58,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:58,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:58,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:58,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:58,330 INFO L87 Difference]: Start difference. First operand 292 states and 355 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) [2021-05-02 12:21:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:59,038 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2021-05-02 12:21:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:59,038 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 [2021-05-02 12:21:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:59,039 INFO L225 Difference]: With dead ends: 309 [2021-05-02 12:21:59,039 INFO L226 Difference]: Without dead ends: 307 [2021-05-02 12:21:59,040 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 79.4ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-05-02 12:21:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 290. [2021-05-02 12:21:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 277 states have (on average 1.263537906137184) internal successors, (350), 286 states have internal predecessors, (350), 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) [2021-05-02 12:21:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 353 transitions. [2021-05-02 12:21:59,044 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 353 transitions. Word has length 17 [2021-05-02 12:21:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:59,045 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 353 transitions. [2021-05-02 12:21:59,045 INFO L481 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) [2021-05-02 12:21:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 353 transitions. [2021-05-02 12:21:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:21:59,045 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:59,045 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:59,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 12:21:59,045 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash 927772343, now seen corresponding path program 1 times [2021-05-02 12:21:59,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:59,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868083365] [2021-05-02 12:21:59,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:59,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:59,105 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:59,105 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868083365] [2021-05-02 12:21:59,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868083365] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:59,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:59,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:59,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413978830] [2021-05-02 12:21:59,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:59,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:59,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:59,106 INFO L87 Difference]: Start difference. First operand 290 states and 353 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) [2021-05-02 12:21:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:59,806 INFO L93 Difference]: Finished difference Result 290 states and 353 transitions. [2021-05-02 12:21:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:59,809 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 [2021-05-02 12:21:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:59,810 INFO L225 Difference]: With dead ends: 290 [2021-05-02 12:21:59,810 INFO L226 Difference]: Without dead ends: 288 [2021-05-02 12:21:59,811 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 82.7ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-05-02 12:21:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-05-02 12:21:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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) [2021-05-02 12:21:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2021-05-02 12:21:59,815 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2021-05-02 12:21:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:59,816 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2021-05-02 12:21:59,816 INFO L481 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) [2021-05-02 12:21:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2021-05-02 12:21:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:21:59,816 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:59,816 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:59,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 12:21:59,817 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:21:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1470973679, now seen corresponding path program 1 times [2021-05-02 12:21:59,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:59,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279218430] [2021-05-02 12:21:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:59,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:59,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:59,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279218430] [2021-05-02 12:21:59,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279218430] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:59,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:59,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:21:59,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020456815] [2021-05-02 12:21:59,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:21:59,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:59,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:21:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:59,905 INFO L87 Difference]: Start difference. First operand 288 states and 351 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) [2021-05-02 12:22:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:00,657 INFO L93 Difference]: Finished difference Result 312 states and 377 transitions. [2021-05-02 12:22:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 12:22:00,658 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 [2021-05-02 12:22:00,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:00,659 INFO L225 Difference]: With dead ends: 312 [2021-05-02 12:22:00,659 INFO L226 Difference]: Without dead ends: 310 [2021-05-02 12:22:00,659 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 145.7ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:22:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-05-02 12:22:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2021-05-02 12:22:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 276 states have (on average 1.2608695652173914) internal successors, (348), 284 states have internal predecessors, (348), 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) [2021-05-02 12:22:00,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2021-05-02 12:22:00,664 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 17 [2021-05-02 12:22:00,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:00,664 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2021-05-02 12:22:00,664 INFO L481 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) [2021-05-02 12:22:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2021-05-02 12:22:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:22:00,665 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:00,665 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:00,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 12:22:00,665 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1350175097, now seen corresponding path program 1 times [2021-05-02 12:22:00,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:00,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643459401] [2021-05-02 12:22:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:00,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:00,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:00,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643459401] [2021-05-02 12:22:00,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643459401] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:00,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:00,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:22:00,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158538525] [2021-05-02 12:22:00,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:22:00,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:00,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:22:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:22:00,713 INFO L87 Difference]: Start difference. First operand 288 states and 351 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) [2021-05-02 12:22:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:01,593 INFO L93 Difference]: Finished difference Result 311 states and 376 transitions. [2021-05-02 12:22:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:22:01,594 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 [2021-05-02 12:22:01,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:01,596 INFO L225 Difference]: With dead ends: 311 [2021-05-02 12:22:01,596 INFO L226 Difference]: Without dead ends: 309 [2021-05-02 12:22:01,597 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:22:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-05-02 12:22:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2021-05-02 12:22:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 275 states have (on average 1.2581818181818183) internal successors, (346), 282 states have internal predecessors, (346), 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) [2021-05-02 12:22:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2021-05-02 12:22:01,602 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 18 [2021-05-02 12:22:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:01,603 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2021-05-02 12:22:01,603 INFO L481 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) [2021-05-02 12:22:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2021-05-02 12:22:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:22:01,605 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:01,605 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:01,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 12:22:01,605 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1351540517, now seen corresponding path program 1 times [2021-05-02 12:22:01,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:01,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378220023] [2021-05-02 12:22:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:01,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:01,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:01,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378220023] [2021-05-02 12:22:01,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378220023] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:01,748 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:01,749 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:01,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703896660] [2021-05-02 12:22:01,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:01,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:01,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:01,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:01,749 INFO L87 Difference]: Start difference. First operand 286 states and 349 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) [2021-05-02 12:22:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:02,467 INFO L93 Difference]: Finished difference Result 320 states and 387 transitions. [2021-05-02 12:22:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:22:02,467 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 [2021-05-02 12:22:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:02,469 INFO L225 Difference]: With dead ends: 320 [2021-05-02 12:22:02,469 INFO L226 Difference]: Without dead ends: 318 [2021-05-02 12:22:02,469 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 137.6ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:22:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-05-02 12:22:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 294. [2021-05-02 12:22:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 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) [2021-05-02 12:22:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2021-05-02 12:22:02,474 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 18 [2021-05-02 12:22:02,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:02,474 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2021-05-02 12:22:02,474 INFO L481 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) [2021-05-02 12:22:02,474 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2021-05-02 12:22:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:22:02,474 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:02,474 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:02,474 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 12:22:02,474 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:02,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:02,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1303825267, now seen corresponding path program 1 times [2021-05-02 12:22:02,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:02,475 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098767502] [2021-05-02 12:22:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:02,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:02,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:02,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098767502] [2021-05-02 12:22:02,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098767502] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:02,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:02,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:02,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152784283] [2021-05-02 12:22:02,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:02,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:02,572 INFO L87 Difference]: Start difference. First operand 294 states and 359 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) [2021-05-02 12:22:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:03,247 INFO L93 Difference]: Finished difference Result 304 states and 369 transitions. [2021-05-02 12:22:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:22:03,247 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 [2021-05-02 12:22:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:03,249 INFO L225 Difference]: With dead ends: 304 [2021-05-02 12:22:03,249 INFO L226 Difference]: Without dead ends: 300 [2021-05-02 12:22:03,249 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:22:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-05-02 12:22:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 295. [2021-05-02 12:22:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 284 states have (on average 1.2570422535211268) internal successors, (357), 291 states have internal predecessors, (357), 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) [2021-05-02 12:22:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 360 transitions. [2021-05-02 12:22:03,253 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 360 transitions. Word has length 18 [2021-05-02 12:22:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:03,254 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 360 transitions. [2021-05-02 12:22:03,254 INFO L481 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) [2021-05-02 12:22:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 360 transitions. [2021-05-02 12:22:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 12:22:03,254 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:03,254 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:03,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 12:22:03,254 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:03,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1094248106, now seen corresponding path program 1 times [2021-05-02 12:22:03,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:03,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637744015] [2021-05-02 12:22:03,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:03,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:03,338 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:03,338 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637744015] [2021-05-02 12:22:03,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637744015] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:03,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:03,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:03,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485362505] [2021-05-02 12:22:03,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:03,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:03,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:03,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:03,339 INFO L87 Difference]: Start difference. First operand 295 states and 360 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) [2021-05-02 12:22:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:04,089 INFO L93 Difference]: Finished difference Result 321 states and 388 transitions. [2021-05-02 12:22:04,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:22:04,090 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 [2021-05-02 12:22:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:04,091 INFO L225 Difference]: With dead ends: 321 [2021-05-02 12:22:04,091 INFO L226 Difference]: Without dead ends: 319 [2021-05-02 12:22:04,091 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 155.8ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:22:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-05-02 12:22:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2021-05-02 12:22:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 287 states have (on average 1.254355400696864) internal successors, (360), 294 states have internal predecessors, (360), 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) [2021-05-02 12:22:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 363 transitions. [2021-05-02 12:22:04,096 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 363 transitions. Word has length 19 [2021-05-02 12:22:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:04,096 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 363 transitions. [2021-05-02 12:22:04,096 INFO L481 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) [2021-05-02 12:22:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 363 transitions. [2021-05-02 12:22:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 12:22:04,097 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:04,097 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:04,097 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 12:22:04,097 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1750216322, now seen corresponding path program 1 times [2021-05-02 12:22:04,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:04,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82294304] [2021-05-02 12:22:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:04,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:04,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:04,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82294304] [2021-05-02 12:22:04,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82294304] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:04,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:04,139 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:22:04,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501515394] [2021-05-02 12:22:04,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:22:04,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:22:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:22:04,139 INFO L87 Difference]: Start difference. First operand 298 states and 363 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) [2021-05-02 12:22:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:04,642 INFO L93 Difference]: Finished difference Result 298 states and 363 transitions. [2021-05-02 12:22:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:22:04,643 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 [2021-05-02 12:22:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:04,644 INFO L225 Difference]: With dead ends: 298 [2021-05-02 12:22:04,644 INFO L226 Difference]: Without dead ends: 296 [2021-05-02 12:22:04,645 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.0ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-05-02 12:22:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-05-02 12:22:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 286 states have (on average 1.2517482517482517) internal successors, (358), 292 states have internal predecessors, (358), 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) [2021-05-02 12:22:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 361 transitions. [2021-05-02 12:22:04,661 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 361 transitions. Word has length 20 [2021-05-02 12:22:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:04,662 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 361 transitions. [2021-05-02 12:22:04,662 INFO L481 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) [2021-05-02 12:22:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 361 transitions. [2021-05-02 12:22:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 12:22:04,664 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:04,664 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:04,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 12:22:04,664 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:04,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:04,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1577872003, now seen corresponding path program 1 times [2021-05-02 12:22:04,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:04,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056626844] [2021-05-02 12:22:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:04,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:04,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:04,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056626844] [2021-05-02 12:22:04,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056626844] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:04,733 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:04,733 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:22:04,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012327639] [2021-05-02 12:22:04,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:22:04,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:22:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:22:04,734 INFO L87 Difference]: Start difference. First operand 296 states and 361 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) [2021-05-02 12:22:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:05,248 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2021-05-02 12:22:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:22:05,249 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 [2021-05-02 12:22:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:05,252 INFO L225 Difference]: With dead ends: 296 [2021-05-02 12:22:05,253 INFO L226 Difference]: Without dead ends: 292 [2021-05-02 12:22:05,255 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.9ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-02 12:22:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2021-05-02 12:22:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2508833922261484) internal successors, (354), 288 states have internal predecessors, (354), 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) [2021-05-02 12:22:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2021-05-02 12:22:05,260 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 21 [2021-05-02 12:22:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:05,260 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2021-05-02 12:22:05,260 INFO L481 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) [2021-05-02 12:22:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2021-05-02 12:22:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 12:22:05,262 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:05,262 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:05,263 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 12:22:05,263 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:05,264 INFO L82 PathProgramCache]: Analyzing trace with hash -383054022, now seen corresponding path program 1 times [2021-05-02 12:22:05,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:05,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056229130] [2021-05-02 12:22:05,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:05,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:05,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:05,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056229130] [2021-05-02 12:22:05,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056229130] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:05,342 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:05,342 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:05,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680645876] [2021-05-02 12:22:05,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:05,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:05,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:05,343 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:22:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:06,079 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2021-05-02 12:22:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:22:06,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 12:22:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:06,080 INFO L225 Difference]: With dead ends: 292 [2021-05-02 12:22:06,080 INFO L226 Difference]: Without dead ends: 290 [2021-05-02 12:22:06,081 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 182.9ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:22:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-05-02 12:22:06,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2021-05-02 12:22:06,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 279 states have (on average 1.2508960573476702) internal successors, (349), 283 states have internal predecessors, (349), 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) [2021-05-02 12:22:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2021-05-02 12:22:06,085 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 21 [2021-05-02 12:22:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:06,085 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2021-05-02 12:22:06,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:22:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2021-05-02 12:22:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:22:06,086 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:06,086 INFO L523 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] [2021-05-02 12:22:06,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 12:22:06,086 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1682632114, now seen corresponding path program 1 times [2021-05-02 12:22:06,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:06,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316984352] [2021-05-02 12:22:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:06,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:06,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:06,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316984352] [2021-05-02 12:22:06,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316984352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:06,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:06,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:06,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126492580] [2021-05-02 12:22:06,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:06,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:06,145 INFO L87 Difference]: Start difference. First operand 287 states and 352 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) [2021-05-02 12:22:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:06,812 INFO L93 Difference]: Finished difference Result 302 states and 369 transitions. [2021-05-02 12:22:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:22:06,812 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 [2021-05-02 12:22:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:06,813 INFO L225 Difference]: With dead ends: 302 [2021-05-02 12:22:06,813 INFO L226 Difference]: Without dead ends: 300 [2021-05-02 12:22:06,813 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 129.5ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:22:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-05-02 12:22:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 282. [2021-05-02 12:22:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 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) [2021-05-02 12:22:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 347 transitions. [2021-05-02 12:22:06,818 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 347 transitions. Word has length 22 [2021-05-02 12:22:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:06,818 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 347 transitions. [2021-05-02 12:22:06,818 INFO L481 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) [2021-05-02 12:22:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 347 transitions. [2021-05-02 12:22:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:22:06,818 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:06,818 INFO L523 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] [2021-05-02 12:22:06,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 12:22:06,818 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1297761964, now seen corresponding path program 1 times [2021-05-02 12:22:06,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:06,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914976264] [2021-05-02 12:22:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:06,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:06,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:06,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914976264] [2021-05-02 12:22:06,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914976264] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:06,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:06,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:06,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927226405] [2021-05-02 12:22:06,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:06,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:06,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:06,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:06,890 INFO L87 Difference]: Start difference. First operand 282 states and 347 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) [2021-05-02 12:22:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:07,658 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2021-05-02 12:22:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:22:07,659 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 [2021-05-02 12:22:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:07,660 INFO L225 Difference]: With dead ends: 294 [2021-05-02 12:22:07,660 INFO L226 Difference]: Without dead ends: 292 [2021-05-02 12:22:07,660 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 149.4ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:22:07,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-05-02 12:22:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 277. [2021-05-02 12:22:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.2472324723247232) internal successors, (338), 273 states have internal predecessors, (338), 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) [2021-05-02 12:22:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2021-05-02 12:22:07,665 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 22 [2021-05-02 12:22:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:07,665 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2021-05-02 12:22:07,665 INFO L481 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) [2021-05-02 12:22:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2021-05-02 12:22:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:22:07,665 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:07,665 INFO L523 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] [2021-05-02 12:22:07,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 12:22:07,666 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1345477214, now seen corresponding path program 1 times [2021-05-02 12:22:07,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:07,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115603022] [2021-05-02 12:22:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:07,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:07,719 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:07,719 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115603022] [2021-05-02 12:22:07,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115603022] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:07,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:07,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:07,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084477547] [2021-05-02 12:22:07,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:07,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:07,720 INFO L87 Difference]: Start difference. First operand 277 states and 341 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) [2021-05-02 12:22:08,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:08,362 INFO L93 Difference]: Finished difference Result 277 states and 341 transitions. [2021-05-02 12:22:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:22:08,363 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 [2021-05-02 12:22:08,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:08,364 INFO L225 Difference]: With dead ends: 277 [2021-05-02 12:22:08,364 INFO L226 Difference]: Without dead ends: 254 [2021-05-02 12:22:08,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 133.0ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:22:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-05-02 12:22:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2021-05-02 12:22:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.0080321285140563) internal successors, (251), 250 states have internal predecessors, (251), 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) [2021-05-02 12:22:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2021-05-02 12:22:08,367 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 22 [2021-05-02 12:22:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:08,367 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2021-05-02 12:22:08,367 INFO L481 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) [2021-05-02 12:22:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2021-05-02 12:22:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2021-05-02 12:22:08,370 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:08,370 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:08,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 12:22:08,370 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1242952801, now seen corresponding path program 1 times [2021-05-02 12:22:08,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:08,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139015384] [2021-05-02 12:22:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:09,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:09,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:09,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139015384] [2021-05-02 12:22:09,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139015384] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:09,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:09,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2021-05-02 12:22:09,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414750548] [2021-05-02 12:22:09,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2021-05-02 12:22:09,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:09,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-05-02 12:22:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1836, Invalid=2196, Unknown=0, NotChecked=0, Total=4032 [2021-05-02 12:22:09,991 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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) [2021-05-02 12:22:13,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:13,637 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2021-05-02 12:22:13,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-05-02 12:22:13,637 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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 248 [2021-05-02 12:22:13,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:13,638 INFO L225 Difference]: With dead ends: 255 [2021-05-02 12:22:13,638 INFO L226 Difference]: Without dead ends: 253 [2021-05-02 12:22:13,640 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 3951.1ms TimeCoverageRelationStatistics Valid=5560, Invalid=9940, Unknown=0, NotChecked=0, Total=15500 [2021-05-02 12:22:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-05-02 12:22:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-05-02 12:22:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.0040322580645162) internal successors, (249), 248 states have internal predecessors, (249), 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) [2021-05-02 12:22:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2021-05-02 12:22:13,644 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2021-05-02 12:22:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:13,644 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2021-05-02 12:22:13,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 64 states, 64 states have (on average 3.828125) internal successors, (245), 63 states have internal predecessors, (245), 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) [2021-05-02 12:22:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2021-05-02 12:22:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2021-05-02 12:22:13,645 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:22:13,646 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:22:13,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 12:22:13,646 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:22:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:22:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash 123173085, now seen corresponding path program 1 times [2021-05-02 12:22:13,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:22:13,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495093579] [2021-05-02 12:22:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:22:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:13,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:22:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:22:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:22:13,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:22:13,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495093579] [2021-05-02 12:22:13,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495093579] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:22:13,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:22:13,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:22:13,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862260381] [2021-05-02 12:22:13,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:22:13,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:22:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:22:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:22:13,809 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 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) [2021-05-02 12:22:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:22:14,305 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2021-05-02 12:22:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:22:14,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 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 249 [2021-05-02 12:22:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:22:14,306 INFO L225 Difference]: With dead ends: 254 [2021-05-02 12:22:14,306 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:22:14,309 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 125.5ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:22:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:22:14,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:22:14,309 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) [2021-05-02 12:22:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:22:14,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2021-05-02 12:22:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:22:14,309 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:22:14,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 6 states have internal predecessors, (246), 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) [2021-05-02 12:22:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:22:14,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:22:14,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-02 12:22:14,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:22:14,590 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~__tmp_3904_0~0 |old(~__tmp_3904_0~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= ~__return_2598~0 |old(~__return_2598~0)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~__tmp_3904_1~0 |old(~__tmp_3904_1~0)|) (= ~__tmp_2609_0~0 |old(~__tmp_2609_0~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:22:14,591 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 16 3008) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point L1555(lines 1555 2805) no Hoare annotation was computed. [2021-05-02 12:22:14,591 INFO L198 CegarLoopUtils]: For program point L2546(lines 2546 2653) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2480(lines 2480 2663) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L432(lines 432 2978) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L697(lines 697 2937) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1688(lines 1688 2785) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1622(lines 1622 2795) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L103(lines 103 125) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1953(lines 1953 2744) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L830(lines 830 2917) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L764(lines 764 2927) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2614(lines 2614 2643) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2218(lines 2218 2703) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1095(lines 1095 2876) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1360(lines 1360 2835) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2351(lines 2351 2683) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2285(lines 2285 2693) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L171(lines 171 193) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L105(line 105) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L2616(line 2616) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L502(lines 502 2967) no Hoare annotation was computed. [2021-05-02 12:22:14,592 INFO L198 CegarLoopUtils]: For program point L1493(lines 1493 2815) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1427(lines 1427 2825) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1758(lines 1758 2774) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L635(lines 635 2947) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L569(lines 569 2957) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L173(line 173) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L2023(lines 2023 2733) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L900(lines 900 2906) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1165(lines 1165 2865) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L2156(lines 2156 2713) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L2090(lines 2090 2723) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L2421(lines 2421 2672) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L307(lines 307 2997) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1298(lines 1298 2845) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1232(lines 1232 2855) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1563(lines 1563 2804) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L440(lines 440 2977) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L374(lines 374 2987) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1828(lines 1828 2763) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L705(lines 705 2936) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L45(lines 45 55) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L970(lines 970 2895) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1961(lines 1961 2743) no Hoare annotation was computed. [2021-05-02 12:22:14,593 INFO L198 CegarLoopUtils]: For program point L1895(lines 1895 2753) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2226(lines 2226 2702) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1103(lines 1103 2875) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1037(lines 1037 2885) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2623(lines 2623 2642) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2491(lines 2491 2661) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1368(lines 1368 2834) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1633(lines 1633 2793) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2558(lines 2558 2651) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L510(lines 510 2966) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L246(lines 246 281) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L775(lines 775 2925) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1766(lines 1766 2773) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1700(lines 1700 2783) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L194 CegarLoopUtils]: At program point L2625(lines 25 3002) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L115(lines 115 123) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2031(lines 2031 2732) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L908(lines 908 2905) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L842(lines 842 2915) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2296(lines 2296 2691) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1173(lines 1173 2864) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L1438(lines 1438 2823) no Hoare annotation was computed. [2021-05-02 12:22:14,594 INFO L198 CegarLoopUtils]: For program point L2429(lines 2429 2671) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L315(lines 315 2996) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2363(lines 2363 2681) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L183(lines 183 191) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L117(line 117) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L580(lines 580 2955) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L1571(lines 1571 2803) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L1505(lines 1505 2813) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L1836(lines 1836 2762) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L713(lines 713 2935) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L647(lines 647 2945) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L185(line 185) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2101(lines 2101 2721) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L978(lines 978 2894) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L1243(lines 1243 2853) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2234(lines 2234 2701) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2168(lines 2168 2711) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2631(lines 2631 2641) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L2499(lines 2499 2660) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L385(lines 385 2985) no Hoare annotation was computed. [2021-05-02 12:22:14,595 INFO L198 CegarLoopUtils]: For program point L1376(lines 1376 2833) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1310(lines 1310 2843) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L253(lines 253 275) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1641(lines 1641 2792) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L518(lines 518 2965) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L452(lines 452 2975) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1906(lines 1906 2751) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L783(lines 783 2924) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1048(lines 1048 2883) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L2039(lines 2039 2731) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1973(lines 1973 2741) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L194 CegarLoopUtils]: At program point L2634(lines 64 3001) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L2304(lines 2304 2690) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1181(lines 1181 2863) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1115(lines 1115 2873) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L2569(lines 2569 2649) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1446(lines 1446 2822) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L323(lines 323 2995) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1711(lines 1711 2781) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L588(lines 588 2954) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L853(lines 853 2913) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1844(lines 1844 2761) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L1778(lines 1778 2771) no Hoare annotation was computed. [2021-05-02 12:22:14,596 INFO L198 CegarLoopUtils]: For program point L2109(lines 2109 2720) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L986(lines 986 2893) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L920(lines 920 2903) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L2374(lines 2374 2679) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1251(lines 1251 2852) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1516(lines 1516 2811) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L2507(lines 2507 2659) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L393(lines 393 2984) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L2441(lines 2441 2669) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L658(lines 658 2943) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1649(lines 1649 2791) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L194 CegarLoopUtils]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 59 main_~main__t~0)) [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1583(lines 1583 2801) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L64(lines 64 3001) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1914(lines 1914 2750) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L791(lines 791 2923) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L725(lines 725 2933) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L2179(lines 2179 2709) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1056(lines 1056 2882) no Hoare annotation was computed. [2021-05-02 12:22:14,597 INFO L198 CegarLoopUtils]: For program point L1321(lines 1321 2841) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2312(lines 2312 2689) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2246(lines 2246 2699) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L132(lines 132 282) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2577(lines 2577 2648) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L463(lines 463 2973) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1454(lines 1454 2821) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1388(lines 1388 2831) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L265(lines 265 273) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1719(lines 1719 2780) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L596(lines 596 2953) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L530(lines 530 2963) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1984(lines 1984 2739) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L861(lines 861 2912) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L267(line 267) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1126(lines 1126 2871) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2117(lines 2117 2719) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2051(lines 2051 2729) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L2382(lines 2382 2678) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1259(lines 1259 2851) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1193(lines 1193 2861) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L136(lines 136 240) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L1524(lines 1524 2810) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L401(lines 401 2983) no Hoare annotation was computed. [2021-05-02 12:22:14,598 INFO L198 CegarLoopUtils]: For program point L335(lines 335 2993) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 16 3008) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1789(lines 1789 2769) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L666(lines 666 2942) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L931(lines 931 2901) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1922(lines 1922 2749) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1856(lines 1856 2759) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L205(lines 205 229) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L2187(lines 2187 2708) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1064(lines 1064 2881) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L998(lines 998 2891) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L2452(lines 2452 2667) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1329(lines 1329 2840) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L74(lines 74 286) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1594(lines 1594 2799) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L2585(lines 2585 2647) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L471(lines 471 2972) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L2519(lines 2519 2657) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L207(line 207) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L736(lines 736 2931) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1727(lines 1727 2779) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1661(lines 1661 2789) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L76(line 76) no Hoare annotation was computed. [2021-05-02 12:22:14,599 INFO L198 CegarLoopUtils]: For program point L1992(lines 1992 2738) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L869(lines 869 2911) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L803(lines 803 2921) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2257(lines 2257 2697) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L143(lines 143 234) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1134(lines 1134 2870) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1399(lines 1399 2829) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2390(lines 2390 2677) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2324(lines 2324 2687) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L541(lines 541 2961) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1532(lines 1532 2809) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1466(lines 1466 2819) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1797(lines 1797 2768) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L674(lines 674 2941) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L608(lines 608 2951) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2062(lines 2062 2727) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L939(lines 939 2900) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L1204(lines 1204 2859) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2195(lines 2195 2707) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point L2129(lines 2129 2717) no Hoare annotation was computed. [2021-05-02 12:22:14,600 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-05-02 12:22:14,601 INFO L198 CegarLoopUtils]: For program point L2460(lines 2460 2666) no Hoare annotation was computed. [2021-05-02 12:22:14,601 INFO L198 CegarLoopUtils]: For program point L346(lines 346 2991) no Hoare annotation was computed. [2021-05-02 12:22:14,601 INFO L198 CegarLoopUtils]: For program point L1337(lines 1337 2839) no Hoare annotation was computed. [2021-05-02 12:22:14,601 INFO L194 CegarLoopUtils]: At program point L280(lines 132 282) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__t~0) (not (= main_~__VERIFIER_assert__cond~3 0))) [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1271(lines 1271 2849) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1602(lines 1602 2798) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L479(lines 479 2971) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L413(lines 413 2981) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1867(lines 1867 2757) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L744(lines 744 2930) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1009(lines 1009 2889) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L2000(lines 2000 2737) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1934(lines 1934 2747) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L217(lines 217 227) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L2265(lines 2265 2696) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1142(lines 1142 2869) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1076(lines 1076 2879) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L2530(lines 2530 2655) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L1407(lines 1407 2828) no Hoare annotation was computed. [2021-05-02 12:22:14,602 INFO L198 CegarLoopUtils]: For program point L86(lines 86 284) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L1672(lines 1672 2787) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L549(lines 549 2960) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L219(line 219) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L21(lines 21 3007) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L814(lines 814 2919) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L1805(lines 1805 2767) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L1739(lines 1739 2777) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L88(line 88) no Hoare annotation was computed. [2021-05-02 12:22:14,603 INFO L198 CegarLoopUtils]: For program point L2070(lines 2070 2726) no Hoare annotation was computed. [2021-05-02 12:22:14,604 INFO L198 CegarLoopUtils]: For program point L947(lines 947 2899) no Hoare annotation was computed. [2021-05-02 12:22:14,604 INFO L198 CegarLoopUtils]: For program point L881(lines 881 2909) no Hoare annotation was computed. [2021-05-02 12:22:14,604 INFO L198 CegarLoopUtils]: For program point L2335(lines 2335 2685) no Hoare annotation was computed. [2021-05-02 12:22:14,604 INFO L198 CegarLoopUtils]: For program point L1212(lines 1212 2858) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L155(lines 155 232) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1477(lines 1477 2817) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2468(lines 2468 2665) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2402(lines 2402 2675) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L354(lines 354 2990) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L619(lines 619 2949) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1610(lines 1610 2797) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1544(lines 1544 2807) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L25(lines 25 3002) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1875(lines 1875 2756) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L752(lines 752 2929) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L686(lines 686 2939) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2602(lines 2602 2645) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2140(lines 2140 2715) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1017(lines 1017 2888) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L1282(lines 1282 2847) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2273(lines 2273 2695) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2207(lines 2207 2705) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2604(line 2604) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L2538(lines 2538 2654) no Hoare annotation was computed. [2021-05-02 12:22:14,605 INFO L198 CegarLoopUtils]: For program point L424(lines 424 2979) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1415(lines 1415 2827) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1349(lines 1349 2837) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L194 CegarLoopUtils]: At program point L226(lines 92 284) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~3 0))) [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1680(lines 1680 2786) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L557(lines 557 2959) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L491(lines 491 2969) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1945(lines 1945 2745) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L822(lines 822 2918) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1087(lines 1087 2877) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L2078(lines 2078 2725) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 16 3008) the Hoare annotation is: (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0)) [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L2012(lines 2012 2735) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L2343(lines 2343 2684) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1220(lines 1220 2857) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1154(lines 1154 2867) no Hoare annotation was computed. [2021-05-02 12:22:14,606 INFO L198 CegarLoopUtils]: For program point L1485(lines 1485 2816) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L362(lines 362 2989) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L296(lines 296 2999) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L164(lines 164 231) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L1750(lines 1750 2775) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L627(lines 627 2948) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L33(lines 33 57) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L194 CegarLoopUtils]: At program point L3006(lines 21 3007) the Hoare annotation is: (or (and (= |old(~__tmp_3904_0~0)| ~__tmp_3904_0~0) (= |old(~__return_2598~0)| ~__return_2598~0) (= |old(~__tmp_3904_1~0)| ~__tmp_3904_1~0) (= |old(~__tmp_2609_0~0)| ~__tmp_2609_0~0)) (<= 0 main_~main__t~0)) [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L892(lines 892 2907) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L1883(lines 1883 2755) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L1817(lines 1817 2765) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L2148(lines 2148 2714) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L1025(lines 1025 2887) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L959(lines 959 2897) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L2413(lines 2413 2673) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L1290(lines 1290 2846) no Hoare annotation was computed. [2021-05-02 12:22:14,607 INFO L198 CegarLoopUtils]: For program point L35(line 35) no Hoare annotation was computed. [2021-05-02 12:22:14,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:22:14 BoogieIcfgContainer [2021-05-02 12:22:14,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:22:14,624 INFO L168 Benchmark]: Toolchain (without parser) took 23189.06 ms. Allocated memory was 206.6 MB in the beginning and 481.3 MB in the end (delta: 274.7 MB). Free memory was 168.7 MB in the beginning and 380.7 MB in the end (delta: -212.1 MB). Peak memory consumption was 275.2 MB. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 206.6 MB. Free memory is still 187.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.07 ms. Allocated memory is still 206.6 MB. Free memory was 168.5 MB in the beginning and 172.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 INFO L168 Benchmark]: Boogie Preprocessor took 79.68 ms. Allocated memory is still 206.6 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 INFO L168 Benchmark]: RCFGBuilder took 1024.81 ms. Allocated memory is still 206.6 MB. Free memory was 167.2 MB in the beginning and 107.4 MB in the end (delta: 59.8 MB). Peak memory consumption was 97.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 INFO L168 Benchmark]: TraceAbstraction took 21480.42 ms. Allocated memory was 206.6 MB in the beginning and 481.3 MB in the end (delta: 274.7 MB). Free memory was 106.9 MB in the beginning and 380.7 MB in the end (delta: -273.9 MB). Peak memory consumption was 212.7 MB. Max. memory is 8.0 GB. [2021-05-02 12:22:14,625 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.12 ms. Allocated memory is still 206.6 MB. Free memory is still 187.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 599.07 ms. Allocated memory is still 206.6 MB. Free memory was 168.5 MB in the beginning and 172.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 33.6 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 79.68 ms. Allocated memory is still 206.6 MB. Free memory was 172.0 MB in the beginning and 167.2 MB in the end (delta: 4.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1024.81 ms. Allocated memory is still 206.6 MB. Free memory was 167.2 MB in the beginning and 107.4 MB in the end (delta: 59.8 MB). Peak memory consumption was 97.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21480.42 ms. Allocated memory was 206.6 MB in the beginning and 481.3 MB in the end (delta: 274.7 MB). Free memory was 106.9 MB in the beginning and 380.7 MB in the end (delta: -273.9 MB). Peak memory consumption was 212.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 267]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 316 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21134.5ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 21.7ms, AutomataDifference: 17637.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 280.3ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3956 SDtfs, 15324 SDslu, 1166 SDs, 0 SdLazy, 18417 SolverSat, 3861 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10330.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 354 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2081 ImplicationChecksByTransitivity, 6061.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=0, InterpolantAutomatonStates: 225, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 148.8ms AutomataMinimizationTime, 21 MinimizatonAttempts, 161 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 129 HoareAnnotationTreeSize, 10 FomulaSimplifications, 15093 FormulaSimplificationTreeSizeReduction, 79.8ms HoareSimplificationTime, 10 FomulaSimplificationsInter, 2394 FormulaSimplificationTreeSizeReductionInter, 192.2ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 37.2ms SsaConstructionTime, 254.6ms SatisfiabilityAnalysisTime, 2826.5ms InterpolantComputationTime, 828 NumberOfCodeBlocks, 828 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 2818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 59 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((\old(__tmp_3904_0) == __tmp_3904_0 && \old(__return_2598) == __return_2598) && \old(__tmp_3904_1) == __tmp_3904_1) && \old(__tmp_2609_0) == __tmp_2609_0) || 0 <= main__t - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t RESULT: Ultimate proved your program to be correct! Received shutdown request...