/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-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 12:21:18,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 12:21:18,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 12:21:18,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 12:21:18,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 12:21:18,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 12:21:18,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 12:21:18,930 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 12:21:18,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 12:21:18,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 12:21:18,935 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 12:21:18,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 12:21:18,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 12:21:18,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 12:21:18,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 12:21:18,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 12:21:18,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 12:21:18,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 12:21:18,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 12:21:18,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 12:21:18,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 12:21:18,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 12:21:18,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 12:21:18,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 12:21:18,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 12:21:18,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 12:21:18,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 12:21:18,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 12:21:18,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 12:21:18,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 12:21:18,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 12:21:18,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 12:21:18,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 12:21:18,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 12:21:18,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 12:21:18,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 12:21:18,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 12:21:18,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 12:21:18,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 12:21:18,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 12:21:18,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 12:21:18,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 12:21:18,997 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 12:21:18,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 12:21:19,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 12:21:19,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 12:21:19,000 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 12:21:19,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 12:21:19,000 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 12:21:19,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 12:21:19,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 12:21:19,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 12:21:19,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 12:21:19,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 12:21:19,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 12:21:19,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 12:21:19,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:21:19,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 12:21:19,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 12:21:19,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 12:21:19,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 12:21:19,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 12:21:19,240 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 12:21:19,241 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 12:21:19,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-02 12:21:19,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b69316/615a19c6f7014805b006bb30991aab8a/FLAGf00f3a3c0 [2021-05-02 12:21:19,638 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 12:21:19,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-02 12:21:19,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b69316/615a19c6f7014805b006bb30991aab8a/FLAGf00f3a3c0 [2021-05-02 12:21:20,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199b69316/615a19c6f7014805b006bb30991aab8a [2021-05-02 12:21:20,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 12:21:20,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 12:21:20,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:20,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 12:21:20,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 12:21:20,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7577e6b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20, skipping insertion in model container [2021-05-02 12:21:20,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 12:21:20,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 12:21:20,188 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-02 12:21:20,191 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-02 12:21:20,192 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-02 12:21:20,193 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-02 12:21:20,195 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-02 12:21:20,196 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-02 12:21:20,197 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-02 12:21:20,199 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-02 12:21:20,201 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-02 12:21:20,202 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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-02 12:21:20,203 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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-02 12:21:20,204 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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-02 12:21:20,205 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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-02 12:21:20,207 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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-02 12:21:20,208 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-02 12:21:20,209 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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-02 12:21:20,210 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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-02 12:21:20,211 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-02 12:21:20,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:20,218 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 12:21:20,231 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-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-05-02 12:21:20,232 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-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-05-02 12:21:20,233 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-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-05-02 12:21:20,233 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-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-05-02 12:21:20,245 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-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-05-02 12:21:20,246 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-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-05-02 12:21:20,247 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-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-05-02 12:21:20,248 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-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-05-02 12:21:20,249 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-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-05-02 12:21:20,269 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-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-05-02 12:21:20,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-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-05-02 12:21:20,273 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-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-05-02 12:21:20,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 12:21:20,282 INFO L208 MainTranslator]: Completed translation [2021-05-02 12:21:20,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20 WrapperNode [2021-05-02 12:21:20,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 12:21:20,283 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 12:21:20,283 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 12:21:20,283 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 12:21:20,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... [2021-05-02 12:21:20,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 12:21:20,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 12:21:20,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 12:21:20,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 12:21:20,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 12:21:20,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 12:21:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 12:21:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 12:21:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-02 12:21:20,382 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 12:21:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 12:21:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 12:21:20,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 12:21:20,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 12:21:20,775 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-02 12:21:20,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:20 BoogieIcfgContainer [2021-05-02 12:21:20,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 12:21:20,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 12:21:20,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 12:21:20,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 12:21:20,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 12:21:20" (1/3) ... [2021-05-02 12:21:20,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c56309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:20, skipping insertion in model container [2021-05-02 12:21:20,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 12:21:20" (2/3) ... [2021-05-02 12:21:20,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c56309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 12:21:20, skipping insertion in model container [2021-05-02 12:21:20,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 12:21:20" (3/3) ... [2021-05-02 12:21:20,781 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-05-02 12:21:20,784 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 12:21:20,787 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-02 12:21:20,798 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-02 12:21:20,813 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 12:21:20,813 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 12:21:20,813 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 12:21:20,813 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 12:21:20,813 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 12:21:20,813 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 12:21:20,813 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 12:21:20,813 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 12:21:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 12:21:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-02 12:21:20,829 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:20,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] [2021-05-02 12:21:20,830 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:21:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2021-05-02 12:21:20,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:20,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523669352] [2021-05-02 12:21:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:21,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:21,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523669352] [2021-05-02 12:21:21,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523669352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:21,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:21,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 12:21:21,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553265689] [2021-05-02 12:21:21,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 12:21:21,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:21,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 12:21:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 12:21:21,044 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:21:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:21,236 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2021-05-02 12:21:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 12:21:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:21:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:21,243 INFO L225 Difference]: With dead ends: 93 [2021-05-02 12:21:21,244 INFO L226 Difference]: Without dead ends: 80 [2021-05-02 12:21:21,247 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-02 12:21:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-02 12:21:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-02 12:21:21,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-02 12:21:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:21,277 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-02 12:21:21,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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:21:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-02 12:21:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 12:21:21,278 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:21,278 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:21:21,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 12:21:21,279 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:21:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:21,280 INFO L82 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2021-05-02 12:21:21,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:21,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475097209] [2021-05-02 12:21:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:21,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:21,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475097209] [2021-05-02 12:21:21,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475097209] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:21,418 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:21,418 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:21:21,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480589] [2021-05-02 12:21:21,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:21:21,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:21,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:21:21,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:21,420 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:21:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:21,754 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-05-02 12:21:21,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:21,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:21:21,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:21,758 INFO L225 Difference]: With dead ends: 80 [2021-05-02 12:21:21,758 INFO L226 Difference]: Without dead ends: 78 [2021-05-02 12:21:21,759 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 266.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-02 12:21:21,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-02 12:21:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-02 12:21:21,781 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-02 12:21:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:21,781 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-02 12:21:21,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:21:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-02 12:21:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-02 12:21:21,781 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:21,782 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:21:21,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 12:21:21,782 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:21:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:21,782 INFO L82 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2021-05-02 12:21:21,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:21,783 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128415512] [2021-05-02 12:21:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:21,856 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:21,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128415512] [2021-05-02 12:21:21,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128415512] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:21,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:21,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:21,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569297120] [2021-05-02 12:21:21,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:21,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:21,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:21,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:21,857 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:21:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:22,118 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-05-02 12:21:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:22,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:21:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:22,119 INFO L225 Difference]: With dead ends: 101 [2021-05-02 12:21:22,119 INFO L226 Difference]: Without dead ends: 99 [2021-05-02 12:21:22,119 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 158.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:21:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-02 12:21:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-02 12:21:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-02 12:21:22,124 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-02 12:21:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:22,124 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-02 12:21:22,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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:21:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-02 12:21:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-02 12:21:22,125 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:22,125 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:21:22,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 12:21:22,125 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:21:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2021-05-02 12:21:22,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:22,126 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539416892] [2021-05-02 12:21:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:22,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:22,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539416892] [2021-05-02 12:21:22,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539416892] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:22,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:22,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:22,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268173846] [2021-05-02 12:21:22,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:22,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:22,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:22,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:22,208 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:22,351 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-02 12:21:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-05-02 12:21:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:22,352 INFO L225 Difference]: With dead ends: 76 [2021-05-02 12:21:22,352 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 12:21:22,353 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 97.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 12:21:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-02 12:21:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 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:21:22,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-02 12:21:22,367 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-02 12:21:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:22,367 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-02 12:21:22,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-02 12:21:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 12:21:22,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:22,368 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:22,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 12:21:22,370 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:21:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:22,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2021-05-02 12:21:22,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:22,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079843084] [2021-05-02 12:21:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:22,449 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:22,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079843084] [2021-05-02 12:21:22,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079843084] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:22,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:22,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:22,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786056021] [2021-05-02 12:21:22,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:22,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:22,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:22,454 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:22,889 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-05-02 12:21:22,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:22,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2021-05-02 12:21:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:22,890 INFO L225 Difference]: With dead ends: 141 [2021-05-02 12:21:22,890 INFO L226 Difference]: Without dead ends: 139 [2021-05-02 12:21:22,890 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 201.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-02 12:21:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-02 12:21:22,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-02 12:21:22,895 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-02 12:21:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:22,895 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-02 12:21:22,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-02 12:21:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-02 12:21:22,896 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:22,896 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:22,896 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 12:21:22,896 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:21:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2021-05-02 12:21:22,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:22,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310481527] [2021-05-02 12:21:22,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:22,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:22,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310481527] [2021-05-02 12:21:22,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310481527] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:22,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:22,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:22,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786694676] [2021-05-02 12:21:22,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:22,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:22,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:22,961 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:23,350 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-02 12:21:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:23,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 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 26 [2021-05-02 12:21:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:23,352 INFO L225 Difference]: With dead ends: 108 [2021-05-02 12:21:23,352 INFO L226 Difference]: Without dead ends: 106 [2021-05-02 12:21:23,352 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 188.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:23,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-02 12:21:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-02 12:21:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-02 12:21:23,356 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-02 12:21:23,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:23,356 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-02 12:21:23,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,356 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-02 12:21:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 12:21:23,357 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:23,357 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:23,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 12:21:23,357 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:21:23,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:23,357 INFO L82 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2021-05-02 12:21:23,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:23,358 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618480492] [2021-05-02 12:21:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:23,413 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:23,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618480492] [2021-05-02 12:21:23,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618480492] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:23,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:23,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:23,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118425808] [2021-05-02 12:21:23,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:23,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:23,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:23,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:23,414 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:23,693 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-05-02 12:21:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:23,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2021-05-02 12:21:23,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:23,694 INFO L225 Difference]: With dead ends: 121 [2021-05-02 12:21:23,694 INFO L226 Difference]: Without dead ends: 119 [2021-05-02 12:21:23,694 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:23,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-02 12:21:23,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-02 12:21:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-02 12:21:23,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-02 12:21:23,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:23,699 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-02 12:21:23,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,699 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-02 12:21:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-02 12:21:23,699 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:23,699 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:23,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 12:21:23,699 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:21:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2021-05-02 12:21:23,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:23,700 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797333025] [2021-05-02 12:21:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:23,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:23,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797333025] [2021-05-02 12:21:23,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797333025] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:23,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:23,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:23,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598256328] [2021-05-02 12:21:23,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:23,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:23,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:23,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:23,758 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:23,937 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-05-02 12:21:23,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:23,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2021-05-02 12:21:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:23,940 INFO L225 Difference]: With dead ends: 77 [2021-05-02 12:21:23,940 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 12:21:23,940 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 132.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:23,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 12:21:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 12:21:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-02 12:21:23,944 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-02 12:21:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:23,944 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-02 12:21:23,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-02 12:21:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-02 12:21:23,945 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:23,945 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:23,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 12:21:23,945 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:21:23,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:23,945 INFO L82 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2021-05-02 12:21:23,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:23,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286884118] [2021-05-02 12:21:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:23,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:23,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286884118] [2021-05-02 12:21:23,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286884118] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:23,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:23,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 12:21:23,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415793276] [2021-05-02 12:21:23,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 12:21:23,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 12:21:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 12:21:23,986 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:24,085 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-02 12:21:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 12:21:24,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2021-05-02 12:21:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:24,086 INFO L225 Difference]: With dead ends: 115 [2021-05-02 12:21:24,086 INFO L226 Difference]: Without dead ends: 75 [2021-05-02 12:21:24,087 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-02 12:21:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-02 12:21:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-02 12:21:24,091 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-02 12:21:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:24,091 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-02 12:21:24,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-02 12:21:24,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 12:21:24,092 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:24,092 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:24,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 12:21:24,092 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:21:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2021-05-02 12:21:24,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:24,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351354872] [2021-05-02 12:21:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:24,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:24,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:24,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351354872] [2021-05-02 12:21:24,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351354872] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:24,141 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:24,141 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:24,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603064584] [2021-05-02 12:21:24,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:24,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:24,142 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:24,309 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-02 12:21:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2021-05-02 12:21:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:24,310 INFO L225 Difference]: With dead ends: 76 [2021-05-02 12:21:24,310 INFO L226 Difference]: Without dead ends: 74 [2021-05-02 12:21:24,311 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 122.2ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-02 12:21:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-02 12:21:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-02 12:21:24,315 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-02 12:21:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:24,315 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-02 12:21:24,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-02 12:21:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-02 12:21:24,316 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:24,316 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:24,316 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-02 12:21:24,316 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:21:24,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2021-05-02 12:21:24,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:24,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912732142] [2021-05-02 12:21:24,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:24,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-02 12:21:24,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:24,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912732142] [2021-05-02 12:21:24,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912732142] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:24,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609643515] [2021-05-02 12:21:24,369 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:21:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:24,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 12:21:24,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:21:24,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:24,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:24,597 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:24,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:24,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609643515] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:24,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:21:24,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2021-05-02 12:21:24,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957307354] [2021-05-02 12:21:24,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 12:21:24,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 12:21:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:21:24,624 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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:21:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:25,079 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-05-02 12:21:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:21:25,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 30 [2021-05-02 12:21:25,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:25,081 INFO L225 Difference]: With dead ends: 111 [2021-05-02 12:21:25,081 INFO L226 Difference]: Without dead ends: 109 [2021-05-02 12:21:25,081 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 305.0ms TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-05-02 12:21:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-02 12:21:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-02 12:21:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 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:21:25,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-02 12:21:25,090 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-02 12:21:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:25,091 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-02 12:21:25,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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:21:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-02 12:21:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 12:21:25,093 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:25,093 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:25,309 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-05-02 12:21:25,311 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:21:25,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2021-05-02 12:21:25,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:25,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744392064] [2021-05-02 12:21:25,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:25,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:25,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:25,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744392064] [2021-05-02 12:21:25,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744392064] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:25,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:25,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:25,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275082897] [2021-05-02 12:21:25,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:25,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:25,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:25,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:25,367 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:25,483 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-02 12:21:25,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2021-05-02 12:21:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:25,485 INFO L225 Difference]: With dead ends: 70 [2021-05-02 12:21:25,486 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 12:21:25,486 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:25,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 12:21:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-02 12:21:25,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 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:21:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-02 12:21:25,490 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-02 12:21:25,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:25,491 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-02 12:21:25,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-02 12:21:25,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-02 12:21:25,494 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:25,494 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:25,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-02 12:21:25,494 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:21:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:25,495 INFO L82 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2021-05-02 12:21:25,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:25,495 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236871249] [2021-05-02 12:21:25,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:25,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-05-02 12:21:25,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:25,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236871249] [2021-05-02 12:21:25,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236871249] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:25,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209185541] [2021-05-02 12:21:25,559 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:21:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:25,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 21 conjunts are in the unsatisfiable core [2021-05-02 12:21:25,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:21:25,715 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:25,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:25,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:25,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209185541] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:25,757 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:21:25,757 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2021-05-02 12:21:25,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892372508] [2021-05-02 12:21:25,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 12:21:25,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 12:21:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:21:25,758 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:26,096 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-02 12:21:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 12:21:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-05-02 12:21:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:26,097 INFO L225 Difference]: With dead ends: 69 [2021-05-02 12:21:26,097 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 12:21:26,097 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 287.9ms TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2021-05-02 12:21:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 12:21:26,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-02 12:21:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-02 12:21:26,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-02 12:21:26,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:26,100 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-02 12:21:26,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-02 12:21:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-02 12:21:26,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:26,101 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:26,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-02 12:21:26,316 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:21:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2021-05-02 12:21:26,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:26,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330918553] [2021-05-02 12:21:26,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:26,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:26,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330918553] [2021-05-02 12:21:26,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330918553] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:26,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:26,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:26,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264504196] [2021-05-02 12:21:26,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:26,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:26,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:26,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:26,377 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:26,511 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-05-02 12:21:26,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:26,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2021-05-02 12:21:26,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:26,512 INFO L225 Difference]: With dead ends: 63 [2021-05-02 12:21:26,512 INFO L226 Difference]: Without dead ends: 61 [2021-05-02 12:21:26,512 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 99.6ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-02 12:21:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-02 12:21:26,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-02 12:21:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 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:21:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-02 12:21:26,515 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-02 12:21:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:26,515 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-02 12:21:26,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-02 12:21:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-02 12:21:26,515 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:26,515 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:26,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-02 12:21:26,515 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:21:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2021-05-02 12:21:26,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:26,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326098808] [2021-05-02 12:21:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:26,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:26,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326098808] [2021-05-02 12:21:26,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326098808] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:26,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:26,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 12:21:26,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132146868] [2021-05-02 12:21:26,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 12:21:26,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:26,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 12:21:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-02 12:21:26,571 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:26,726 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-05-02 12:21:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 12:21:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 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 35 [2021-05-02 12:21:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:26,727 INFO L225 Difference]: With dead ends: 71 [2021-05-02 12:21:26,727 INFO L226 Difference]: Without dead ends: 69 [2021-05-02 12:21:26,727 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:26,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-02 12:21:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-02 12:21:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-02 12:21:26,730 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-02 12:21:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:26,730 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-02 12:21:26,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:26,730 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-02 12:21:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-02 12:21:26,730 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:26,730 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:26,730 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-02 12:21:26,731 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:21:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2021-05-02 12:21:26,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:26,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498290247] [2021-05-02 12:21:26,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:26,791 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:26,791 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498290247] [2021-05-02 12:21:26,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498290247] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:26,792 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:26,792 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:26,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324457968] [2021-05-02 12:21:26,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:26,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:26,793 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:27,083 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-02 12:21:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 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 38 [2021-05-02 12:21:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:27,084 INFO L225 Difference]: With dead ends: 91 [2021-05-02 12:21:27,084 INFO L226 Difference]: Without dead ends: 89 [2021-05-02 12:21:27,084 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-02 12:21:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-02 12:21:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 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:21:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-02 12:21:27,088 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-02 12:21:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:27,088 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-02 12:21:27,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-02 12:21:27,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-02 12:21:27,088 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:27,088 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:27,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-02 12:21:27,089 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:21:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2021-05-02 12:21:27,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:27,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996547874] [2021-05-02 12:21:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:27,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:27,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996547874] [2021-05-02 12:21:27,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996547874] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:27,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:27,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:27,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840170759] [2021-05-02 12:21:27,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:27,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:27,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:27,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:27,144 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:27,328 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-02 12:21:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 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 39 [2021-05-02 12:21:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:27,335 INFO L225 Difference]: With dead ends: 61 [2021-05-02 12:21:27,335 INFO L226 Difference]: Without dead ends: 59 [2021-05-02 12:21:27,335 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 131.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-02 12:21:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-02 12:21:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 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:21:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-02 12:21:27,338 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-02 12:21:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:27,338 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-02 12:21:27,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-02 12:21:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-02 12:21:27,339 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:27,339 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:27,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-02 12:21:27,339 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:21:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2021-05-02 12:21:27,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:27,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081371467] [2021-05-02 12:21:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:27,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:27,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081371467] [2021-05-02 12:21:27,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081371467] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:27,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:27,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 12:21:27,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991980246] [2021-05-02 12:21:27,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 12:21:27,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:27,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 12:21:27,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-02 12:21:27,383 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:27,520 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-02 12:21:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:27,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2021-05-02 12:21:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:27,520 INFO L225 Difference]: With dead ends: 70 [2021-05-02 12:21:27,520 INFO L226 Difference]: Without dead ends: 68 [2021-05-02 12:21:27,521 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:21:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-02 12:21:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-02 12:21:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 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:21:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-02 12:21:27,524 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-02 12:21:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:27,524 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-02 12:21:27,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-02 12:21:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-02 12:21:27,524 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:27,524 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:27,524 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-02 12:21:27,525 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:21:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:27,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2021-05-02 12:21:27,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:27,525 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102089587] [2021-05-02 12:21:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:27,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:27,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102089587] [2021-05-02 12:21:27,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102089587] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:27,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:27,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:27,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012368724] [2021-05-02 12:21:27,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:27,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:27,576 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:27,735 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-05-02 12:21:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:27,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 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 42 [2021-05-02 12:21:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:27,736 INFO L225 Difference]: With dead ends: 66 [2021-05-02 12:21:27,736 INFO L226 Difference]: Without dead ends: 64 [2021-05-02 12:21:27,738 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-02 12:21:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-02 12:21:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 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:21:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-02 12:21:27,741 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-02 12:21:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:27,741 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-02 12:21:27,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-02 12:21:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-02 12:21:27,742 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:27,742 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:27,742 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-02 12:21:27,742 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:21:27,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:27,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2021-05-02 12:21:27,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:27,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091252801] [2021-05-02 12:21:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:27,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:27,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091252801] [2021-05-02 12:21:27,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091252801] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:27,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:27,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:27,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468902728] [2021-05-02 12:21:27,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:27,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:27,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:27,798 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:28,096 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-05-02 12:21:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 12:21:28,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2021-05-02 12:21:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:28,097 INFO L225 Difference]: With dead ends: 88 [2021-05-02 12:21:28,097 INFO L226 Difference]: Without dead ends: 86 [2021-05-02 12:21:28,098 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 190.7ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-02 12:21:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-02 12:21:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-02 12:21:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 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:21:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-02 12:21:28,101 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-02 12:21:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:28,101 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-02 12:21:28,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-02 12:21:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 12:21:28,101 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:28,101 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, 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:21:28,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-02 12:21:28,102 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:21:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:28,102 INFO L82 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2021-05-02 12:21:28,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:28,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920090077] [2021-05-02 12:21:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:28,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:28,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:28,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920090077] [2021-05-02 12:21:28,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920090077] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:28,151 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63285585] [2021-05-02 12:21:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:21:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:28,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 12:21:28,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 12:21:28,260 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:28,262 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:28,273 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:28,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:28,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 12:21:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:28,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63285585] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 12:21:28,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 12:21:28,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-05-02 12:21:28,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038333657] [2021-05-02 12:21:28,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 12:21:28,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 12:21:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-05-02 12:21:28,289 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 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:21:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:28,601 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2021-05-02 12:21:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:21:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 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 44 [2021-05-02 12:21:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:28,602 INFO L225 Difference]: With dead ends: 64 [2021-05-02 12:21:28,602 INFO L226 Difference]: Without dead ends: 62 [2021-05-02 12:21:28,602 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 217.0ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-05-02 12:21:28,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-02 12:21:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2021-05-02 12:21:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 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:21:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-02 12:21:28,605 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-02 12:21:28,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:28,606 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-02 12:21:28,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 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:21:28,606 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-02 12:21:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-02 12:21:28,606 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:28,606 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:28,820 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 12:21:28,823 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:21:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2021-05-02 12:21:28,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:28,823 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990997914] [2021-05-02 12:21:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:28,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 12:21:28,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:28,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990997914] [2021-05-02 12:21:28,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990997914] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:28,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:28,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:28,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912524259] [2021-05-02 12:21:28,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:28,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:28,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:28,867 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:29,062 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-02 12:21:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 12:21:29,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 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 44 [2021-05-02 12:21:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:29,064 INFO L225 Difference]: With dead ends: 69 [2021-05-02 12:21:29,064 INFO L226 Difference]: Without dead ends: 67 [2021-05-02 12:21:29,064 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 136.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 12:21:29,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-02 12:21:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-05-02 12:21:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 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:21:29,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-02 12:21:29,067 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-02 12:21:29,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:29,068 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-02 12:21:29,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:29,068 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-02 12:21:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-02 12:21:29,068 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 12:21:29,068 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 12:21:29,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-02 12:21:29,068 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:21:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 12:21:29,069 INFO L82 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2021-05-02 12:21:29,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 12:21:29,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785491200] [2021-05-02 12:21:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 12:21:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:29,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 12:21:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 12:21:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-02 12:21:29,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 12:21:29,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785491200] [2021-05-02 12:21:29,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785491200] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 12:21:29,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 12:21:29,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 12:21:29,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824770864] [2021-05-02 12:21:29,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 12:21:29,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 12:21:29,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 12:21:29,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 12:21:29,117 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 12:21:29,418 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-02 12:21:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 12:21:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-05-02 12:21:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 12:21:29,419 INFO L225 Difference]: With dead ends: 75 [2021-05-02 12:21:29,419 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 12:21:29,419 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 216.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-02 12:21:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 12:21:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 12:21:29,420 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:21:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 12:21:29,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-02 12:21:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 12:21:29,420 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 12:21:29,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 12:21:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 12:21:29,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 12:21:29,420 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-02 12:21:29,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 12:21:29,581 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 157 [2021-05-02 12:21:30,067 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2021-05-02 12:21:30,184 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 30 [2021-05-02 12:21:30,519 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2021-05-02 12:21:30,627 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= ~__return_375~0 |old(~__return_375~0)|)) [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-05-02 12:21:30,644 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 12:21:30,644 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 12:21:30,644 INFO L198 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point mainEXIT(lines 13 439) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L374(line 374) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L308(line 308) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L226(line 226) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-05-02 12:21:30,645 INFO L198 CegarLoopUtils]: For program point L284(line 284) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L243(line 243) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L194 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (= main_~__VERIFIER_assert__cond~3 1)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse5 (<= (+ main_~main__cp~0 1) main_~main__urilen~0))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4 .cse5) (and .cse0 (= main_~__VERIFIER_assert__cond~16 1) .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse2 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse3 .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2021-05-02 12:21:30,646 INFO L194 CegarLoopUtils]: At program point L401(lines 131 402) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (< 0 main_~main__scheme~0)) (.cse1 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse2 (<= 1 main_~main__cp~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~2 1) .cse2 .cse3))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-02 12:21:30,646 INFO L198 CegarLoopUtils]: For program point mainFINAL(lines 13 439) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L194 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~main__urilen~0 .cse17))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (= main_~__VERIFIER_assert__cond~4 1)) (.cse10 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (<= .cse17 main_~main__urilen~0)) (.cse12 (= main_~__VERIFIER_assert__cond~9 1)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse16)))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse0 (= main_~main__c~0 0)))) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L194 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2021-05-02 12:21:30,647 INFO L198 CegarLoopUtils]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L386(line 386) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L296(line 296) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-05-02 12:21:30,648 INFO L198 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L272(line 272) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L198 CegarLoopUtils]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-05-02 12:21:30,649 INFO L194 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse3 (< 0 main_~main__scheme~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse0 (= main_~main__c~0 0)) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= main_~__VERIFIER_assert__cond~4 1)) (.cse16 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (<= .cse17 main_~main__urilen~0)) (.cse11 (= main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and (let ((.cse1 (let ((.cse6 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse15))))) (or (and .cse0 .cse1) (and .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)))) .cse16 (<= 1 main_~__VERIFIER_assert__cond~10)) (and (< .cse17 main_~main__urilen~0) .cse2 .cse3 .cse4 .cse5 .cse0 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~6 1) .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= main_~__VERIFIER_assert__cond~8 1) .cse15)))) [2021-05-02 12:21:30,650 INFO L198 CegarLoopUtils]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-05-02 12:21:30,650 INFO L198 CegarLoopUtils]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-05-02 12:21:30,650 INFO L198 CegarLoopUtils]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-05-02 12:21:30,650 INFO L198 CegarLoopUtils]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-05-02 12:21:30,650 INFO L198 CegarLoopUtils]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-05-02 12:21:30,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 12:21:30 BoogieIcfgContainer [2021-05-02 12:21:30,666 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 12:21:30,666 INFO L168 Benchmark]: Toolchain (without parser) took 10617.80 ms. Allocated memory was 187.7 MB in the beginning and 390.1 MB in the end (delta: 202.4 MB). Free memory was 151.3 MB in the beginning and 308.9 MB in the end (delta: -157.6 MB). Peak memory consumption was 177.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:30,666 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 187.7 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 12:21:30,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.48 ms. Allocated memory is still 187.7 MB. Free memory was 151.1 MB in the beginning and 165.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:30,667 INFO L168 Benchmark]: Boogie Preprocessor took 47.99 ms. Allocated memory is still 187.7 MB. Free memory was 165.5 MB in the beginning and 163.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:30,667 INFO L168 Benchmark]: RCFGBuilder took 444.51 ms. Allocated memory is still 187.7 MB. Free memory was 163.4 MB in the beginning and 134.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:30,667 INFO L168 Benchmark]: TraceAbstraction took 9888.70 ms. Allocated memory was 187.7 MB in the beginning and 390.1 MB in the end (delta: 202.4 MB). Free memory was 134.1 MB in the beginning and 308.9 MB in the end (delta: -174.9 MB). Peak memory consumption was 160.7 MB. Max. memory is 8.0 GB. [2021-05-02 12:21:30,667 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 187.7 MB. Free memory is still 167.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 231.48 ms. Allocated memory is still 187.7 MB. Free memory was 151.1 MB in the beginning and 165.5 MB in the end (delta: -14.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.99 ms. Allocated memory is still 187.7 MB. Free memory was 165.5 MB in the beginning and 163.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 444.51 ms. Allocated memory is still 187.7 MB. Free memory was 163.4 MB in the beginning and 134.3 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9888.70 ms. Allocated memory was 187.7 MB in the beginning and 390.1 MB in the end (delta: 202.4 MB). Free memory was 134.1 MB in the beginning and 308.9 MB in the end (delta: -174.9 MB). Peak memory consumption was 160.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: 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, 94 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8609.4ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 18.3ms, AutomataDifference: 5629.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 1222.8ms, InitialAbstractionConstructionTime: 9.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1298 SDtfs, 4095 SDslu, 311 SDs, 0 SdLazy, 2895 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1960.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 168 SyntacticMatches, 5 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3588.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 126.0ms AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 16 NumberOfFragments, 778 HoareAnnotationTreeSize, 9 FomulaSimplifications, 985123 FormulaSimplificationTreeSizeReduction, 322.4ms HoareSimplificationTime, 9 FomulaSimplificationsInter, 276968 FormulaSimplificationTreeSizeReductionInter, 894.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 47.9ms SsaConstructionTime, 224.6ms SatisfiabilityAnalysisTime, 1657.9ms InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 2606 SizeOfPredicates, 21 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 7/21 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: 230]: Loop Invariant Derived loop invariant: ((((main__c == 0 && (((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c)) && \old(__return_375) == __return_375) && 1 <= __VERIFIER_assert__cond) || (((((((((((((((((main__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && __VERIFIER_assert__cond == 1) && ((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)))) && \old(__return_375) == __return_375 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || ((((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0))) && \old(__return_375) == __return_375 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((0 < main__scheme && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen) || ((((((((0 < main__scheme && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 <= main__urilen)) && \old(__return_375) == __return_375 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! Received shutdown request...