/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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-05 23:54:27,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-05 23:54:27,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-05 23:54:27,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-05 23:54:27,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-05 23:54:27,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-05 23:54:27,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-05 23:54:27,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-05 23:54:27,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-05 23:54:27,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-05 23:54:27,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-05 23:54:27,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-05 23:54:27,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-05 23:54:27,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-05 23:54:27,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-05 23:54:27,401 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-05 23:54:27,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-05 23:54:27,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-05 23:54:27,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-05 23:54:27,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-05 23:54:27,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-05 23:54:27,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-05 23:54:27,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-05 23:54:27,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-05 23:54:27,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-05 23:54:27,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-05 23:54:27,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-05 23:54:27,416 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-05 23:54:27,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-05 23:54:27,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-05 23:54:27,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-05 23:54:27,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-05 23:54:27,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-05 23:54:27,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-05 23:54:27,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-05 23:54:27,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-05 23:54:27,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-05 23:54:27,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-05 23:54:27,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-05 23:54:27,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-05 23:54:27,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-05 23:54:27,421 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-05 23:54:27,435 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-05 23:54:27,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-05 23:54:27,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-05 23:54:27,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-05 23:54:27,436 INFO L138 SettingsManager]: * Use SBE=true [2021-05-05 23:54:27,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-05 23:54:27,437 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-05 23:54:27,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-05 23:54:27,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-05 23:54:27,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-05 23:54:27,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-05 23:54:27,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-05 23:54:27,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-05 23:54:27,439 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-05 23:54:27,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-05 23:54:27,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-05 23:54:27,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-05 23:54:27,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-05 23:54:27,716 INFO L275 PluginConnector]: CDTParser initialized [2021-05-05 23:54:27,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-05 23:54:27,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f8ae6b7/43b684c97edc43e69423534536d9aa4e/FLAGdaf687f93 [2021-05-05 23:54:28,091 INFO L306 CDTParser]: Found 1 translation units. [2021-05-05 23:54:28,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-05 23:54:28,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f8ae6b7/43b684c97edc43e69423534536d9aa4e/FLAGdaf687f93 [2021-05-05 23:54:28,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50f8ae6b7/43b684c97edc43e69423534536d9aa4e [2021-05-05 23:54:28,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-05 23:54:28,509 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-05 23:54:28,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:28,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-05 23:54:28,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-05 23:54:28,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1486f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28, skipping insertion in model container [2021-05-05 23:54:28,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-05 23:54:28,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-05 23:54:28,629 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-05 23:54:28,631 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-05 23:54:28,633 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-05 23:54:28,635 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-05 23:54:28,636 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-05 23:54:28,638 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-05 23:54:28,642 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-05 23:54:28,643 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-05 23:54:28,644 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-05 23:54:28,646 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-05 23:54:28,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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-05 23:54:28,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:28,654 INFO L203 MainTranslator]: Completed pre-run [2021-05-05 23:54:28,691 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/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-05 23:54:28,692 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/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-05 23:54:28,693 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/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-05 23:54:28,694 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/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-05 23:54:28,695 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/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-05 23:54:28,695 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/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-05 23:54:28,697 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/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-05 23:54:28,697 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/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-05 23:54:28,698 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/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-05 23:54:28,698 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/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-05 23:54:28,700 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/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-05 23:54:28,700 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/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-05 23:54:28,701 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/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-05 23:54:28,702 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/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-05 23:54:28,703 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/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-05 23:54:28,704 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/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-05 23:54:28,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-05 23:54:28,714 INFO L208 MainTranslator]: Completed translation [2021-05-05 23:54:28,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28 WrapperNode [2021-05-05 23:54:28,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-05 23:54:28,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-05 23:54:28,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-05 23:54:28,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-05 23:54:28,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (1/1) ... [2021-05-05 23:54:28,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-05 23:54:28,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-05 23:54:28,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-05 23:54:28,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-05 23:54:28,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (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-05 23:54:28,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-05 23:54:28,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-05 23:54:28,824 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-05 23:54:28,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-05 23:54:28,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-05 23:54:28,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-05 23:54:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-05 23:54:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-05 23:54:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-05 23:54:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-05 23:54:28,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-05 23:54:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-05 23:54:28,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-05 23:54:29,220 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-05 23:54:29,220 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-05 23:54:29,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:29 BoogieIcfgContainer [2021-05-05 23:54:29,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-05 23:54:29,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-05 23:54:29,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-05 23:54:29,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-05 23:54:29,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 11:54:28" (1/3) ... [2021-05-05 23:54:29,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73accd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:29, skipping insertion in model container [2021-05-05 23:54:29,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 11:54:28" (2/3) ... [2021-05-05 23:54:29,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c73accd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 11:54:29, skipping insertion in model container [2021-05-05 23:54:29,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 11:54:29" (3/3) ... [2021-05-05 23:54:29,227 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-05 23:54:29,232 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-05 23:54:29,235 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-05 23:54:29,246 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-05 23:54:29,269 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-05 23:54:29,269 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-05 23:54:29,269 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-05 23:54:29,270 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-05 23:54:29,270 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-05 23:54:29,271 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-05 23:54:29,271 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-05 23:54:29,271 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-05 23:54:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 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-05 23:54:29,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-05 23:54:29,297 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:29,298 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:29,299 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-05 23:54:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2021-05-05 23:54:29,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:29,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459854409] [2021-05-05 23:54:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:29,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:29,530 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-05 23:54:29,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:29,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459854409] [2021-05-05 23:54:29,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459854409] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:29,531 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:29,531 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-05 23:54:29,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970453134] [2021-05-05 23:54:29,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-05 23:54:29,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-05 23:54:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-05 23:54:29,545 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 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 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-05 23:54:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:29,670 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2021-05-05 23:54:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-05 23:54:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:29,679 INFO L225 Difference]: With dead ends: 90 [2021-05-05 23:54:29,679 INFO L226 Difference]: Without dead ends: 76 [2021-05-05 23:54:29,681 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-05 23:54:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-05 23:54:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-05 23:54:29,719 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-05 23:54:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:29,720 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-05 23:54:29,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-05 23:54:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-05 23:54:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:29,720 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:29,720 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:29,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-05 23:54:29,722 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-05 23:54:29,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2021-05-05 23:54:29,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:29,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516930437] [2021-05-05 23:54:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:29,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:29,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-05 23:54:29,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:29,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516930437] [2021-05-05 23:54:29,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516930437] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:29,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:29,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:29,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938994276] [2021-05-05 23:54:29,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:29,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:29,810 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:30,055 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2021-05-05 23:54:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:30,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:30,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:30,062 INFO L225 Difference]: With dead ends: 153 [2021-05-05 23:54:30,062 INFO L226 Difference]: Without dead ends: 101 [2021-05-05 23:54:30,063 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-05 23:54:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2021-05-05 23:54:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-05-05 23:54:30,082 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2021-05-05 23:54:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:30,083 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-05-05 23:54:30,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-05-05 23:54:30,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-05 23:54:30,083 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:30,083 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:30,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-05 23:54:30,083 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-05 23:54:30,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:30,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2021-05-05 23:54:30,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:30,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379301184] [2021-05-05 23:54:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,163 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-05 23:54:30,163 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:30,163 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379301184] [2021-05-05 23:54:30,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379301184] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:30,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:30,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:30,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017596095] [2021-05-05 23:54:30,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:30,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:30,164 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:30,287 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-05 23:54:30,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:30,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-05 23:54:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:30,288 INFO L225 Difference]: With dead ends: 75 [2021-05-05 23:54:30,288 INFO L226 Difference]: Without dead ends: 73 [2021-05-05 23:54:30,288 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-05 23:54:30,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2021-05-05 23:54:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 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-05 23:54:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-05 23:54:30,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-05 23:54:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:30,293 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-05 23:54:30,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-05 23:54:30,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-05 23:54:30,293 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:30,293 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:30,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-05 23:54:30,294 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-05 23:54:30,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:30,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2021-05-05 23:54:30,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:30,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059357872] [2021-05-05 23:54:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,382 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-05 23:54:30,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:30,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059357872] [2021-05-05 23:54:30,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059357872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:30,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:30,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:30,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075814274] [2021-05-05 23:54:30,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:30,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:30,385 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:30,519 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-05-05 23:54:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:30,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-05 23:54:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:30,521 INFO L225 Difference]: With dead ends: 96 [2021-05-05 23:54:30,521 INFO L226 Difference]: Without dead ends: 94 [2021-05-05 23:54:30,521 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-05 23:54:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-05 23:54:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-05 23:54:30,530 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-05 23:54:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:30,530 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-05 23:54:30,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-05 23:54:30,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-05 23:54:30,531 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:30,531 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:30,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-05 23:54:30,531 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-05 23:54:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2021-05-05 23:54:30,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:30,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600803802] [2021-05-05 23:54:30,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,613 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-05 23:54:30,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:30,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600803802] [2021-05-05 23:54:30,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600803802] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:30,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:30,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:30,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944321132] [2021-05-05 23:54:30,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:30,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:30,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:30,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:30,614 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:30,884 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-05-05 23:54:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-05 23:54:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:30,885 INFO L225 Difference]: With dead ends: 95 [2021-05-05 23:54:30,885 INFO L226 Difference]: Without dead ends: 93 [2021-05-05 23:54:30,885 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 148.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-05 23:54:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-05-05 23:54:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-05 23:54:30,889 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-05 23:54:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:30,889 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-05 23:54:30,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-05 23:54:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-05 23:54:30,889 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:30,889 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:30,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-05 23:54:30,890 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-05 23:54:30,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:30,890 INFO L82 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2021-05-05 23:54:30,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:30,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890447545] [2021-05-05 23:54:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:30,941 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-05 23:54:30,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:30,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890447545] [2021-05-05 23:54:30,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890447545] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:30,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:30,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:30,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147195313] [2021-05-05 23:54:30,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:30,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:30,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:30,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:30,942 INFO L87 Difference]: Start difference. First operand 52 states and 56 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-05 23:54:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:31,079 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-05 23:54:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:31,080 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-05 23:54:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:31,081 INFO L225 Difference]: With dead ends: 69 [2021-05-05 23:54:31,081 INFO L226 Difference]: Without dead ends: 67 [2021-05-05 23:54:31,081 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-05 23:54:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2021-05-05 23:54:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-05 23:54:31,086 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-05 23:54:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:31,087 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-05 23:54:31,087 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-05 23:54:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-05 23:54:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-05 23:54:31,087 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:31,087 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:31,088 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-05 23:54:31,088 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-05 23:54:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2021-05-05 23:54:31,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:31,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489008902] [2021-05-05 23:54:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,133 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-05 23:54:31,133 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:31,133 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489008902] [2021-05-05 23:54:31,133 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489008902] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:31,133 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:31,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:31,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376602110] [2021-05-05 23:54:31,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:31,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:31,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:31,134 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-05 23:54:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:31,272 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2021-05-05 23:54:31,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:31,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-05 23:54:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:31,274 INFO L225 Difference]: With dead ends: 91 [2021-05-05 23:54:31,274 INFO L226 Difference]: Without dead ends: 89 [2021-05-05 23:54:31,274 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-05 23:54:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2021-05-05 23:54:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-05 23:54:31,278 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-05 23:54:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:31,278 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-05 23:54:31,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-05 23:54:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-05 23:54:31,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-05 23:54:31,279 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:31,279 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-05 23:54:31,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-05 23:54:31,279 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-05 23:54:31,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2021-05-05 23:54:31,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:31,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802999527] [2021-05-05 23:54:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,332 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-05 23:54:31,332 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:31,332 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802999527] [2021-05-05 23:54:31,332 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802999527] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:31,332 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:31,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:31,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593462272] [2021-05-05 23:54:31,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:31,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:31,334 INFO L87 Difference]: Start difference. First operand 48 states and 52 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-05 23:54:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:31,556 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-05-05 23:54:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:31,557 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-05 23:54:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:31,558 INFO L225 Difference]: With dead ends: 73 [2021-05-05 23:54:31,558 INFO L226 Difference]: Without dead ends: 71 [2021-05-05 23:54:31,558 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 153.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-05 23:54:31,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-05-05 23:54:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-05 23:54:31,572 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-05 23:54:31,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:31,572 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-05 23:54:31,572 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-05 23:54:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-05 23:54:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-05 23:54:31,573 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:31,573 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-05 23:54:31,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-05 23:54:31,573 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-05 23:54:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2021-05-05 23:54:31,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:31,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291365728] [2021-05-05 23:54:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,640 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-05 23:54:31,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:31,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291365728] [2021-05-05 23:54:31,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291365728] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:31,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:31,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:31,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576310692] [2021-05-05 23:54:31,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:31,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:31,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:31,642 INFO L87 Difference]: Start difference. First operand 46 states and 50 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-05 23:54:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:31,831 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-05 23:54:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:31,832 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-05 23:54:31,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:31,832 INFO L225 Difference]: With dead ends: 61 [2021-05-05 23:54:31,832 INFO L226 Difference]: Without dead ends: 59 [2021-05-05 23:54:31,834 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 109.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-05 23:54:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-05 23:54:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 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-05 23:54:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-05 23:54:31,838 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-05 23:54:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:31,839 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-05 23:54:31,840 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-05 23:54:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-05 23:54:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-05 23:54:31,842 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:31,842 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-05 23:54:31,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-05 23:54:31,842 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-05 23:54:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2021-05-05 23:54:31,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:31,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901675834] [2021-05-05 23:54:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:31,920 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-05 23:54:31,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:31,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901675834] [2021-05-05 23:54:31,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901675834] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:31,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:31,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:31,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101779886] [2021-05-05 23:54:31,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:31,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:31,923 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:32,036 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-05 23:54:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-05 23:54:32,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-05 23:54:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:32,036 INFO L225 Difference]: With dead ends: 61 [2021-05-05 23:54:32,036 INFO L226 Difference]: Without dead ends: 59 [2021-05-05 23:54:32,037 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-05 23:54:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-05 23:54:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 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-05 23:54:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-05 23:54:32,041 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-05 23:54:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:32,041 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-05 23:54:32,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-05 23:54:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-05 23:54:32,044 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:32,045 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-05 23:54:32,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-05 23:54:32,045 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-05 23:54:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2021-05-05 23:54:32,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:32,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121528971] [2021-05-05 23:54:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,101 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-05 23:54:32,101 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:32,102 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121528971] [2021-05-05 23:54:32,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121528971] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:32,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:32,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-05 23:54:32,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893771480] [2021-05-05 23:54:32,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-05 23:54:32,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:32,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-05 23:54:32,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-05 23:54:32,103 INFO L87 Difference]: Start difference. First operand 42 states and 46 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-05 23:54:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:32,258 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-05 23:54:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:32,259 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-05 23:54:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:32,259 INFO L225 Difference]: With dead ends: 69 [2021-05-05 23:54:32,259 INFO L226 Difference]: Without dead ends: 67 [2021-05-05 23:54:32,260 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-05 23:54:32,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-05 23:54:32,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-05 23:54:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-05 23:54:32,263 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-05 23:54:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:32,263 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-05 23:54:32,263 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-05 23:54:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-05 23:54:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-05 23:54:32,263 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:32,264 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-05 23:54:32,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-05 23:54:32,264 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-05 23:54:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2021-05-05 23:54:32,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:32,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378737281] [2021-05-05 23:54:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,307 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-05 23:54:32,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:32,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378737281] [2021-05-05 23:54:32,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378737281] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:32,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:32,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:32,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363411880] [2021-05-05 23:54:32,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:32,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:32,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:32,309 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-05 23:54:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:32,508 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-05-05 23:54:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-05 23:54:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-05 23:54:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:32,509 INFO L225 Difference]: With dead ends: 74 [2021-05-05 23:54:32,509 INFO L226 Difference]: Without dead ends: 72 [2021-05-05 23:54:32,509 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 94.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-05 23:54:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-05 23:54:32,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-05 23:54:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 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-05 23:54:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-05 23:54:32,513 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-05 23:54:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:32,513 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-05 23:54:32,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-05 23:54:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-05 23:54:32,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-05 23:54:32,513 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:32,513 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-05 23:54:32,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-05 23:54:32,513 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-05 23:54:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:32,514 INFO L82 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2021-05-05 23:54:32,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:32,514 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855890712] [2021-05-05 23:54:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,561 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-05 23:54:32,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:32,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855890712] [2021-05-05 23:54:32,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855890712] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:32,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:32,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:32,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521581976] [2021-05-05 23:54:32,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:32,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:32,562 INFO L87 Difference]: Start difference. First operand 38 states and 42 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-05 23:54:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:32,795 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2021-05-05 23:54:32,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:32,795 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-05 23:54:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:32,796 INFO L225 Difference]: With dead ends: 62 [2021-05-05 23:54:32,796 INFO L226 Difference]: Without dead ends: 60 [2021-05-05 23:54:32,798 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 170.1ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-05 23:54:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-05 23:54:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-05 23:54:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 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-05 23:54:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-05 23:54:32,802 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-05 23:54:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:32,803 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-05 23:54:32,803 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-05 23:54:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-05 23:54:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-05 23:54:32,805 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:32,805 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] [2021-05-05 23:54:32,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-05 23:54:32,806 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-05 23:54:32,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:32,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2021-05-05 23:54:32,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:32,806 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248125346] [2021-05-05 23:54:32,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:32,864 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-05 23:54:32,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:32,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248125346] [2021-05-05 23:54:32,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248125346] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:32,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:32,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-05 23:54:32,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448937929] [2021-05-05 23:54:32,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-05 23:54:32,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-05 23:54:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-05 23:54:32,865 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:33,080 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2021-05-05 23:54:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-05 23:54:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-05 23:54:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:33,081 INFO L225 Difference]: With dead ends: 87 [2021-05-05 23:54:33,081 INFO L226 Difference]: Without dead ends: 85 [2021-05-05 23:54:33,082 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-05 23:54:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-05 23:54:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-05 23:54:33,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 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-05 23:54:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-05 23:54:33,085 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-05 23:54:33,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:33,086 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-05 23:54:33,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-05 23:54:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-05 23:54:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-05 23:54:33,087 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:33,087 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] [2021-05-05 23:54:33,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-05 23:54:33,087 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-05 23:54:33,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:33,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2021-05-05 23:54:33,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:33,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935850921] [2021-05-05 23:54:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:33,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:33,140 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-05 23:54:33,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:33,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935850921] [2021-05-05 23:54:33,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935850921] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:33,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:33,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:33,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210023979] [2021-05-05 23:54:33,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:33,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:33,143 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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-05 23:54:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:33,363 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-05 23:54:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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 24 [2021-05-05 23:54:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:33,364 INFO L225 Difference]: With dead ends: 60 [2021-05-05 23:54:33,364 INFO L226 Difference]: Without dead ends: 58 [2021-05-05 23:54:33,364 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 146.9ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-05 23:54:33,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-05 23:54:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-05 23:54:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-05 23:54:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-05 23:54:33,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-05 23:54:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:33,367 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-05 23:54:33,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 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-05 23:54:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-05 23:54:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-05 23:54:33,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-05 23:54:33,368 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] [2021-05-05 23:54:33,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-05 23:54:33,368 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-05 23:54:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-05 23:54:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2021-05-05 23:54:33,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-05 23:54:33,368 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849139576] [2021-05-05 23:54:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-05 23:54:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:33,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-05 23:54:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-05 23:54:33,414 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-05 23:54:33,414 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-05 23:54:33,414 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849139576] [2021-05-05 23:54:33,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849139576] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-05 23:54:33,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-05 23:54:33,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-05 23:54:33,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266481561] [2021-05-05 23:54:33,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-05 23:54:33,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-05 23:54:33,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-05 23:54:33,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-05 23:54:33,415 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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-05 23:54:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-05 23:54:33,721 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-05-05 23:54:33,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-05 23:54:33,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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 25 [2021-05-05 23:54:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-05 23:54:33,722 INFO L225 Difference]: With dead ends: 125 [2021-05-05 23:54:33,722 INFO L226 Difference]: Without dead ends: 0 [2021-05-05 23:54:33,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 132.6ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-05 23:54:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-05 23:54:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-05 23:54:33,723 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-05 23:54:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-05 23:54:33,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-05 23:54:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-05 23:54:33,723 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-05 23:54:33,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 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-05 23:54:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-05 23:54:33,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-05 23:54:33,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-05 23:54:33,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-05 23:54:34,011 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 156 [2021-05-05 23:54:34,185 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2021-05-05 23:54:34,394 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 113 [2021-05-05 23:54:34,665 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2021-05-05 23:54:34,810 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2021-05-05 23:54:34,928 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 13 [2021-05-05 23:54:34,930 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-05 23:54:34,930 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-05 23:54:34,930 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-05 23:54:34,930 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:34,930 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__return_334~0 |old(~__return_334~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-05 23:54:34,931 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L217(line 217) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 13 313) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L151(lines 151 281) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L110(lines 110 123) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L36(lines 36 300) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L193(line 193) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L86(lines 86 127) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L20(lines 20 312) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L243(lines 243 267) no Hoare annotation was computed. [2021-05-05 23:54:34,931 INFO L198 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L45(lines 45 288) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L194 CegarLoopUtils]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L227(lines 227 269) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L153(line 153) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L112(line 112) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 13 313) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L203(lines 203 273) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L38(lines 38 294) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 313) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L88(line 88) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L245(line 245) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L47(line 47) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L229(line 229) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point L163(lines 163 279) no Hoare annotation was computed. [2021-05-05 23:54:34,932 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L194 CegarLoopUtils]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L205(line 205) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L139(lines 139 283) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L98(lines 98 125) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L57(lines 57 286) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L74(lines 74 129) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L194 CegarLoopUtils]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse4 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse0 (= |old(~__return_334~0)| ~__return_334~0)) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (let ((.cse2 (<= 1 main_~main__j~0)) (.cse3 (let ((.cse5 (<= 0 main_~main__j~0)) (.cse6 (<= 1 main_~main__i~0))) (or (and .cse5 .cse6 .cse0 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1))))) (or (and (<= 0 main_~main__i~0) (= main_~main__j~0 0) (< main_~main__i~0 main_~main__len~0) .cse0 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~14 0))) (and .cse2 .cse3 .cse4)))) [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L165(line 165) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L66(lines 66 285) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L215(lines 215 271) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L141(line 141) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-05-05 23:54:34,933 INFO L198 CegarLoopUtils]: For program point L100(line 100) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point L257(line 257) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point L191(lines 191 275) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point L59(line 59) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point L175(lines 175 277) no Hoare annotation was computed. [2021-05-05 23:54:34,934 INFO L198 CegarLoopUtils]: For program point L76(line 76) no Hoare annotation was computed. [2021-05-05 23:54:34,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 11:54:34 BoogieIcfgContainer [2021-05-05 23:54:34,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-05 23:54:34,946 INFO L168 Benchmark]: Toolchain (without parser) took 6436.39 ms. Allocated memory was 185.6 MB in the beginning and 350.2 MB in the end (delta: 164.6 MB). Free memory was 148.8 MB in the beginning and 137.3 MB in the end (delta: 11.5 MB). Peak memory consumption was 176.3 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:34,946 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 185.6 MB. Free memory is still 165.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-05 23:54:34,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.63 ms. Allocated memory is still 185.6 MB. Free memory was 148.4 MB in the beginning and 164.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 10.7 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:34,946 INFO L168 Benchmark]: Boogie Preprocessor took 36.41 ms. Allocated memory is still 185.6 MB. Free memory was 164.9 MB in the beginning and 163.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:34,946 INFO L168 Benchmark]: RCFGBuilder took 469.51 ms. Allocated memory is still 185.6 MB. Free memory was 163.0 MB in the beginning and 139.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:34,947 INFO L168 Benchmark]: TraceAbstraction took 5722.86 ms. Allocated memory was 185.6 MB in the beginning and 350.2 MB in the end (delta: 164.6 MB). Free memory was 138.9 MB in the beginning and 137.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 167.1 MB. Max. memory is 8.0 GB. [2021-05-05 23:54:34,947 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 185.6 MB. Free memory is still 165.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 200.63 ms. Allocated memory is still 185.6 MB. Free memory was 148.4 MB in the beginning and 164.9 MB in the end (delta: -16.5 MB). Peak memory consumption was 10.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.41 ms. Allocated memory is still 185.6 MB. Free memory was 164.9 MB in the beginning and 163.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 469.51 ms. Allocated memory is still 185.6 MB. Free memory was 163.0 MB in the beginning and 139.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5722.86 ms. Allocated memory was 185.6 MB in the beginning and 350.2 MB in the end (delta: 164.6 MB). Free memory was 138.9 MB in the beginning and 137.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 167.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: 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: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: 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: 59]: 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, 72 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4456.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 19.7ms, AutomataDifference: 3082.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1206.3ms, InitialAbstractionConstructionTime: 18.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 941 SDtfs, 1948 SDslu, 201 SDs, 0 SdLazy, 1688 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1230.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1687.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 111.9ms AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 26 NumberOfFragments, 193 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3449650758 FormulaSimplificationTreeSizeReduction, 668.4ms HoareSimplificationTime, 7 FomulaSimplificationsInter, 697078 FormulaSimplificationTreeSizeReductionInter, 531.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 30.6ms SsaConstructionTime, 169.4ms SatisfiabilityAnalysisTime, 868.9ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 31]: Loop Invariant Derived loop invariant: (((((0 <= main__i && main__j == 0) && main__i < main__len) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && !(__VERIFIER_assert__cond == 0))) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i < main__len) && 0 <= main__j) && main__j + 5 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (0 <= main__i && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize RESULT: Ultimate proved your program to be correct! Received shutdown request...