/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-1a84f73 [2021-05-01 07:08:03,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-01 07:08:03,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-01 07:08:03,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-01 07:08:03,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-01 07:08:03,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-01 07:08:03,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-01 07:08:03,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-01 07:08:03,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-01 07:08:03,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-01 07:08:03,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-01 07:08:03,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-01 07:08:03,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-01 07:08:03,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-01 07:08:03,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-01 07:08:03,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-01 07:08:03,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-01 07:08:03,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-01 07:08:03,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-01 07:08:03,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-01 07:08:03,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-01 07:08:03,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-01 07:08:03,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-01 07:08:03,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-01 07:08:03,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-01 07:08:03,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-01 07:08:03,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-01 07:08:03,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-01 07:08:03,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-01 07:08:03,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-01 07:08:03,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-01 07:08:03,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-01 07:08:03,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-01 07:08:03,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-01 07:08:03,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-01 07:08:03,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-01 07:08:03,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-01 07:08:03,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-01 07:08:03,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-01 07:08:03,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-01 07:08:03,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-01 07:08:03,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-01 07:08:03,460 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-01 07:08:03,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-01 07:08:03,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-01 07:08:03,462 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-01 07:08:03,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-01 07:08:03,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-01 07:08:03,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-01 07:08:03,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-01 07:08:03,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-01 07:08:03,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 07:08:03,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-01 07:08:03,464 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 [2021-05-01 07:08:03,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-01 07:08:03,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-01 07:08:03,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-01 07:08:03,752 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-01 07:08:03,753 INFO L275 PluginConnector]: CDTParser initialized [2021-05-01 07:08:03,754 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-01 07:08:03,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a0766c6/a8757f42dee2412db99eb68330330504/FLAG754961bb5 [2021-05-01 07:08:04,175 INFO L306 CDTParser]: Found 1 translation units. [2021-05-01 07:08:04,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-05-01 07:08:04,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a0766c6/a8757f42dee2412db99eb68330330504/FLAG754961bb5 [2021-05-01 07:08:04,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5a0766c6/a8757f42dee2412db99eb68330330504 [2021-05-01 07:08:04,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-01 07:08:04,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-01 07:08:04,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:04,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-01 07:08:04,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-01 07:08:04,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a520bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04, skipping insertion in model container [2021-05-01 07:08:04,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-01 07:08:04,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-01 07:08:04,741 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-01 07:08:04,744 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-01 07:08:04,745 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-01 07:08:04,747 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-01 07:08:04,752 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-01 07:08:04,755 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-01 07:08:04,760 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-01 07:08:04,768 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-01 07:08:04,775 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-01 07:08:04,777 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-01 07:08:04,778 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-01 07:08:04,779 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-01 07:08:04,781 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-01 07:08:04,782 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-01 07:08:04,783 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-01 07:08:04,797 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-01 07:08:04,799 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-01 07:08:04,800 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-01 07:08:04,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:04,808 INFO L203 MainTranslator]: Completed pre-run [2021-05-01 07:08:04,852 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-01 07:08:04,853 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-01 07:08:04,854 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-01 07:08:04,855 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-01 07:08:04,856 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-01 07:08:04,857 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-01 07:08:04,858 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-01 07:08:04,859 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-01 07:08:04,860 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-01 07:08:04,861 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-01 07:08:04,862 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-01 07:08:04,863 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-01 07:08:04,864 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-01 07:08:04,865 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-01 07:08:04,865 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-01 07:08:04,866 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-01 07:08:04,868 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-01 07:08:04,868 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-01 07:08:04,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:04,879 INFO L208 MainTranslator]: Completed translation [2021-05-01 07:08:04,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04 WrapperNode [2021-05-01 07:08:04,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:04,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-01 07:08:04,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-01 07:08:04,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-01 07:08:04,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (1/1) ... [2021-05-01 07:08:04,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-01 07:08:04,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-01 07:08:04,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-01 07:08:04,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-01 07:08:04,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (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-01 07:08:04,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-01 07:08:04,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-01 07:08:04,994 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-01 07:08:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-01 07:08:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-01 07:08:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-01 07:08:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-01 07:08:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-01 07:08:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-01 07:08:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-01 07:08:05,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-01 07:08:05,345 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-01 07:08:05,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:05 BoogieIcfgContainer [2021-05-01 07:08:05,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-01 07:08:05,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-01 07:08:05,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-01 07:08:05,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-01 07:08:05,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.05 07:08:04" (1/3) ... [2021-05-01 07:08:05,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7b4618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:05, skipping insertion in model container [2021-05-01 07:08:05,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:04" (2/3) ... [2021-05-01 07:08:05,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b7b4618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:05, skipping insertion in model container [2021-05-01 07:08:05,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:05" (3/3) ... [2021-05-01 07:08:05,351 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-05-01 07:08:05,355 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-01 07:08:05,359 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-05-01 07:08:05,372 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-05-01 07:08:05,386 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-01 07:08:05,386 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-01 07:08:05,386 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-01 07:08:05,386 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-01 07:08:05,386 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-01 07:08:05,386 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-01 07:08:05,387 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-01 07:08:05,387 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-01 07:08:05,400 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-01 07:08:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-01 07:08:05,405 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:05,406 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:05,406 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-01 07:08:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2021-05-01 07:08:05,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:05,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776133502] [2021-05-01 07:08:05,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:05,464 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:05,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,692 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-01 07:08:05,693 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:05,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776133502] [2021-05-01 07:08:05,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [776133502] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:05,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:05,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-01 07:08:05,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888466324] [2021-05-01 07:08:05,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-01 07:08:05,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-01 07:08:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-01 07:08:05,711 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-01 07:08:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:05,893 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2021-05-01 07:08:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:05,895 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-01 07:08:05,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:05,913 INFO L225 Difference]: With dead ends: 93 [2021-05-01 07:08:05,913 INFO L226 Difference]: Without dead ends: 80 [2021-05-01 07:08:05,915 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-05-01 07:08:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-05-01 07:08:05,949 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-01 07:08:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-05-01 07:08:05,951 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2021-05-01 07:08:05,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:05,951 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-05-01 07:08:05,952 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-01 07:08:05,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-05-01 07:08:05,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-01 07:08:05,952 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:05,952 INFO L519 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-01 07:08:05,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-01 07:08:05,953 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-01 07:08:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:05,953 INFO L82 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2021-05-01 07:08:05,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:05,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698028564] [2021-05-01 07:08:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:05,956 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,015 INFO L142 QuantifierPusher]: treesize reduction 6, result has 45.5 percent of original size [2021-05-01 07:08:06,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:06,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,113 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-01 07:08:06,113 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:06,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698028564] [2021-05-01 07:08:06,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1698028564] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:06,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:06,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:06,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221795317] [2021-05-01 07:08:06,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:06,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:06,115 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-01 07:08:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,352 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-05-01 07:08:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:06,353 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-01 07:08:06,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,356 INFO L225 Difference]: With dead ends: 80 [2021-05-01 07:08:06,356 INFO L226 Difference]: Without dead ends: 78 [2021-05-01 07:08:06,358 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-05-01 07:08:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-05-01 07:08:06,382 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-01 07:08:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-05-01 07:08:06,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2021-05-01 07:08:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,384 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-05-01 07:08:06,384 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-01 07:08:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-05-01 07:08:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-01 07:08:06,385 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:06,386 INFO L519 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-01 07:08:06,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-01 07:08:06,386 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-01 07:08:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2021-05-01 07:08:06,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:06,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507954580] [2021-05-01 07:08:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:06,389 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:06,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,458 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-01 07:08:06,459 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:06,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507954580] [2021-05-01 07:08:06,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1507954580] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:06,459 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:06,459 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:06,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053703928] [2021-05-01 07:08:06,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:06,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:06,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:06,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:06,460 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-01 07:08:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,668 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-05-01 07:08:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:06,668 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-01 07:08:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,672 INFO L225 Difference]: With dead ends: 101 [2021-05-01 07:08:06,672 INFO L226 Difference]: Without dead ends: 99 [2021-05-01 07:08:06,673 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 93.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 07:08:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-01 07:08:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2021-05-01 07:08:06,693 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-01 07:08:06,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-05-01 07:08:06,696 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2021-05-01 07:08:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,696 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-05-01 07:08:06,696 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-01 07:08:06,696 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-05-01 07:08:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-01 07:08:06,697 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:06,697 INFO L519 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-01 07:08:06,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-01 07:08:06,697 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-01 07:08:06,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2021-05-01 07:08:06,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:06,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [852227649] [2021-05-01 07:08:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:06,703 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,806 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-01 07:08:06,806 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:06,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [852227649] [2021-05-01 07:08:06,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [852227649] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:06,807 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:06,807 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:06,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720903242] [2021-05-01 07:08:06,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:06,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:06,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:06,812 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-01 07:08:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,970 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-01 07:08:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:06,970 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-01 07:08:06,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,971 INFO L225 Difference]: With dead ends: 76 [2021-05-01 07:08:06,971 INFO L226 Difference]: Without dead ends: 74 [2021-05-01 07:08:06,971 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 98.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-01 07:08:06,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-05-01 07:08:06,991 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-01 07:08:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-05-01 07:08:06,993 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2021-05-01 07:08:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,994 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-05-01 07:08:06,994 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-01 07:08:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-05-01 07:08:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-01 07:08:06,995 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:06,995 INFO L519 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-01 07:08:06,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-01 07:08:06,995 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-01 07:08:06,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:06,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2021-05-01 07:08:06,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:06,996 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1111418906] [2021-05-01 07:08:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:06,998 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:07,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,043 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:07,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:07,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:07,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:07,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:07,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,088 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-01 07:08:07,088 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:07,088 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1111418906] [2021-05-01 07:08:07,088 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1111418906] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:07,088 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:07,088 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:07,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109995105] [2021-05-01 07:08:07,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:07,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:07,089 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-01 07:08:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:07,485 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2021-05-01 07:08:07,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:07,485 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-01 07:08:07,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:07,486 INFO L225 Difference]: With dead ends: 141 [2021-05-01 07:08:07,486 INFO L226 Difference]: Without dead ends: 139 [2021-05-01 07:08:07,487 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 181.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:07,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-05-01 07:08:07,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2021-05-01 07:08:07,505 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-01 07:08:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-01 07:08:07,506 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2021-05-01 07:08:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:07,506 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-01 07:08:07,506 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-01 07:08:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-01 07:08:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-05-01 07:08:07,507 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:07,507 INFO L519 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-01 07:08:07,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-01 07:08:07,507 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-01 07:08:07,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2021-05-01 07:08:07,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:07,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363798192] [2021-05-01 07:08:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:07,509 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:07,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,545 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:07,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:07,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:07,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:07,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:07,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:07,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:07,591 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-01 07:08:07,591 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:07,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363798192] [2021-05-01 07:08:07,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [363798192] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:07,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:07,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:07,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712665929] [2021-05-01 07:08:07,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:07,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:07,593 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-01 07:08:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:07,969 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2021-05-01 07:08:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:07,970 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-01 07:08:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:07,970 INFO L225 Difference]: With dead ends: 108 [2021-05-01 07:08:07,971 INFO L226 Difference]: Without dead ends: 106 [2021-05-01 07:08:07,971 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 202.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-05-01 07:08:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2021-05-01 07:08:07,980 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-01 07:08:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-05-01 07:08:07,981 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2021-05-01 07:08:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:07,983 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-05-01 07:08:07,983 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-01 07:08:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-05-01 07:08:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-01 07:08:07,984 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:07,984 INFO L519 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-01 07:08:07,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-01 07:08:07,984 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-01 07:08:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2021-05-01 07:08:07,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:07,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [270029337] [2021-05-01 07:08:07,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:07,987 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,006 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:08,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:08,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:08,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:08,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,044 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-01 07:08:08,044 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:08,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [270029337] [2021-05-01 07:08:08,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [270029337] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:08,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:08,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:08,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109698868] [2021-05-01 07:08:08,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:08,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:08,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:08,048 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-01 07:08:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:08,287 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2021-05-01 07:08:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:08,288 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-01 07:08:08,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:08,289 INFO L225 Difference]: With dead ends: 121 [2021-05-01 07:08:08,289 INFO L226 Difference]: Without dead ends: 119 [2021-05-01 07:08:08,289 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 130.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-05-01 07:08:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2021-05-01 07:08:08,298 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-01 07:08:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2021-05-01 07:08:08,299 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2021-05-01 07:08:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:08,299 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2021-05-01 07:08:08,299 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-01 07:08:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2021-05-01 07:08:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-05-01 07:08:08,300 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:08,300 INFO L519 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-01 07:08:08,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-01 07:08:08,300 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-01 07:08:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2021-05-01 07:08:08,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:08,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160375940] [2021-05-01 07:08:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:08,302 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,315 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:08,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:08,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:08,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:08,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,363 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-01 07:08:08,363 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:08,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160375940] [2021-05-01 07:08:08,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1160375940] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:08,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:08,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:08,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18989174] [2021-05-01 07:08:08,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:08,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:08,365 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-01 07:08:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:08,579 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2021-05-01 07:08:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:08,580 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-01 07:08:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:08,581 INFO L225 Difference]: With dead ends: 77 [2021-05-01 07:08:08,581 INFO L226 Difference]: Without dead ends: 75 [2021-05-01 07:08:08,581 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 152.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-01 07:08:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-01 07:08:08,590 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-01 07:08:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-05-01 07:08:08,591 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2021-05-01 07:08:08,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:08,591 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-05-01 07:08:08,591 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-01 07:08:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-05-01 07:08:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-05-01 07:08:08,596 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:08,596 INFO L519 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-01 07:08:08,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-01 07:08:08,596 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-01 07:08:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2021-05-01 07:08:08,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:08,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597815868] [2021-05-01 07:08:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:08,599 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-05-01 07:08:08,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,641 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-01 07:08:08,641 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:08,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597815868] [2021-05-01 07:08:08,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [597815868] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:08,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:08,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-01 07:08:08,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603422856] [2021-05-01 07:08:08,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-01 07:08:08,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-01 07:08:08,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-01 07:08:08,642 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-01 07:08:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:08,748 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-05-01 07:08:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-01 07:08:08,748 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-01 07:08:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:08,749 INFO L225 Difference]: With dead ends: 115 [2021-05-01 07:08:08,749 INFO L226 Difference]: Without dead ends: 75 [2021-05-01 07:08:08,750 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:08,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-01 07:08:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-05-01 07:08:08,758 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-01 07:08:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2021-05-01 07:08:08,759 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2021-05-01 07:08:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:08,760 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2021-05-01 07:08:08,760 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-01 07:08:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2021-05-01 07:08:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-01 07:08:08,761 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:08,761 INFO L519 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-01 07:08:08,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-01 07:08:08,761 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-01 07:08:08,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2021-05-01 07:08:08,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:08,762 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2001780446] [2021-05-01 07:08:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:08,763 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,795 INFO L142 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-05-01 07:08:08,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:08,802 INFO L142 QuantifierPusher]: treesize reduction 14, result has 41.7 percent of original size [2021-05-01 07:08:08,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-05-01 07:08:08,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:08,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:08,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:08,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:08,836 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-01 07:08:08,836 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:08,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2001780446] [2021-05-01 07:08:08,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2001780446] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:08,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:08,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:08,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318224568] [2021-05-01 07:08:08,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:08,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:08,838 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-01 07:08:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:09,049 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-05-01 07:08:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:09,049 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-01 07:08:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:09,052 INFO L225 Difference]: With dead ends: 76 [2021-05-01 07:08:09,052 INFO L226 Difference]: Without dead ends: 74 [2021-05-01 07:08:09,053 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 134.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-01 07:08:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2021-05-01 07:08:09,064 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-01 07:08:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2021-05-01 07:08:09,067 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2021-05-01 07:08:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2021-05-01 07:08:09,068 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-01 07:08:09,069 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2021-05-01 07:08:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-05-01 07:08:09,071 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:09,071 INFO L519 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-01 07:08:09,072 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-01 07:08:09,072 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-01 07:08:09,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2021-05-01 07:08:09,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:09,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1811471573] [2021-05-01 07:08:09,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:09,086 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-01 07:08:09,087 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,104 INFO L142 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-05-01 07:08:09,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:09,110 INFO L142 QuantifierPusher]: treesize reduction 16, result has 23.8 percent of original size [2021-05-01 07:08:09,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:09,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,144 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-01 07:08:09,144 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:09,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1811471573] [2021-05-01 07:08:09,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1811471573] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:09,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:09,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:09,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623971975] [2021-05-01 07:08:09,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:09,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:09,147 INFO L87 Difference]: Start difference. First operand 73 states and 76 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-01 07:08:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:09,353 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-05-01 07:08:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:09,354 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-01 07:08:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:09,354 INFO L225 Difference]: With dead ends: 111 [2021-05-01 07:08:09,354 INFO L226 Difference]: Without dead ends: 109 [2021-05-01 07:08:09,355 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-05-01 07:08:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2021-05-01 07:08:09,364 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-01 07:08:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-05-01 07:08:09,365 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2021-05-01 07:08:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:09,365 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-05-01 07:08:09,365 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-01 07:08:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-05-01 07:08:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-01 07:08:09,365 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:09,365 INFO L519 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-01 07:08:09,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-01 07:08:09,366 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-01 07:08:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2021-05-01 07:08:09,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:09,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070823332] [2021-05-01 07:08:09,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:09,367 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:09,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:09,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:09,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,410 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-01 07:08:09,411 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:09,411 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070823332] [2021-05-01 07:08:09,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1070823332] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:09,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:09,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:09,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317246757] [2021-05-01 07:08:09,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:09,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:09,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:09,412 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-01 07:08:09,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:09,540 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-01 07:08:09,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:09,540 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-01 07:08:09,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:09,541 INFO L225 Difference]: With dead ends: 70 [2021-05-01 07:08:09,541 INFO L226 Difference]: Without dead ends: 68 [2021-05-01 07:08:09,541 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-01 07:08:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-01 07:08:09,567 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-01 07:08:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-05-01 07:08:09,567 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2021-05-01 07:08:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:09,567 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-05-01 07:08:09,567 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-01 07:08:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-05-01 07:08:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-05-01 07:08:09,568 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:09,568 INFO L519 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-01 07:08:09,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-01 07:08:09,568 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-01 07:08:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2021-05-01 07:08:09,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:09,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742902429] [2021-05-01 07:08:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:09,571 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-01 07:08:09,572 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,588 INFO L142 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-05-01 07:08:09,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:09,595 INFO L142 QuantifierPusher]: treesize reduction 16, result has 23.8 percent of original size [2021-05-01 07:08:09,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:09,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,625 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-01 07:08:09,625 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:09,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742902429] [2021-05-01 07:08:09,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1742902429] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:09,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:09,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:09,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114895813] [2021-05-01 07:08:09,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:09,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:09,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:09,626 INFO L87 Difference]: Start difference. First operand 68 states and 71 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-01 07:08:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:09,772 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-05-01 07:08:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:09,773 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-01 07:08:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:09,773 INFO L225 Difference]: With dead ends: 69 [2021-05-01 07:08:09,774 INFO L226 Difference]: Without dead ends: 67 [2021-05-01 07:08:09,774 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 99.1ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-01 07:08:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2021-05-01 07:08:09,784 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-01 07:08:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2021-05-01 07:08:09,785 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2021-05-01 07:08:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:09,785 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2021-05-01 07:08:09,785 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-01 07:08:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2021-05-01 07:08:09,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-05-01 07:08:09,785 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:09,785 INFO L519 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-01 07:08:09,785 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-01 07:08:09,786 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-01 07:08:09,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:09,786 INFO L82 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2021-05-01 07:08:09,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:09,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438495965] [2021-05-01 07:08:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:09,788 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,815 INFO L142 QuantifierPusher]: treesize reduction 7, result has 30.0 percent of original size [2021-05-01 07:08:09,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:09,818 INFO L142 QuantifierPusher]: treesize reduction 16, result has 23.8 percent of original size [2021-05-01 07:08:09,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:09,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:09,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:09,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:09,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:09,849 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-01 07:08:09,850 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:09,850 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438495965] [2021-05-01 07:08:09,850 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [438495965] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:09,850 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:09,850 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:09,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131008905] [2021-05-01 07:08:09,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:09,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:09,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:09,851 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-01 07:08:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:09,996 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-05-01 07:08:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:09,997 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-01 07:08:09,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:09,997 INFO L225 Difference]: With dead ends: 63 [2021-05-01 07:08:09,997 INFO L226 Difference]: Without dead ends: 61 [2021-05-01 07:08:09,998 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 102.1ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:09,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-01 07:08:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2021-05-01 07:08:10,006 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-01 07:08:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-05-01 07:08:10,006 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2021-05-01 07:08:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:10,007 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-05-01 07:08:10,007 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-01 07:08:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-05-01 07:08:10,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-01 07:08:10,007 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:10,007 INFO L519 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-01 07:08:10,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-01 07:08:10,007 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-01 07:08:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:10,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2021-05-01 07:08:10,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:10,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681503465] [2021-05-01 07:08:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:10,009 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:10,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:10,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:10,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:10,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:10,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,059 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-01 07:08:10,059 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:10,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681503465] [2021-05-01 07:08:10,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1681503465] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:10,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:10,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:10,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316929808] [2021-05-01 07:08:10,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:10,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:10,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:10,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:10,060 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-01 07:08:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:10,234 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2021-05-01 07:08:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:10,234 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-01 07:08:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:10,234 INFO L225 Difference]: With dead ends: 71 [2021-05-01 07:08:10,235 INFO L226 Difference]: Without dead ends: 69 [2021-05-01 07:08:10,235 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 102.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-01 07:08:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2021-05-01 07:08:10,243 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-01 07:08:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-05-01 07:08:10,243 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2021-05-01 07:08:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-05-01 07:08:10,244 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-01 07:08:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-05-01 07:08:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-05-01 07:08:10,244 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:10,244 INFO L519 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-01 07:08:10,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-01 07:08:10,244 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-01 07:08:10,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:10,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2021-05-01 07:08:10,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:10,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1867163575] [2021-05-01 07:08:10,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:10,246 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,260 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:10,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:10,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:10,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:10,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,298 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-01 07:08:10,298 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:10,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1867163575] [2021-05-01 07:08:10,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1867163575] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:10,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:10,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:10,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507106382] [2021-05-01 07:08:10,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:10,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:10,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:10,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:10,299 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-01 07:08:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:10,561 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-05-01 07:08:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:10,562 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-01 07:08:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:10,562 INFO L225 Difference]: With dead ends: 91 [2021-05-01 07:08:10,562 INFO L226 Difference]: Without dead ends: 89 [2021-05-01 07:08:10,562 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 170.3ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-01 07:08:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2021-05-01 07:08:10,572 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-01 07:08:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2021-05-01 07:08:10,572 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2021-05-01 07:08:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:10,572 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2021-05-01 07:08:10,572 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-01 07:08:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2021-05-01 07:08:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-05-01 07:08:10,573 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:10,573 INFO L519 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-01 07:08:10,573 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-01 07:08:10,573 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-01 07:08:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:10,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2021-05-01 07:08:10,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:10,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [206318813] [2021-05-01 07:08:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:10,575 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,586 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:10,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:10,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:10,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:10,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,621 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-01 07:08:10,621 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:10,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [206318813] [2021-05-01 07:08:10,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [206318813] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:10,621 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:10,621 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:10,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198971522] [2021-05-01 07:08:10,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:10,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:10,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:10,622 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-01 07:08:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:10,801 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2021-05-01 07:08:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:10,801 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-01 07:08:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:10,802 INFO L225 Difference]: With dead ends: 61 [2021-05-01 07:08:10,802 INFO L226 Difference]: Without dead ends: 59 [2021-05-01 07:08:10,802 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 127.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-01 07:08:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-05-01 07:08:10,811 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-01 07:08:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2021-05-01 07:08:10,811 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2021-05-01 07:08:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:10,811 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2021-05-01 07:08:10,811 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-01 07:08:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2021-05-01 07:08:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-05-01 07:08:10,812 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:10,812 INFO L519 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-01 07:08:10,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-01 07:08:10,812 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-01 07:08:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2021-05-01 07:08:10,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:10,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749237811] [2021-05-01 07:08:10,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:10,814 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:10,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:10,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:10,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:10,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:10,860 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-01 07:08:10,861 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:10,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749237811] [2021-05-01 07:08:10,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1749237811] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:10,861 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:10,861 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:10,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185600207] [2021-05-01 07:08:10,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:10,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:10,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:10,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:10,862 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-01 07:08:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:10,998 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2021-05-01 07:08:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:10,998 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-01 07:08:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:10,999 INFO L225 Difference]: With dead ends: 70 [2021-05-01 07:08:10,999 INFO L226 Difference]: Without dead ends: 68 [2021-05-01 07:08:10,999 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 07:08:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-01 07:08:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2021-05-01 07:08:11,008 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-01 07:08:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-05-01 07:08:11,008 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2021-05-01 07:08:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-05-01 07:08:11,008 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-01 07:08:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-05-01 07:08:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-05-01 07:08:11,009 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:11,009 INFO L519 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-01 07:08:11,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-01 07:08:11,009 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-01 07:08:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2021-05-01 07:08:11,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:11,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [743376537] [2021-05-01 07:08:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:11,011 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:11,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:11,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:11,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,053 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-01 07:08:11,053 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:11,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [743376537] [2021-05-01 07:08:11,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [743376537] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:11,053 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:11,054 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:11,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019255444] [2021-05-01 07:08:11,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:11,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:11,054 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-01 07:08:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:11,205 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-05-01 07:08:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:11,206 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-01 07:08:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:11,206 INFO L225 Difference]: With dead ends: 66 [2021-05-01 07:08:11,206 INFO L226 Difference]: Without dead ends: 64 [2021-05-01 07:08:11,207 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-01 07:08:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2021-05-01 07:08:11,216 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-01 07:08:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-05-01 07:08:11,216 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2021-05-01 07:08:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:11,216 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-05-01 07:08:11,216 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-01 07:08:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-05-01 07:08:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-05-01 07:08:11,217 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:11,217 INFO L519 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-01 07:08:11,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-01 07:08:11,217 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-01 07:08:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2021-05-01 07:08:11,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:11,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [444314762] [2021-05-01 07:08:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:11,219 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,233 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:11,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:11,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:11,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:11,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,268 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-01 07:08:11,269 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:11,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [444314762] [2021-05-01 07:08:11,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [444314762] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:11,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:11,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:11,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065974989] [2021-05-01 07:08:11,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:11,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:11,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:11,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:11,270 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-01 07:08:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:11,583 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2021-05-01 07:08:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-01 07:08:11,584 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-01 07:08:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:11,584 INFO L225 Difference]: With dead ends: 88 [2021-05-01 07:08:11,584 INFO L226 Difference]: Without dead ends: 86 [2021-05-01 07:08:11,585 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 174.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-01 07:08:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-05-01 07:08:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2021-05-01 07:08:11,597 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-01 07:08:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2021-05-01 07:08:11,598 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2021-05-01 07:08:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:11,598 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2021-05-01 07:08:11,598 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-01 07:08:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2021-05-01 07:08:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-01 07:08:11,598 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:11,599 INFO L519 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-01 07:08:11,599 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-01 07:08:11,599 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-01 07:08:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2021-05-01 07:08:11,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:11,599 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469582994] [2021-05-01 07:08:11,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:11,604 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-01 07:08:11,605 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,624 INFO L142 QuantifierPusher]: treesize reduction 19, result has 13.6 percent of original size [2021-05-01 07:08:11,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:11,627 INFO L142 QuantifierPusher]: treesize reduction 17, result has 22.7 percent of original size [2021-05-01 07:08:11,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:11,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:11,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:11,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:11,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,661 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-01 07:08:11,661 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:11,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469582994] [2021-05-01 07:08:11,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1469582994] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:11,661 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:11,661 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:11,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846109830] [2021-05-01 07:08:11,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:11,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:11,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:11,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:11,662 INFO L87 Difference]: Start difference. First operand 60 states and 63 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-01 07:08:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:11,837 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2021-05-01 07:08:11,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:11,837 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-01 07:08:11,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:11,837 INFO L225 Difference]: With dead ends: 60 [2021-05-01 07:08:11,838 INFO L226 Difference]: Without dead ends: 58 [2021-05-01 07:08:11,838 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 113.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-01 07:08:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-05-01 07:08:11,848 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-01 07:08:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-05-01 07:08:11,848 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2021-05-01 07:08:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:11,849 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-05-01 07:08:11,849 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-01 07:08:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-05-01 07:08:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-01 07:08:11,849 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:11,849 INFO L519 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-01 07:08:11,849 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-01 07:08:11,850 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-01 07:08:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2021-05-01 07:08:11,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:11,851 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [71107392] [2021-05-01 07:08:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:11,852 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,889 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:11,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:11,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:11,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:11,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:11,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:11,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:11,927 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-01 07:08:11,927 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:11,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [71107392] [2021-05-01 07:08:11,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [71107392] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:11,927 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:11,927 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:11,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041631300] [2021-05-01 07:08:11,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:11,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:11,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:11,928 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-01 07:08:12,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:12,141 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-05-01 07:08:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:12,142 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-01 07:08:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:12,142 INFO L225 Difference]: With dead ends: 69 [2021-05-01 07:08:12,142 INFO L226 Difference]: Without dead ends: 67 [2021-05-01 07:08:12,143 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 135.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-01 07:08:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-05-01 07:08:12,153 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-01 07:08:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-05-01 07:08:12,153 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-05-01 07:08:12,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:12,153 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-05-01 07:08:12,153 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-01 07:08:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-05-01 07:08:12,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-05-01 07:08:12,154 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:12,154 INFO L519 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-01 07:08:12,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-05-01 07:08:12,154 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-01 07:08:12,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:12,154 INFO L82 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2021-05-01 07:08:12,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:12,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [207955709] [2021-05-01 07:08:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:12,158 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-01 07:08:12,159 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:12,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:12,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:12,174 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:12,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:12,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:12,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:12,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:12,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:12,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:12,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:12,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:12,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:12,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:12,293 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-01 07:08:12,293 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:12,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [207955709] [2021-05-01 07:08:12,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [207955709] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:12,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:12,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:12,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754513831] [2021-05-01 07:08:12,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:12,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:12,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:12,294 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-01 07:08:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:12,657 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-05-01 07:08:12,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 07:08:12,658 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-01 07:08:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:12,658 INFO L225 Difference]: With dead ends: 75 [2021-05-01 07:08:12,658 INFO L226 Difference]: Without dead ends: 0 [2021-05-01 07:08:12,659 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 292.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-05-01 07:08:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-01 07:08:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-01 07:08:12,659 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-01 07:08:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-01 07:08:12,659 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2021-05-01 07:08:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:12,659 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-01 07:08:12,659 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-01 07:08:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-01 07:08:12,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-01 07:08:12,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-05-01 07:08:12,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-01 07:08:13,406 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 151 [2021-05-01 07:08:13,850 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 141 [2021-05-01 07:08:14,398 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2021-05-01 07:08:14,548 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-05-01 07:08:15,060 WARN L205 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2021-05-01 07:08:15,164 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-01 07:08:15,638 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2021-05-01 07:08:15,877 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-01 07:08:15,996 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2021-05-01 07:08:16,254 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-05-01 07:08:16,504 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2021-05-01 07:08:16,748 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-01 07:08:17,110 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-01 07:08:17,297 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 37 [2021-05-01 07:08:17,650 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 72 [2021-05-01 07:08:18,006 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2021-05-01 07:08:18,358 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 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-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:18,361 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2021-05-01 07:08:18,361 INFO L194 CegarLoopUtils]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L374(line 374) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L85(line 85) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L308(line 308) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L143(lines 143 362) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (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-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse3 (< main_~main__cp~0 main_~main__urilen~0)) (.cse4 (< 0 main_~main__scheme~0)) (.cse5 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~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)))) (let ((.cse0 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse18 (not (= main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse2 .cse3 .cse4 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 .cse18 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15)))) (.cse1 (= main_~main__c~0 0))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0) (and .cse1 .cse0) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14 .cse15)))) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L135(lines 135 397) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (= main_~__VERIFIER_assert__cond~3 1)) (.cse5 (= |old(~__return_375~0)| ~__return_375~0)) (.cse6 (<= 1 main_~main__cp~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6 .cse7))) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L226(line 226) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L284(line 284) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L243(line 243) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point L111(lines 111 405) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~2 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-01 07:08:18,362 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) .cse4 .cse5 .cse6))) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L194(lines 194 354) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 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))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L384(lines 384 393) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L95(lines 95 412) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L145(line 145) the Hoare annotation is: false [2021-05-01 07:08:18,363 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-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L104(lines 104 411) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L71(lines 71 416) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,363 INFO L194 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (= main_~__VERIFIER_assert__cond~9 1) (= |old(~__return_375~0)| ~__return_375~0) (let ((.cse0 (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< main_~main__cp~0 main_~main__urilen~0)) (.cse3 (< 0 main_~main__scheme~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse9 (= main_~__VERIFIER_assert__cond~3 1)) (.cse10 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0))) (.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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14 .cse15) (and .cse1 .cse2 .cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))))) (or (and .cse0 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse0 (= main_~main__c~0 0))))) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L294(lines 294 318) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L162(lines 162 359) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< 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))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse15 .cse16)))) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L187(lines 187 355) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 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))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,364 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-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L212(lines 212 346) the Hoare annotation is: (and (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~main__c~0 0) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~8 1) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L113(line 113) the Hoare annotation is: false [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L270(lines 270 322) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,364 INFO L194 CegarLoopUtils]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse6 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse8 (= main_~__VERIFIER_assert__cond~3 1)) (.cse9 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse10 (= |old(~__return_375~0)| ~__return_375~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 .cse14 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse15 .cse16)))) [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L386(line 386) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L97(line 97) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L155(lines 155 360) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< 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))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L296(line 296) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L255(line 255) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L189(line 189) the Hoare annotation is: false [2021-05-01 07:08:18,365 INFO L194 CegarLoopUtils]: At program point L123(lines 123 403) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= main_~__VERIFIER_assert__cond~2 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L214(line 214) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L272(line 272) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L157(line 157) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L372(lines 372 395) the Hoare annotation is: (let ((.cse0 (< main_~main__cp~0 main_~main__urilen~0)) (.cse1 (< 0 main_~main__scheme~0)) (.cse2 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (= main_~__VERIFIER_assert__cond~3 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (<= 1 main_~main__cp~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~2 0)) .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6 .cse7 .cse8))) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L83(lines 83 414) the Hoare annotation is: (and (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__cp~0) (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L306(lines 306 316) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~15 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L224(lines 224 344) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~3 1) (= main_~main__c~0 0) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~8 1) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L125(line 125) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2021-05-01 07:08:18,366 INFO L194 CegarLoopUtils]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse10 (= main_~__VERIFIER_assert__cond~9 1)) (.cse6 (= main_~main__c~0 0)) (.cse0 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse1 (< main_~main__cp~0 main_~main__urilen~0)) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0))) (or (and (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14) (and .cse10 (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse18 (not (= main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse0 .cse1 .cse2 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse3 .cse4 .cse16 .cse17 .cse5 .cse7 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse7 .cse9 .cse18 .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse14))))) (or (and .cse15 (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0)) (and .cse15 .cse6))) .cse8))) [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point L282(lines 282 320) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~10 1) (< 0 main_~main__scheme~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~1 0))) [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse19 (= main_~__VERIFIER_assert__cond~10 0))) (let ((.cse1 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse2 (< 0 main_~main__scheme~0)) (.cse3 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0)) (.cse4 (not (= main_~main__urilen~0 (+ main_~main__cp~0 1)))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse9 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= main_~main__c~0 0)) (.cse16 (or (and (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0)) (and (<= main_~main__urilen~0 main_~main__cp~0) .cse19))) (.cse10 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse17 (= |old(~__return_375~0)| ~__return_375~0)) (.cse18 (not .cse19)) (.cse0 (= 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 .cse0 (let ((.cse7 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (not (= main_~__VERIFIER_assert__cond~8 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (<= 1 main_~main__c~0) .cse11 .cse12 .cse13 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse14 .cse15))) .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse8 .cse16 .cse10 .cse17 .cse18 .cse0 .cse12 .cse13 (= main_~__VERIFIER_assert__cond~8 1) .cse14 .cse15)))) [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point L175(lines 175 357) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))) (not (= main_~__VERIFIER_assert__cond~6 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))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2021-05-01 07:08:18,367 INFO L194 CegarLoopUtils]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2021-05-01 07:08:18,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 07:08:18 BoogieIcfgContainer [2021-05-01 07:08:18,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-01 07:08:18,386 INFO L168 Benchmark]: Toolchain (without parser) took 13796.05 ms. Allocated memory was 213.9 MB in the beginning and 512.8 MB in the end (delta: 298.8 MB). Free memory was 179.5 MB in the beginning and 396.4 MB in the end (delta: -216.9 MB). Peak memory consumption was 296.8 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 213.9 MB. Free memory was 195.9 MB in the beginning and 195.9 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.54 ms. Allocated memory is still 213.9 MB. Free memory was 179.3 MB in the beginning and 192.0 MB in the end (delta: -12.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 INFO L168 Benchmark]: Boogie Preprocessor took 23.44 ms. Allocated memory is still 213.9 MB. Free memory was 192.0 MB in the beginning and 190.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 INFO L168 Benchmark]: RCFGBuilder took 441.59 ms. Allocated memory is still 213.9 MB. Free memory was 190.4 MB in the beginning and 161.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 INFO L168 Benchmark]: TraceAbstraction took 13039.03 ms. Allocated memory was 213.9 MB in the beginning and 512.8 MB in the end (delta: 298.8 MB). Free memory was 160.5 MB in the beginning and 396.4 MB in the end (delta: -235.9 MB). Peak memory consumption was 278.4 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:18,387 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.10 ms. Allocated memory is still 213.9 MB. Free memory was 195.9 MB in the beginning and 195.9 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 285.54 ms. Allocated memory is still 213.9 MB. Free memory was 179.3 MB in the beginning and 192.0 MB in the end (delta: -12.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.44 ms. Allocated memory is still 213.9 MB. Free memory was 192.0 MB in the beginning and 190.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 441.59 ms. Allocated memory is still 213.9 MB. Free memory was 190.4 MB in the beginning and 161.0 MB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13039.03 ms. Allocated memory was 213.9 MB in the beginning and 512.8 MB in the end (delta: 298.8 MB). Free memory was 160.5 MB in the beginning and 396.4 MB in the end (delta: -235.9 MB). Peak memory consumption was 278.4 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: 7275.8ms, OverallIterations: 23, TraceHistogramMax: 2, EmptinessCheckTime: 24.6ms, AutomataDifference: 5009.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5700.3ms, InitialAbstractionConstructionTime: 10.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1302 SDtfs, 3732 SDslu, 283 SDs, 0 SdLazy, 2563 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1676.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 78 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2943.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 301.2ms AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 139 NumberOfFragments, 2932 HoareAnnotationTreeSize, 87 FomulaSimplifications, 1809936 FormulaSimplificationTreeSizeReduction, 1386.1ms HoareSimplificationTime, 87 FomulaSimplificationsInter, 208876 FormulaSimplificationTreeSizeReductionInter, 4291.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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__cp + 1 < main__urilen && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__c == 0) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((__VERIFIER_assert__cond == 1 && (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__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) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__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: 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 == 1) && \old(__return_375) == __return_375) && (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) || (((((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && main__cp < main__urilen) && 0 < main__scheme) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(main__urilen == main__cp + 1)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((main__cp < main__urilen && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! Received shutdown request...