/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:23:01,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:23:01,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:23:01,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:23:02,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:23:02,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:23:02,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:23:02,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:23:02,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:23:02,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:23:02,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:23:02,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:23:02,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:23:02,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:23:02,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:23:02,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:23:02,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:23:02,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:23:02,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:23:02,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:23:02,033 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:23:02,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:23:02,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:23:02,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:23:02,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:23:02,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:23:02,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:23:02,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:23:02,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:23:02,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:23:02,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:23:02,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:23:02,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:23:02,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:23:02,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:23:02,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:23:02,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:23:02,040 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:23:02,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:23:02,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:23:02,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:23:02,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:23:02,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:23:02,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:23:02,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:23:02,081 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:23:02,082 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:23:02,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:23:02,082 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:23:02,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:23:02,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:23:02,082 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:23:02,083 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:23:02,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:23:02,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:23:02,084 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:23:02,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:23:02,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:23:02,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:23:02,085 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:23:02,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 12:23:02,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:23:02,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:23:02,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:23:02,323 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:23:02,325 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:23:02,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-05-02 12:23:02,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccd9ad7e/db3f78e1f4584c65b354e33a28203dd6/FLAGdb7453da6 [2021-05-02 12:23:02,745 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:23:02,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2021-05-02 12:23:02,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccd9ad7e/db3f78e1f4584c65b354e33a28203dd6/FLAGdb7453da6 [2021-05-02 12:23:03,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ccd9ad7e/db3f78e1f4584c65b354e33a28203dd6 [2021-05-02 12:23:03,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:23:03,120 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:23:03,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:23:03,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:23:03,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:23:03,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d11e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03, skipping insertion in model container [2021-05-02 12:23:03,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:23:03,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:23:03,252 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-05-02 12:23:03,256 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-05-02 12:23:03,257 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-05-02 12:23:03,259 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-05-02 12:23:03,260 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-05-02 12:23:03,261 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-05-02 12:23:03,262 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-05-02 12:23:03,264 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-05-02 12:23:03,265 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-05-02 12:23:03,266 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-05-02 12:23:03,267 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-05-02 12:23:03,268 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-05-02 12:23:03,270 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-05-02 12:23:03,270 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-05-02 12:23:03,271 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-05-02 12:23:03,272 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-05-02 12:23:03,280 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-05-02 12:23:03,281 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-05-02 12:23:03,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:23:03,289 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:23:03,311 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2021-05-02 12:23:03,312 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2021-05-02 12:23:03,313 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2021-05-02 12:23:03,314 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2021-05-02 12:23:03,322 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2021-05-02 12:23:03,323 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2021-05-02 12:23:03,324 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2021-05-02 12:23:03,325 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2021-05-02 12:23:03,326 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2021-05-02 12:23:03,327 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2021-05-02 12:23:03,327 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2021-05-02 12:23:03,329 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2021-05-02 12:23:03,329 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2021-05-02 12:23:03,330 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2021-05-02 12:23:03,331 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2021-05-02 12:23:03,332 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2021-05-02 12:23:03,332 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2021-05-02 12:23:03,333 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2021-05-02 12:23:03,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:23:03,342 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:23:03,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03 WrapperNode [2021-05-02 12:23:03,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:23:03,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:23:03,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:23:03,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:23:03,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... [2021-05-02 12:23:03,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:23:03,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:23:03,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:23:03,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:23:03,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:23:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:23:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:23:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:23:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:23:03,476 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:23:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:23:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:23:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:23:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:23:03,830 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:23:03,830 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 12:23:03,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:23:03 BoogieIcfgContainer [2021-05-02 12:23:03,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:23:03,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:23:03,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:23:03,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:23:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:23:03" (1/3) ... [2021-05-02 12:23:03,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209eb6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:23:03, skipping insertion in model container [2021-05-02 12:23:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:23:03" (2/3) ... [2021-05-02 12:23:03,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209eb6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:23:03, skipping insertion in model container [2021-05-02 12:23:03,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:23:03" (3/3) ... [2021-05-02 12:23:03,836 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2021-05-02 12:23:03,840 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:23:03,846 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-02 12:23:03,856 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-02 12:23:03,871 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:23:03,871 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:23:03,871 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:23:03,871 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:23:03,871 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:23:03,871 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:23:03,871 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:23:03,871 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:23:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:23:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:23:03,889 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:03,890 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:03,890 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1796468500, now seen corresponding path program 1 times [2021-05-02 12:23:03,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:03,899 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985032770] [2021-05-02 12:23:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:04,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:04,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985032770] [2021-05-02 12:23:04,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985032770] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:04,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:04,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:04,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904079985] [2021-05-02 12:23:04,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:04,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:04,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:04,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:04,126 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 75 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:04,425 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2021-05-02 12:23:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:04,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 12:23:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:04,442 INFO L225 Difference]: With dead ends: 129 [2021-05-02 12:23:04,442 INFO L226 Difference]: Without dead ends: 111 [2021-05-02 12:23:04,445 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 159.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-05-02 12:23:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2021-05-02 12:23:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-05-02 12:23:04,480 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2021-05-02 12:23:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:04,480 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-05-02 12:23:04,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-05-02 12:23:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 12:23:04,481 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:04,481 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:04,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:23:04,482 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1799639252, now seen corresponding path program 1 times [2021-05-02 12:23:04,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:04,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271214872] [2021-05-02 12:23:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:04,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:04,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271214872] [2021-05-02 12:23:04,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271214872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:04,564 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:04,564 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:04,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546838969] [2021-05-02 12:23:04,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:04,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:04,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:04,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:04,566 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:04,763 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-05-02 12:23:04,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:04,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 12:23:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:04,766 INFO L225 Difference]: With dead ends: 111 [2021-05-02 12:23:04,767 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 12:23:04,767 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 87.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 12:23:04,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2021-05-02 12:23:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 67 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-05-02 12:23:04,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2021-05-02 12:23:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:04,782 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-05-02 12:23:04,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-05-02 12:23:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:23:04,783 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:04,783 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:04,783 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:23:04,783 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash -991466384, now seen corresponding path program 1 times [2021-05-02 12:23:04,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:04,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954071329] [2021-05-02 12:23:04,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:04,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:04,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954071329] [2021-05-02 12:23:04,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954071329] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:04,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:04,886 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:04,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725033487] [2021-05-02 12:23:04,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:04,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:04,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:04,887 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:05,026 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-05-02 12:23:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:05,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 12:23:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:05,027 INFO L225 Difference]: With dead ends: 73 [2021-05-02 12:23:05,027 INFO L226 Difference]: Without dead ends: 71 [2021-05-02 12:23:05,028 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 61.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-02 12:23:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2021-05-02 12:23:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-05-02 12:23:05,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2021-05-02 12:23:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:05,031 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-05-02 12:23:05,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,031 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-05-02 12:23:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 12:23:05,032 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:05,032 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:05,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:23:05,032 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1020772778, now seen corresponding path program 1 times [2021-05-02 12:23:05,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:05,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722627289] [2021-05-02 12:23:05,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:05,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:05,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722627289] [2021-05-02 12:23:05,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722627289] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:05,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:05,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:05,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987948285] [2021-05-02 12:23:05,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:05,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:05,116 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:05,266 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-05-02 12:23:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:05,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 12:23:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:05,269 INFO L225 Difference]: With dead ends: 71 [2021-05-02 12:23:05,269 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 12:23:05,270 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 12:23:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2021-05-02 12:23:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-05-02 12:23:05,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2021-05-02 12:23:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:05,273 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-05-02 12:23:05,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-05-02 12:23:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:05,274 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:05,274 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:05,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:23:05,274 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:05,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash -670683748, now seen corresponding path program 1 times [2021-05-02 12:23:05,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:05,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641540212] [2021-05-02 12:23:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:05,341 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:05,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641540212] [2021-05-02 12:23:05,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641540212] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:05,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:05,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:05,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304298438] [2021-05-02 12:23:05,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:05,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:05,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:05,342 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:05,447 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-02 12:23:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:05,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 12:23:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:05,448 INFO L225 Difference]: With dead ends: 69 [2021-05-02 12:23:05,448 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 12:23:05,448 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 12:23:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2021-05-02 12:23:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-05-02 12:23:05,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2021-05-02 12:23:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:05,452 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-05-02 12:23:05,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-05-02 12:23:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:05,452 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:05,452 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:05,452 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:23:05,453 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1578739961, now seen corresponding path program 1 times [2021-05-02 12:23:05,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:05,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677085513] [2021-05-02 12:23:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:05,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:05,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677085513] [2021-05-02 12:23:05,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677085513] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:05,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:05,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:05,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582920637] [2021-05-02 12:23:05,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:05,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:05,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:05,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:05,505 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:05,673 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-05-02 12:23:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:05,974 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2021-05-02 12:23:05,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:05,975 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-02 12:23:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:05,976 INFO L225 Difference]: With dead ends: 108 [2021-05-02 12:23:05,976 INFO L226 Difference]: Without dead ends: 106 [2021-05-02 12:23:05,977 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 198.6ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-02 12:23:06,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 61. [2021-05-02 12:23:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-05-02 12:23:06,018 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 16 [2021-05-02 12:23:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:06,018 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-05-02 12:23:06,019 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-02 12:23:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-05-02 12:23:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:06,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:06,019 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:06,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:23:06,019 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:06,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:06,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1578753863, now seen corresponding path program 1 times [2021-05-02 12:23:06,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:06,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786821684] [2021-05-02 12:23:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:06,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:06,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:06,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786821684] [2021-05-02 12:23:06,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786821684] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:06,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:06,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:06,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652443994] [2021-05-02 12:23:06,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:06,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:06,119 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:07,066 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2021-05-02 12:23:07,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:07,067 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-02 12:23:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:07,068 INFO L225 Difference]: With dead ends: 93 [2021-05-02 12:23:07,068 INFO L226 Difference]: Without dead ends: 91 [2021-05-02 12:23:07,069 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 162.0ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-05-02 12:23:07,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2021-05-02 12:23:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-02 12:23:07,091 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2021-05-02 12:23:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:07,091 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-02 12:23:07,091 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-02 12:23:07,091 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-02 12:23:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 12:23:07,094 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:07,095 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:07,095 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 12:23:07,095 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:07,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1579181860, now seen corresponding path program 1 times [2021-05-02 12:23:07,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:07,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108774796] [2021-05-02 12:23:07,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:07,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:07,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108774796] [2021-05-02 12:23:07,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108774796] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:07,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:07,175 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:07,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129836470] [2021-05-02 12:23:07,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:07,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:07,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:07,180 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:07,284 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-05-02 12:23:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:07,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 12:23:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:07,285 INFO L225 Difference]: With dead ends: 61 [2021-05-02 12:23:07,285 INFO L226 Difference]: Without dead ends: 57 [2021-05-02 12:23:07,285 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-05-02 12:23:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2021-05-02 12:23:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-05-02 12:23:07,293 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2021-05-02 12:23:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-05-02 12:23:07,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-05-02 12:23:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:07,295 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:07,295 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:07,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 12:23:07,295 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash 697862626, now seen corresponding path program 1 times [2021-05-02 12:23:07,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:07,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341048543] [2021-05-02 12:23:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:07,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:07,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341048543] [2021-05-02 12:23:07,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341048543] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:07,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:07,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:07,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282709167] [2021-05-02 12:23:07,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:07,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:07,378 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:07,511 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-05-02 12:23:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:07,512 INFO L225 Difference]: With dead ends: 74 [2021-05-02 12:23:07,512 INFO L226 Difference]: Without dead ends: 72 [2021-05-02 12:23:07,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-02 12:23:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 53. [2021-05-02 12:23:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-05-02 12:23:07,514 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2021-05-02 12:23:07,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:07,514 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-05-02 12:23:07,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-05-02 12:23:07,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:07,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:07,515 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:07,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 12:23:07,515 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:07,516 INFO L82 PathProgramCache]: Analyzing trace with hash 699401826, now seen corresponding path program 1 times [2021-05-02 12:23:07,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:07,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415850292] [2021-05-02 12:23:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:07,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:07,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415850292] [2021-05-02 12:23:07,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415850292] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:07,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:07,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:07,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433234167] [2021-05-02 12:23:07,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:07,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:07,562 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:07,657 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-05-02 12:23:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:07,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:07,658 INFO L225 Difference]: With dead ends: 55 [2021-05-02 12:23:07,658 INFO L226 Difference]: Without dead ends: 53 [2021-05-02 12:23:07,658 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.2ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-02 12:23:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-05-02 12:23:07,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-05-02 12:23:07,660 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2021-05-02 12:23:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:07,660 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-05-02 12:23:07,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-05-02 12:23:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:07,661 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:07,661 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:07,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 12:23:07,661 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1696295318, now seen corresponding path program 1 times [2021-05-02 12:23:07,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:07,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799441479] [2021-05-02 12:23:07,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:07,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:07,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799441479] [2021-05-02 12:23:07,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799441479] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:07,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:07,730 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:07,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65245686] [2021-05-02 12:23:07,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:07,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:07,730 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:07,902 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2021-05-02 12:23:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:07,904 INFO L225 Difference]: With dead ends: 110 [2021-05-02 12:23:07,904 INFO L226 Difference]: Without dead ends: 108 [2021-05-02 12:23:07,906 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 91.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-05-02 12:23:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 56. [2021-05-02 12:23:07,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-05-02 12:23:07,909 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 17 [2021-05-02 12:23:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:07,909 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-05-02 12:23:07,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-05-02 12:23:07,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 12:23:07,909 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:07,909 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:07,910 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-02 12:23:07,910 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:07,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:07,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1696726294, now seen corresponding path program 1 times [2021-05-02 12:23:07,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:07,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532178123] [2021-05-02 12:23:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:07,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:08,001 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:08,001 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532178123] [2021-05-02 12:23:08,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532178123] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:08,001 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:08,001 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:08,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658774202] [2021-05-02 12:23:08,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:08,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:08,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:08,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:08,002 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:08,211 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2021-05-02 12:23:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:08,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 12:23:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:08,212 INFO L225 Difference]: With dead ends: 108 [2021-05-02 12:23:08,212 INFO L226 Difference]: Without dead ends: 106 [2021-05-02 12:23:08,213 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-02 12:23:08,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 58. [2021-05-02 12:23:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-05-02 12:23:08,215 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 17 [2021-05-02 12:23:08,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:08,215 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-05-02 12:23:08,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-05-02 12:23:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:08,216 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:08,216 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:08,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 12:23:08,216 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 160273451, now seen corresponding path program 1 times [2021-05-02 12:23:08,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:08,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084791795] [2021-05-02 12:23:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:08,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:08,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084791795] [2021-05-02 12:23:08,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084791795] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:08,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:08,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:23:08,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949449827] [2021-05-02 12:23:08,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:23:08,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:08,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:23:08,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:23:08,263 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:08,386 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2021-05-02 12:23:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:23:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:08,387 INFO L225 Difference]: With dead ends: 79 [2021-05-02 12:23:08,388 INFO L226 Difference]: Without dead ends: 77 [2021-05-02 12:23:08,388 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.1ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-02 12:23:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2021-05-02 12:23:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-05-02 12:23:08,390 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 18 [2021-05-02 12:23:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:08,390 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-05-02 12:23:08,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-05-02 12:23:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:08,391 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:08,391 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:08,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-02 12:23:08,391 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash 158908031, now seen corresponding path program 1 times [2021-05-02 12:23:08,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:08,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389958621] [2021-05-02 12:23:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:08,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:08,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389958621] [2021-05-02 12:23:08,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389958621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:08,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:08,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:08,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306974756] [2021-05-02 12:23:08,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:08,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:08,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:08,461 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:08,648 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-05-02 12:23:08,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:08,650 INFO L225 Difference]: With dead ends: 90 [2021-05-02 12:23:08,650 INFO L226 Difference]: Without dead ends: 88 [2021-05-02 12:23:08,650 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 106.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-05-02 12:23:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2021-05-02 12:23:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-05-02 12:23:08,653 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 18 [2021-05-02 12:23:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:08,653 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-05-02 12:23:08,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,653 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-05-02 12:23:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 12:23:08,654 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:08,654 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:08,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 12:23:08,654 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash 206623281, now seen corresponding path program 1 times [2021-05-02 12:23:08,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:08,654 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231051343] [2021-05-02 12:23:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:08,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:08,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231051343] [2021-05-02 12:23:08,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231051343] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:08,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:08,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:08,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853822973] [2021-05-02 12:23:08,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:08,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:08,748 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:08,885 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2021-05-02 12:23:08,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:08,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 12:23:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:08,886 INFO L225 Difference]: With dead ends: 74 [2021-05-02 12:23:08,886 INFO L226 Difference]: Without dead ends: 70 [2021-05-02 12:23:08,886 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 121.6ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-05-02 12:23:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2021-05-02 12:23:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2021-05-02 12:23:08,889 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 18 [2021-05-02 12:23:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:08,889 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2021-05-02 12:23:08,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2021-05-02 12:23:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 12:23:08,889 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:08,889 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:08,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 12:23:08,890 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash 673512821, now seen corresponding path program 1 times [2021-05-02 12:23:08,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:08,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993619355] [2021-05-02 12:23:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:08,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:08,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993619355] [2021-05-02 12:23:08,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993619355] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:08,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:08,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:08,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504163190] [2021-05-02 12:23:08,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:08,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:08,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:08,968 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:09,131 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-05-02 12:23:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-02 12:23:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:09,132 INFO L225 Difference]: With dead ends: 91 [2021-05-02 12:23:09,132 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 12:23:09,132 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 98.2ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 12:23:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 66. [2021-05-02 12:23:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2021-05-02 12:23:09,136 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 19 [2021-05-02 12:23:09,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:09,136 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2021-05-02 12:23:09,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2021-05-02 12:23:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 12:23:09,136 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:09,136 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:09,136 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 12:23:09,137 INFO L428 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:09,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1908108286, now seen corresponding path program 1 times [2021-05-02 12:23:09,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:09,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046262554] [2021-05-02 12:23:09,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:09,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:09,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046262554] [2021-05-02 12:23:09,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046262554] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:09,175 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:09,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:09,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061598599] [2021-05-02 12:23:09,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:09,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:09,176 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:09,253 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-05-02 12:23:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:09,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-02 12:23:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:09,253 INFO L225 Difference]: With dead ends: 66 [2021-05-02 12:23:09,254 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 12:23:09,254 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 12:23:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-05-02 12:23:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2021-05-02 12:23:09,257 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 20 [2021-05-02 12:23:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:09,257 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2021-05-02 12:23:09,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2021-05-02 12:23:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-02 12:23:09,257 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:09,257 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:09,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 12:23:09,257 INFO L428 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:09,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:09,258 INFO L82 PathProgramCache]: Analyzing trace with hash 978188398, now seen corresponding path program 1 times [2021-05-02 12:23:09,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:09,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983318616] [2021-05-02 12:23:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:09,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:09,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983318616] [2021-05-02 12:23:09,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983318616] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:09,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:09,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:23:09,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575035475] [2021-05-02 12:23:09,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:23:09,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:23:09,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:23:09,296 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:09,379 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2021-05-02 12:23:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:23:09,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-02 12:23:09,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:09,379 INFO L225 Difference]: With dead ends: 64 [2021-05-02 12:23:09,379 INFO L226 Difference]: Without dead ends: 60 [2021-05-02 12:23:09,380 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-02 12:23:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-05-02 12:23:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-05-02 12:23:09,382 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 21 [2021-05-02 12:23:09,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:09,383 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-05-02 12:23:09,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-05-02 12:23:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:23:09,383 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:09,383 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:09,383 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 12:23:09,383 INFO L428 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash 272309526, now seen corresponding path program 1 times [2021-05-02 12:23:09,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:09,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96938554] [2021-05-02 12:23:09,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:09,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:09,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96938554] [2021-05-02 12:23:09,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96938554] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:09,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:09,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:23:09,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130345906] [2021-05-02 12:23:09,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:23:09,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:23:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:23:09,439 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:09,635 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-05-02 12:23:09,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:09,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 12:23:09,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:09,635 INFO L225 Difference]: With dead ends: 75 [2021-05-02 12:23:09,635 INFO L226 Difference]: Without dead ends: 73 [2021-05-02 12:23:09,636 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-02 12:23:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2021-05-02 12:23:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2021-05-02 12:23:09,638 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 22 [2021-05-02 12:23:09,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:09,639 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2021-05-02 12:23:09,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:09,639 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2021-05-02 12:23:09,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:23:09,639 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:09,639 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:09,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 12:23:09,639 INFO L428 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1682587452, now seen corresponding path program 1 times [2021-05-02 12:23:09,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:09,640 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934670829] [2021-05-02 12:23:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:09,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:09,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934670829] [2021-05-02 12:23:09,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934670829] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:09,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119145831] [2021-05-02 12:23:09,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:09,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 12:23:09,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:23:09,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:09,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:09,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:09,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119145831] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:09,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:23:09,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2021-05-02 12:23:09,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279181353] [2021-05-02 12:23:09,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 12:23:09,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:09,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 12:23:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:23:09,910 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:10,090 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2021-05-02 12:23:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:23:10,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 12:23:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:10,091 INFO L225 Difference]: With dead ends: 72 [2021-05-02 12:23:10,091 INFO L226 Difference]: Without dead ends: 70 [2021-05-02 12:23:10,091 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 122.5ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-05-02 12:23:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-05-02 12:23:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2021-05-02 12:23:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2021-05-02 12:23:10,094 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2021-05-02 12:23:10,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:10,094 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2021-05-02 12:23:10,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2021-05-02 12:23:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:23:10,094 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:10,095 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:23:10,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:10,313 INFO L428 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1683018428, now seen corresponding path program 1 times [2021-05-02 12:23:10,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:10,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430153192] [2021-05-02 12:23:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:10,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:10,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:10,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:10,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430153192] [2021-05-02 12:23:10,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430153192] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:10,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360474162] [2021-05-02 12:23:10,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:10,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 19 conjunts are in the unsatisfiable core [2021-05-02 12:23:10,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:23:10,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:10,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:10,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:10,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:23:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:10,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360474162] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:23:10,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:23:10,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2021-05-02 12:23:10,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491835481] [2021-05-02 12:23:10,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 12:23:10,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 12:23:10,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:10,589 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:10,821 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-05-02 12:23:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-05-02 12:23:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-02 12:23:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:10,822 INFO L225 Difference]: With dead ends: 67 [2021-05-02 12:23:10,822 INFO L226 Difference]: Without dead ends: 65 [2021-05-02 12:23:10,824 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 213.9ms TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2021-05-02 12:23:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-05-02 12:23:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2021-05-02 12:23:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 40 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2021-05-02 12:23:10,829 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 22 [2021-05-02 12:23:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:10,829 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2021-05-02 12:23:10,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2021-05-02 12:23:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:23:10,830 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:10,830 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-02 12:23:11,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:23:11,045 INFO L428 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:11,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:11,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1184340980, now seen corresponding path program 1 times [2021-05-02 12:23:11,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:11,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789271581] [2021-05-02 12:23:11,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:11,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:11,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:11,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789271581] [2021-05-02 12:23:11,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789271581] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:11,101 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:11,101 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 12:23:11,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741889500] [2021-05-02 12:23:11,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 12:23:11,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:11,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 12:23:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:11,102 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:11,241 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2021-05-02 12:23:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:23:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:23:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:11,242 INFO L225 Difference]: With dead ends: 56 [2021-05-02 12:23:11,242 INFO L226 Difference]: Without dead ends: 54 [2021-05-02 12:23:11,242 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 86.8ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:23:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-02 12:23:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2021-05-02 12:23:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2021-05-02 12:23:11,246 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2021-05-02 12:23:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:11,246 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2021-05-02 12:23:11,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2021-05-02 12:23:11,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:23:11,247 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:23:11,247 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-02 12:23:11,247 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 12:23:11,247 INFO L428 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_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, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 12:23:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:23:11,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1136625730, now seen corresponding path program 1 times [2021-05-02 12:23:11,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:23:11,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630566943] [2021-05-02 12:23:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:23:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:11,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:23:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:23:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:23:11,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:23:11,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630566943] [2021-05-02 12:23:11,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630566943] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:23:11,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:23:11,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 12:23:11,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132832179] [2021-05-02 12:23:11,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 12:23:11,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:23:11,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 12:23:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:23:11,325 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:23:11,422 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-05-02 12:23:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:23:11,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:23:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:23:11,423 INFO L225 Difference]: With dead ends: 39 [2021-05-02 12:23:11,423 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:23:11,423 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:23:11,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:23:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:23:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 12:23:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:23:11,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-05-02 12:23:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:23:11,424 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:23:11,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:23:11,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:23:11,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:23:11,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 12:23:11,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:23:11,792 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2021-05-02 12:23:11,906 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 29 [2021-05-02 12:23:11,907 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= ~__return_305~0 |old(~__return_305~0)|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~__tmp_259_0~0 |old(~__tmp_259_0~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:23:11,908 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:23:11,908 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L126(line 126) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 15 402) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L52(line 52) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L176(line 176) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L366(line 366) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L333(line 333) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L234(lines 234 242) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L152(lines 152 160) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L309(line 309) no Hoare annotation was computed. [2021-05-02 12:23:11,909 INFO L198 CegarLoopUtils]: For program point L20(lines 20 401) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L276(lines 276 391) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L70(lines 70 94) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L194 CegarLoopUtils]: At program point L384(lines 282 391) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (let ((.cse0 (let ((.cse3 (not (= main_~__VERIFIER_assert__cond~13 0)))) (or (and (not (= main_~__VERIFIER_assert__cond~18 0)) .cse3) (and .cse1 .cse3)))) (.cse2 (= main_~__VERIFIER_assert__cond~12 1))) (or (and .cse0 .cse1 (not (= main_~main__tagbuf_len~0 0)) .cse2 (< 0 (+ main_~main__tagbuf_len~0 1))) (and .cse0 (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~19 1) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) .cse2 (<= 0 main_~main__t~0))))) [2021-05-02 12:23:11,910 INFO L194 CegarLoopUtils]: At program point L351(lines 32 395) the Hoare annotation is: (let ((.cse1 (= main_~main__t~0 0))) (or (and (< main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (let ((.cse0 (or .cse1 (and (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~13 0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~19 0)) .cse0) (and .cse0 (<= main_~main__t~0 1)))) (= main_~__VERIFIER_assert__cond~17 1) (<= 0 main_~main__t~0)) (and .cse1 (not (= main_~main__tagbuf_len~0 0)) (< 0 (+ main_~main__tagbuf_len~0 1))))) [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L186(lines 186 196) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L376(lines 376 385) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L343(lines 343 352) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point L112(lines 112 203) no Hoare annotation was computed. [2021-05-02 12:23:11,910 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 15 402) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L236(line 236) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L194 CegarLoopUtils]: At program point L195(lines 56 253) the Hoare annotation is: (and (<= 1 main_~main__t~0) (<= main_~main__t~0 main_~main__tagbuf_len~0)) [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 15 402) the Hoare annotation is: (and (= |old(~__tmp_259_0~0)| ~__tmp_259_0~0) (= |old(~__return_305~0)| ~__return_305~0) (= |old(~__tmp_383_0~0)| ~__tmp_383_0~0)) [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L154(line 154) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L278(line 278) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L105(lines 105 209) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L72(line 72) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L39(lines 39 255) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L295(lines 295 317) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L188(line 188) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L378(line 378) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L345(line 345) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2021-05-02 12:23:11,911 INFO L198 CegarLoopUtils]: For program point L114(line 114) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L32(lines 32 395) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L288(lines 288 390) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L222(lines 222 244) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L24(lines 24 396) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L82(lines 82 92) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L140(lines 140 162) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L297(line 297) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L198 CegarLoopUtils]: For program point L124(lines 124 201) no Hoare annotation was computed. [2021-05-02 12:23:11,912 INFO L201 CegarLoopUtils]: At program point L314(lines 32 395) the Hoare annotation is: true [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L215(lines 215 250) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L50(lines 50 253) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L174(lines 174 198) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L364(lines 364 387) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L331(lines 331 354) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L265(lines 265 393) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L133(lines 133 200) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L224(line 224) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L194 CegarLoopUtils]: At program point L249(lines 101 251) the Hoare annotation is: (and (< main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L84(line 84) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L307(lines 307 315) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2021-05-02 12:23:11,913 INFO L198 CegarLoopUtils]: For program point L142(line 142) no Hoare annotation was computed. [2021-05-02 12:23:11,914 INFO L198 CegarLoopUtils]: For program point L101(lines 101 251) no Hoare annotation was computed. [2021-05-02 12:23:11,914 INFO L198 CegarLoopUtils]: For program point L324(lines 324 389) no Hoare annotation was computed. [2021-05-02 12:23:11,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:23:11 BoogieIcfgContainer [2021-05-02 12:23:11,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:23:11,935 INFO L168 Benchmark]: Toolchain (without parser) took 8815.20 ms. Allocated memory was 201.3 MB in the beginning and 358.6 MB in the end (delta: 157.3 MB). Free memory was 166.8 MB in the beginning and 310.3 MB in the end (delta: -143.5 MB). Peak memory consumption was 158.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 201.3 MB. Free memory is still 183.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.38 ms. Allocated memory is still 201.3 MB. Free memory was 166.6 MB in the beginning and 182.2 MB in the end (delta: -15.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 INFO L168 Benchmark]: Boogie Preprocessor took 68.28 ms. Allocated memory is still 201.3 MB. Free memory was 182.2 MB in the beginning and 183.7 MB in the end (delta: -1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 INFO L168 Benchmark]: RCFGBuilder took 419.34 ms. Allocated memory is still 201.3 MB. Free memory was 183.7 MB in the beginning and 155.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 INFO L168 Benchmark]: TraceAbstraction took 8102.49 ms. Allocated memory was 201.3 MB in the beginning and 358.6 MB in the end (delta: 157.3 MB). Free memory was 155.4 MB in the beginning and 310.3 MB in the end (delta: -154.9 MB). Peak memory consumption was 146.0 MB. Max. memory is 8.0 GB. [2021-05-02 12:23:11,936 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.11 ms. Allocated memory is still 201.3 MB. Free memory is still 183.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 219.38 ms. Allocated memory is still 201.3 MB. Free memory was 166.6 MB in the beginning and 182.2 MB in the end (delta: -15.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.28 ms. Allocated memory is still 201.3 MB. Free memory was 182.2 MB in the beginning and 183.7 MB in the end (delta: -1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 419.34 ms. Allocated memory is still 201.3 MB. Free memory was 183.7 MB in the beginning and 155.9 MB in the end (delta: 27.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8102.49 ms. Allocated memory was 201.3 MB in the beginning and 358.6 MB in the end (delta: 157.3 MB). Free memory was 155.4 MB in the beginning and 310.3 MB in the end (delta: -154.9 MB). Peak memory consumption was 146.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7555.0ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 17.2ms, AutomataDifference: 4715.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 482.9ms, InitialAbstractionConstructionTime: 11.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1069 SDtfs, 1641 SDslu, 1718 SDs, 0 SdLazy, 3451 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2482.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 116 SyntacticMatches, 4 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2299.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 161.5ms AutomataMinimizationTime, 23 MinimizatonAttempts, 432 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 203 HoareAnnotationTreeSize, 9 FomulaSimplifications, 3139453 FormulaSimplificationTreeSizeReduction, 133.1ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 11823 FormulaSimplificationTreeSizeReductionInter, 342.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 57.6ms SsaConstructionTime, 220.8ms SatisfiabilityAnalysisTime, 1724.7ms InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 2341 SizeOfPredicates, 13 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((main__t < main__tagbuf_len && __VERIFIER_assert__cond == 1) && ((!(__VERIFIER_assert__cond == 0) && (main__t == 0 || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)))) || ((main__t == 0 || (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0))) && main__t <= 1))) && __VERIFIER_assert__cond == 1) && 0 <= main__t) || ((main__t == 0 && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) || (main__t == 0 && !(__VERIFIER_assert__cond == 0))) && main__t == 0) && !(main__tagbuf_len == 0)) && __VERIFIER_assert__cond == 1) && 0 < main__tagbuf_len + 1) || (((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) || (main__t == 0 && !(__VERIFIER_assert__cond == 0))) && main__t <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && !(main__tagbuf_len == main__t)) && __VERIFIER_assert__cond == 1) && 0 <= main__t) RESULT: Ultimate proved your program to be correct! Received shutdown request...