/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/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-1a84f73 [2021-05-01 07:07:59,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-01 07:07:59,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-01 07:07:59,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-01 07:07:59,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-01 07:07:59,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-01 07:07:59,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-01 07:07:59,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-01 07:07:59,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-01 07:07:59,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-01 07:07:59,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-01 07:07:59,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-01 07:07:59,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-01 07:07:59,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-01 07:07:59,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-01 07:07:59,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-01 07:07:59,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-01 07:07:59,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-01 07:07:59,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-01 07:07:59,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-01 07:07:59,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-01 07:07:59,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-01 07:07:59,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-01 07:07:59,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-01 07:07:59,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-01 07:07:59,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-01 07:07:59,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-01 07:07:59,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-01 07:07:59,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-01 07:07:59,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-01 07:07:59,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-01 07:07:59,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-01 07:07:59,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-01 07:07:59,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-01 07:07:59,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-01 07:07:59,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-01 07:07:59,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-01 07:07:59,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-01 07:07:59,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-01 07:07:59,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-01 07:07:59,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-01 07:07:59,924 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:07:59,939 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-01 07:07:59,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-01 07:07:59,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-01 07:07:59,942 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-01 07:07:59,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-01 07:07:59,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-01 07:07:59,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-01 07:07:59,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-01 07:07:59,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-01 07:07:59,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-01 07:07:59,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-01 07:07:59,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-01 07:07:59,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-01 07:07:59,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-01 07:07:59,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-01 07:07:59,945 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-01 07:07:59,945 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:00,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-01 07:08:00,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-01 07:08:00,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-01 07:08:00,230 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-01 07:08:00,237 INFO L275 PluginConnector]: CDTParser initialized [2021-05-01 07:08:00,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-01 07:08:00,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fc570e4/3929c7d8b3dd4fa980efd680bb70e34a/FLAGfe4ede3f2 [2021-05-01 07:08:00,667 INFO L306 CDTParser]: Found 1 translation units. [2021-05-01 07:08:00,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-01 07:08:00,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fc570e4/3929c7d8b3dd4fa980efd680bb70e34a/FLAGfe4ede3f2 [2021-05-01 07:08:01,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8fc570e4/3929c7d8b3dd4fa980efd680bb70e34a [2021-05-01 07:08:01,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-01 07:08:01,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-01 07:08:01,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:01,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-01 07:08:01,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-01 07:08:01,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:01" (1/1) ... [2021-05-01 07:08:01,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a70fa5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:01, skipping insertion in model container [2021-05-01 07:08:01,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.05 07:08:01" (1/1) ... [2021-05-01 07:08:01,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-01 07:08:01,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-01 07:08:01,214 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-01 07:08:01,216 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-01 07:08:01,218 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-01 07:08:01,219 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-01 07:08:01,220 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-01 07:08:01,221 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-01 07:08:01,223 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-01 07:08:01,226 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-01 07:08:01,227 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-01 07:08:01,228 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-01 07:08:01,229 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-01 07:08:01,230 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-01 07:08:01,231 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-01 07:08:01,234 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-01 07:08:01,235 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-01 07:08:01,236 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-01 07:08:01,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:01,244 INFO L203 MainTranslator]: Completed pre-run [2021-05-01 07:08:01,294 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-01 07:08:01,299 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-01 07:08:01,302 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-01 07:08:01,309 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-05-01 07:08:01,314 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-05-01 07:08:01,315 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-05-01 07:08:01,316 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-05-01 07:08:01,317 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-05-01 07:08:01,317 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-05-01 07:08:01,318 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-05-01 07:08:01,319 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-05-01 07:08:01,320 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-05-01 07:08:01,330 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-05-01 07:08:01,331 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-05-01 07:08:01,332 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-05-01 07:08:01,333 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-05-01 07:08:01,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-01 07:08:01,344 INFO L208 MainTranslator]: Completed translation [2021-05-01 07:08:01,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:01 WrapperNode [2021-05-01 07:08:01,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-01 07:08:01,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-01 07:08:01,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-01 07:08:01,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-01 07:08:01,352 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:01" (1/1) ... [2021-05-01 07:08:01,353 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:01" (1/1) ... [2021-05-01 07:08:01,358 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:01" (1/1) ... [2021-05-01 07:08:01,358 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:01" (1/1) ... [2021-05-01 07:08:01,363 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:01" (1/1) ... [2021-05-01 07:08:01,365 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:01" (1/1) ... [2021-05-01 07:08:01,366 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:01" (1/1) ... [2021-05-01 07:08:01,368 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-01 07:08:01,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-01 07:08:01,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-01 07:08:01,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-01 07:08:01,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:01" (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:01,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-01 07:08:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-01 07:08:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-01 07:08:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-01 07:08:01,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-01 07:08:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-01 07:08:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-01 07:08:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-01 07:08:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-01 07:08:01,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-01 07:08:01,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-01 07:08:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-01 07:08:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-01 07:08:01,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-01 07:08:01,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-01 07:08:01,860 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-01 07:08:01,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:01 BoogieIcfgContainer [2021-05-01 07:08:01,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-01 07:08:01,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-01 07:08:01,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-01 07:08:01,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-01 07:08:01,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.05 07:08:01" (1/3) ... [2021-05-01 07:08:01,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716f38aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:01, skipping insertion in model container [2021-05-01 07:08:01,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.05 07:08:01" (2/3) ... [2021-05-01 07:08:01,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716f38aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.05 07:08:01, skipping insertion in model container [2021-05-01 07:08:01,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.05 07:08:01" (3/3) ... [2021-05-01 07:08:01,868 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-01 07:08:01,872 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-01 07:08:01,875 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-01 07:08:01,886 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-01 07:08:01,906 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-01 07:08:01,906 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-01 07:08:01,906 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-01 07:08:01,906 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-01 07:08:01,907 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-01 07:08:01,907 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-01 07:08:01,907 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-01 07:08:01,907 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-01 07:08:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-01 07:08:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-01 07:08:01,930 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:01,930 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:01,931 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:01,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash -189701311, now seen corresponding path program 1 times [2021-05-01 07:08:01,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:01,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831807345] [2021-05-01 07:08:01,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:01,987 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:02,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,200 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:02,201 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:02,201 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831807345] [2021-05-01 07:08:02,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [831807345] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:02,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:02,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-01 07:08:02,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570599559] [2021-05-01 07:08:02,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-01 07:08:02,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-01 07:08:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-01 07:08:02,216 INFO L87 Difference]: Start difference. First operand has 65 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 60 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:02,445 INFO L93 Difference]: Finished difference Result 90 states and 118 transitions. [2021-05-01 07:08:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-01 07:08:02,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:02,458 INFO L225 Difference]: With dead ends: 90 [2021-05-01 07:08:02,458 INFO L226 Difference]: Without dead ends: 76 [2021-05-01 07:08:02,460 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-01 07:08:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-01 07:08:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-01 07:08:02,497 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-01 07:08:02,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:02,498 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-01 07:08:02,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-01 07:08:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-01 07:08:02,498 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:02,498 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:02,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-01 07:08:02,499 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1582601500, now seen corresponding path program 1 times [2021-05-01 07:08:02,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:02,500 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558188621] [2021-05-01 07:08:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:02,510 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:02,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:02,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,587 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:02,587 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:02,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558188621] [2021-05-01 07:08:02,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1558188621] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:02,588 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:02,588 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:02,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239975731] [2021-05-01 07:08:02,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:02,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:02,589 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:02,843 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2021-05-01 07:08:02,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:02,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-01 07:08:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:02,844 INFO L225 Difference]: With dead ends: 153 [2021-05-01 07:08:02,845 INFO L226 Difference]: Without dead ends: 101 [2021-05-01 07:08:02,846 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 07:08:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-05-01 07:08:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2021-05-01 07:08:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-05-01 07:08:02,858 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 14 [2021-05-01 07:08:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:02,858 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-05-01 07:08:02,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-05-01 07:08:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-01 07:08:02,859 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:02,859 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:02,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-01 07:08:02,859 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:02,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1585770269, now seen corresponding path program 1 times [2021-05-01 07:08:02,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:02,860 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [302602364] [2021-05-01 07:08:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:02,861 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,885 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-05-01 07:08:02,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:02,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:02,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:02,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:02,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:02,930 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:02,930 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:02,931 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [302602364] [2021-05-01 07:08:02,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [302602364] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:02,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:02,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:02,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266463129] [2021-05-01 07:08:02,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:02,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:02,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:02,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:02,932 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:03,065 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-01 07:08:03,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:03,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-01 07:08:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:03,066 INFO L225 Difference]: With dead ends: 75 [2021-05-01 07:08:03,066 INFO L226 Difference]: Without dead ends: 73 [2021-05-01 07:08:03,067 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 87.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:03,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-05-01 07:08:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2021-05-01 07:08:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.425) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-01 07:08:03,077 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-01 07:08:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:03,077 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-01 07:08:03,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-01 07:08:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-01 07:08:03,078 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:03,078 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:03,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-01 07:08:03,078 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1816003151, now seen corresponding path program 1 times [2021-05-01 07:08:03,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:03,079 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598750307] [2021-05-01 07:08:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:03,081 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,102 INFO L142 QuantifierPusher]: treesize reduction 4, result has 42.9 percent of original size [2021-05-01 07:08:03,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:03,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:03,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,136 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:03,136 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:03,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598750307] [2021-05-01 07:08:03,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1598750307] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:03,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:03,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:03,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394150546] [2021-05-01 07:08:03,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:03,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:03,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:03,137 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:03,286 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-05-01 07:08:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-01 07:08:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:03,287 INFO L225 Difference]: With dead ends: 96 [2021-05-01 07:08:03,287 INFO L226 Difference]: Without dead ends: 94 [2021-05-01 07:08:03,288 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:03,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-01 07:08:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-01 07:08:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-01 07:08:03,298 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-01 07:08:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:03,299 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-01 07:08:03,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-01 07:08:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-01 07:08:03,299 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:03,299 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:03,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-01 07:08:03,300 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:03,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -461519734, now seen corresponding path program 1 times [2021-05-01 07:08:03,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:03,300 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661723708] [2021-05-01 07:08:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:03,302 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:03,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:03,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:03,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:03,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,357 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:03,357 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:03,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661723708] [2021-05-01 07:08:03,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [661723708] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:03,357 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:03,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:03,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940903303] [2021-05-01 07:08:03,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:03,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:03,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:03,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:03,359 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:03,714 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2021-05-01 07:08:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:03,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-01 07:08:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:03,715 INFO L225 Difference]: With dead ends: 95 [2021-05-01 07:08:03,715 INFO L226 Difference]: Without dead ends: 93 [2021-05-01 07:08:03,716 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 215.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-05-01 07:08:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-05-01 07:08:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-01 07:08:03,730 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-01 07:08:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:03,730 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-01 07:08:03,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-01 07:08:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-01 07:08:03,731 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:03,731 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:03,731 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-01 07:08:03,731 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:03,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:03,731 INFO L82 PathProgramCache]: Analyzing trace with hash 788286019, now seen corresponding path program 1 times [2021-05-01 07:08:03,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:03,732 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133889731] [2021-05-01 07:08:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:03,733 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:03,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:03,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,783 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:03,783 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:03,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133889731] [2021-05-01 07:08:03,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [133889731] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:03,784 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:03,784 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:03,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840490701] [2021-05-01 07:08:03,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:03,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:03,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:03,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:03,785 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:03,940 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-01 07:08:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-01 07:08:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:03,941 INFO L225 Difference]: With dead ends: 69 [2021-05-01 07:08:03,941 INFO L226 Difference]: Without dead ends: 67 [2021-05-01 07:08:03,941 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 07:08:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-01 07:08:03,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2021-05-01 07:08:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 46 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-01 07:08:03,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-01 07:08:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:03,955 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-01 07:08:03,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:03,956 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-01 07:08:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-01 07:08:03,956 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:03,956 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:03,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-01 07:08:03,957 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:03,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1422206761, now seen corresponding path program 1 times [2021-05-01 07:08:03,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:03,957 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218275229] [2021-05-01 07:08:03,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:03,959 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:03,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:03,976 INFO L142 QuantifierPusher]: treesize reduction 9, result has 25.0 percent of original size [2021-05-01 07:08:03,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:03,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:03,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:03,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,014 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:04,015 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:04,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218275229] [2021-05-01 07:08:04,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [218275229] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:04,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:04,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:04,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30506092] [2021-05-01 07:08:04,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:04,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:04,016 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:04,165 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2021-05-01 07:08:04,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:04,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-01 07:08:04,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:04,166 INFO L225 Difference]: With dead ends: 91 [2021-05-01 07:08:04,166 INFO L226 Difference]: Without dead ends: 89 [2021-05-01 07:08:04,166 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:04,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-01 07:08:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 48. [2021-05-01 07:08:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 44 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-01 07:08:04,184 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-01 07:08:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:04,185 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-01 07:08:04,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-01 07:08:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-01 07:08:04,185 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:04,185 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:04,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-01 07:08:04,186 INFO L428 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:04,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:04,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1332934067, now seen corresponding path program 1 times [2021-05-01 07:08:04,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:04,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1616334049] [2021-05-01 07:08:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:04,188 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,226 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-05-01 07:08:04,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-05-01 07:08:04,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:04,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:04,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,269 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:04,269 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:04,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1616334049] [2021-05-01 07:08:04,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1616334049] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:04,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:04,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:04,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833216484] [2021-05-01 07:08:04,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:04,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:04,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:04,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:04,271 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:04,503 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-05-01 07:08:04,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-01 07:08:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:04,505 INFO L225 Difference]: With dead ends: 73 [2021-05-01 07:08:04,505 INFO L226 Difference]: Without dead ends: 71 [2021-05-01 07:08:04,506 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 142.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-01 07:08:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 46. [2021-05-01 07:08:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-01 07:08:04,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-01 07:08:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:04,530 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-01 07:08:04,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-01 07:08:04,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-01 07:08:04,531 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:04,531 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-01 07:08:04,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-01 07:08:04,532 INFO L428 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:04,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1628720009, now seen corresponding path program 1 times [2021-05-01 07:08:04,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:04,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [713130562] [2021-05-01 07:08:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:04,534 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:04,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:04,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:04,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:04,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,623 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:04,624 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:04,624 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [713130562] [2021-05-01 07:08:04,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [713130562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:04,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:04,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:04,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842988427] [2021-05-01 07:08:04,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:04,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:04,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:04,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:04,626 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:04,780 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-01 07:08:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:04,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-01 07:08:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:04,781 INFO L225 Difference]: With dead ends: 61 [2021-05-01 07:08:04,782 INFO L226 Difference]: Without dead ends: 59 [2021-05-01 07:08:04,783 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 104.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:04,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-01 07:08:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-01 07:08:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-01 07:08:04,795 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-01 07:08:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:04,796 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-01 07:08:04,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-01 07:08:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-01 07:08:04,798 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:04,798 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:04,798 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-01 07:08:04,798 INFO L428 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1049284141, now seen corresponding path program 1 times [2021-05-01 07:08:04,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:04,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143871973] [2021-05-01 07:08:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:04,800 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,815 INFO L142 QuantifierPusher]: treesize reduction 9, result has 25.0 percent of original size [2021-05-01 07:08:04,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:04,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:04,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,841 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:04,841 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:04,842 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2143871973] [2021-05-01 07:08:04,842 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2143871973] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:04,842 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:04,842 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:04,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457726385] [2021-05-01 07:08:04,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:04,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:04,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:04,843 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:04,952 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2021-05-01 07:08:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-01 07:08:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-05-01 07:08:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:04,953 INFO L225 Difference]: With dead ends: 61 [2021-05-01 07:08:04,953 INFO L226 Difference]: Without dead ends: 59 [2021-05-01 07:08:04,953 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:04,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-01 07:08:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-01 07:08:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-01 07:08:04,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-01 07:08:04,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:04,965 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-01 07:08:04,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-01 07:08:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-01 07:08:04,965 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:04,965 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:04,965 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-01 07:08:04,966 INFO L428 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:04,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1831933135, now seen corresponding path program 1 times [2021-05-01 07:08:04,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:04,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1042000509] [2021-05-01 07:08:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:04,967 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:04,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:04,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:04,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:04,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:04,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,020 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,020 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:05,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1042000509] [2021-05-01 07:08:05,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1042000509] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:05,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:05,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-01 07:08:05,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909280622] [2021-05-01 07:08:05,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-01 07:08:05,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-01 07:08:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-01 07:08:05,021 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:05,174 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-05-01 07:08:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:05,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-01 07:08:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:05,176 INFO L225 Difference]: With dead ends: 69 [2021-05-01 07:08:05,176 INFO L226 Difference]: Without dead ends: 67 [2021-05-01 07:08:05,176 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 91.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-01 07:08:05,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-01 07:08:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-01 07:08:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-01 07:08:05,188 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-01 07:08:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:05,188 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-01 07:08:05,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-01 07:08:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-01 07:08:05,190 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:05,190 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] [2021-05-01 07:08:05,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-01 07:08:05,190 INFO L428 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:05,191 INFO L82 PathProgramCache]: Analyzing trace with hash 955355481, now seen corresponding path program 1 times [2021-05-01 07:08:05,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:05,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309581425] [2021-05-01 07:08:05,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:05,193 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:05,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:05,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:05,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,254 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,254 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:05,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309581425] [2021-05-01 07:08:05,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1309581425] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:05,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:05,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:05,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223962285] [2021-05-01 07:08:05,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:05,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:05,257 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:05,472 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2021-05-01 07:08:05,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-01 07:08:05,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-01 07:08:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:05,473 INFO L225 Difference]: With dead ends: 74 [2021-05-01 07:08:05,473 INFO L226 Difference]: Without dead ends: 72 [2021-05-01 07:08:05,473 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 80.9ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-01 07:08:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-01 07:08:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-01 07:08:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-01 07:08:05,483 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-01 07:08:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:05,483 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-01 07:08:05,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-01 07:08:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-01 07:08:05,484 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:05,484 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:05,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-01 07:08:05,484 INFO L428 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:05,485 INFO L82 PathProgramCache]: Analyzing trace with hash -448748011, now seen corresponding path program 1 times [2021-05-01 07:08:05,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:05,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [94591352] [2021-05-01 07:08:05,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:05,487 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:05,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:05,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:05,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:05,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,558 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,558 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:05,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [94591352] [2021-05-01 07:08:05,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [94591352] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:05,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:05,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:05,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831423862] [2021-05-01 07:08:05,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:05,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:05,561 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:05,819 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2021-05-01 07:08:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 07:08:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-01 07:08:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:05,820 INFO L225 Difference]: With dead ends: 62 [2021-05-01 07:08:05,820 INFO L226 Difference]: Without dead ends: 60 [2021-05-01 07:08:05,820 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 162.6ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-01 07:08:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-01 07:08:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-01 07:08:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-01 07:08:05,829 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-01 07:08:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:05,829 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-01 07:08:05,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-01 07:08:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-01 07:08:05,829 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:05,829 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:05,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-01 07:08:05,830 INFO L428 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1026283297, now seen corresponding path program 1 times [2021-05-01 07:08:05,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:05,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961236203] [2021-05-01 07:08:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:05,831 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:05,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:05,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:05,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:05,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:05,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:05,876 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,877 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:05,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961236203] [2021-05-01 07:08:05,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1961236203] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:05,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:05,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-01 07:08:05,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897541548] [2021-05-01 07:08:05,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-01 07:08:05,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:05,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-01 07:08:05,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-01 07:08:05,878 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,175 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2021-05-01 07:08:06,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-01 07:08:06,175 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,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,176 INFO L225 Difference]: With dead ends: 87 [2021-05-01 07:08:06,176 INFO L226 Difference]: Without dead ends: 85 [2021-05-01 07:08:06,177 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-01 07:08:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-01 07:08:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-01 07:08:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-01 07:08:06,188 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-01 07:08:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,188 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-01 07:08:06,188 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,188 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-01 07:08:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-01 07:08:06,189 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:06,190 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] [2021-05-01 07:08:06,190 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-01 07:08:06,190 INFO L428 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1750007973, now seen corresponding path program 1 times [2021-05-01 07:08:06,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:06,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [777155679] [2021-05-01 07:08:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:06,192 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:06,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:06,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-05-01 07:08:06,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,252 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,252 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:06,252 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [777155679] [2021-05-01 07:08:06,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [777155679] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:06,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:06,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:06,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882327824] [2021-05-01 07:08:06,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:06,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:06,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:06,253 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,502 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-01 07:08:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 07:08:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-05-01 07:08:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,503 INFO L225 Difference]: With dead ends: 60 [2021-05-01 07:08:06,503 INFO L226 Difference]: Without dead ends: 58 [2021-05-01 07:08:06,503 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 167.7ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-01 07:08:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-01 07:08:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-01 07:08:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-01 07:08:06,512 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-01 07:08:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,512 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-01 07:08:06,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-01 07:08:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-01 07:08:06,512 INFO L511 BasicCegarLoop]: Found error trace [2021-05-01 07:08:06,512 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] [2021-05-01 07:08:06,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-01 07:08:06,513 INFO L428 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-01 07:08:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-01 07:08:06,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1584330853, now seen corresponding path program 1 times [2021-05-01 07:08:06,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-01 07:08:06,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1335839935] [2021-05-01 07:08:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-01 07:08:06,514 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-01 07:08:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-05-01 07:08:06,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-05-01 07:08:06,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-01 07:08:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-01 07:08:06,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-05-01 07:08:06,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-05-01 07:08:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-01 07:08:06,560 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-01 07:08:06,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1335839935] [2021-05-01 07:08:06,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1335839935] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-01 07:08:06,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-01 07:08:06,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-01 07:08:06,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701499471] [2021-05-01 07:08:06,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-01 07:08:06,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-01 07:08:06,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-01 07:08:06,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-01 07:08:06,561 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-01 07:08:06,964 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2021-05-01 07:08:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-01 07:08:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-01 07:08:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-01 07:08:06,965 INFO L225 Difference]: With dead ends: 125 [2021-05-01 07:08:06,965 INFO L226 Difference]: Without dead ends: 0 [2021-05-01 07:08:06,965 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 147.6ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-01 07:08:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-01 07:08:06,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-01 07:08:06,966 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:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-01 07:08:06,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-01 07:08:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-01 07:08:06,966 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-01 07:08:06,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-01 07:08:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-01 07:08:06,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-01 07:08:06,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-01 07:08:06,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-01 07:08:07,231 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 129 [2021-05-01 07:08:07,465 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 134 [2021-05-01 07:08:07,704 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 145 [2021-05-01 07:08:07,828 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 137 [2021-05-01 07:08:07,993 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 120 [2021-05-01 07:08:08,132 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 132 [2021-05-01 07:08:08,350 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 113 [2021-05-01 07:08:08,565 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 156 [2021-05-01 07:08:08,723 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 136 [2021-05-01 07:08:08,935 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 146 [2021-05-01 07:08:09,048 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 127 [2021-05-01 07:08:09,200 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 138 [2021-05-01 07:08:09,574 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 30 [2021-05-01 07:08:09,708 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 18 [2021-05-01 07:08:09,891 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 42 [2021-05-01 07:08:10,081 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 36 [2021-05-01 07:08:10,291 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-01 07:08:10,487 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 32 [2021-05-01 07:08:10,635 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 22 [2021-05-01 07:08:10,756 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 13 [2021-05-01 07:08:11,023 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2021-05-01 07:08:11,204 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 25 [2021-05-01 07:08:11,383 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 38 [2021-05-01 07:08:11,552 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 28 [2021-05-01 07:08:11,714 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 22 [2021-05-01 07:08:12,014 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 26 [2021-05-01 07:08:12,173 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2021-05-01 07:08:12,362 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2021-05-01 07:08:12,448 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-01 07:08:12,448 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-01 07:08:12,448 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-01 07:08:12,448 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= ~__return_334~0 |old(~__return_334~0)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-01 07:08:12,449 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:12,449 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-01 07:08:12,449 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:12,449 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-01 07:08:12,449 INFO L194 CegarLoopUtils]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) the Hoare annotation is: false [2021-05-01 07:08:12,449 INFO L194 CegarLoopUtils]: At program point L217(line 217) the Hoare annotation is: false [2021-05-01 07:08:12,449 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 13 313) the Hoare annotation is: true [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L151(lines 151 281) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L110(lines 110 123) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~5 0)) (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) the Hoare annotation is: false [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L36(lines 36 300) the Hoare annotation is: (and (<= 0 main_~main__i~0) (<= 0 main_~main__j~0) (< main_~main__i~0 main_~main__len~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L193(line 193) the Hoare annotation is: false [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) the Hoare annotation is: false [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L86(lines 86 127) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 0 main_~main__j~0) (< main_~main__i~0 main_~main__len~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L20(lines 20 312) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L243(lines 243 267) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 2 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,450 INFO L194 CegarLoopUtils]: At program point L177(line 177) the Hoare annotation is: false [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L45(lines 45 288) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) the Hoare annotation is: false [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L227(lines 227 269) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L153(line 153) the Hoare annotation is: false [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) the Hoare annotation is: false [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L112(line 112) the Hoare annotation is: false [2021-05-01 07:08:12,451 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 13 313) the Hoare annotation is: true [2021-05-01 07:08:12,451 INFO L194 CegarLoopUtils]: At program point L203(lines 203 273) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L38(lines 38 294) the Hoare annotation is: (and (<= 0 main_~main__i~0) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0)) [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 13 313) the Hoare annotation is: (= |old(~__return_334~0)| ~__return_334~0) [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L88(line 88) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L245(line 245) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L229(line 229) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L163(lines 163 279) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0))) [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) the Hoare annotation is: false [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,452 INFO L194 CegarLoopUtils]: At program point L205(line 205) the Hoare annotation is: false [2021-05-01 07:08:12,462 INFO L194 CegarLoopUtils]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) the Hoare annotation is: false [2021-05-01 07:08:12,462 INFO L194 CegarLoopUtils]: At program point L139(lines 139 283) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,462 INFO L194 CegarLoopUtils]: At program point L98(lines 98 125) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~4 0)) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~3 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0)) [2021-05-01 07:08:12,462 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) the Hoare annotation is: false [2021-05-01 07:08:12,462 INFO L194 CegarLoopUtils]: At program point L255(lines 255 265) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 2 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~15 0)) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~14 0)) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point L57(lines 57 286) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point L74(lines 74 129) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (< main_~main__i~0 main_~main__len~0) (<= 0 main_~main__j~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) the Hoare annotation is: false [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse4 (<= (+ main_~main__j~0 4) main_~main__bufsize~0)) (.cse0 (= |old(~__return_334~0)| ~__return_334~0)) (.cse1 (<= (+ main_~main__limit~0 4) main_~main__bufsize~0))) (let ((.cse2 (<= 1 main_~main__j~0)) (.cse3 (let ((.cse5 (<= 0 main_~main__j~0)) (.cse6 (<= 1 main_~main__i~0))) (or (and .cse5 .cse6 .cse0 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse1) (and .cse5 .cse6 .cse4 .cse0 .cse1))))) (or (and (<= 0 main_~main__i~0) (= main_~main__j~0 0) (< main_~main__i~0 main_~main__len~0) .cse0 .cse1) (and .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~14 0))) (and .cse2 .cse3 .cse4)))) [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point L165(line 165) the Hoare annotation is: false [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point L66(lines 66 285) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 0 main_~main__j~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__i~0 2) main_~main__len~0) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,463 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L215(lines 215 271) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (<= 1 main_~main__i~0) (= |old(~__return_334~0)| ~__return_334~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0)) (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (not (= main_~__VERIFIER_assert__cond~12 0)) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0)) [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L141(line 141) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L100(line 100) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L257(line 257) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L191(lines 191 275) the Hoare annotation is: (and (<= 1 main_~main__j~0) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 1 main_~main__i~0) (<= (+ main_~main__j~0 4) main_~main__bufsize~0) (= main_~__VERIFIER_assert__cond~1 1) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~10 0))) [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L59(line 59) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) the Hoare annotation is: false [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L175(lines 175 277) the Hoare annotation is: (and (<= 0 main_~main__i~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (not (= main_~__VERIFIER_assert__cond~9 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (<= 0 main_~main__j~0) (<= (+ main_~main__i~0 2) main_~main__len~0) (= main_~__VERIFIER_assert__cond~1 1) (<= (+ main_~main__j~0 5) main_~main__bufsize~0) (= |old(~__return_334~0)| ~__return_334~0) (<= (+ main_~main__limit~0 4) main_~main__bufsize~0) (not (= main_~__VERIFIER_assert__cond~8 0))) [2021-05-01 07:08:12,464 INFO L194 CegarLoopUtils]: At program point L76(line 76) the Hoare annotation is: false [2021-05-01 07:08:12,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.05 07:08:12 BoogieIcfgContainer [2021-05-01 07:08:12,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-01 07:08:12,502 INFO L168 Benchmark]: Toolchain (without parser) took 11424.05 ms. Allocated memory was 170.9 MB in the beginning and 450.9 MB in the end (delta: 280.0 MB). Free memory was 136.1 MB in the beginning and 260.7 MB in the end (delta: -124.6 MB). Peak memory consumption was 261.1 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:12,502 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 170.9 MB. Free memory is still 152.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-01 07:08:12,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.52 ms. Allocated memory is still 170.9 MB. Free memory was 135.9 MB in the beginning and 151.0 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:12,504 INFO L168 Benchmark]: Boogie Preprocessor took 23.06 ms. Allocated memory is still 170.9 MB. Free memory was 150.7 MB in the beginning and 149.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:12,504 INFO L168 Benchmark]: RCFGBuilder took 493.41 ms. Allocated memory is still 170.9 MB. Free memory was 149.0 MB in the beginning and 125.5 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:12,509 INFO L168 Benchmark]: TraceAbstraction took 10637.33 ms. Allocated memory was 170.9 MB in the beginning and 450.9 MB in the end (delta: 280.0 MB). Free memory was 124.8 MB in the beginning and 260.7 MB in the end (delta: -135.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 8.0 GB. [2021-05-01 07:08:12,510 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.09 ms. Allocated memory is still 170.9 MB. Free memory is still 152.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 265.52 ms. Allocated memory is still 170.9 MB. Free memory was 135.9 MB in the beginning and 151.0 MB in the end (delta: -15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.06 ms. Allocated memory is still 170.9 MB. Free memory was 150.7 MB in the beginning and 149.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 493.41 ms. Allocated memory is still 170.9 MB. Free memory was 149.0 MB in the beginning and 125.5 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10637.33 ms. Allocated memory was 170.9 MB in the beginning and 450.9 MB in the end (delta: 280.0 MB). Free memory was 124.8 MB in the beginning and 260.7 MB in the end (delta: -135.9 MB). Peak memory consumption was 249.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 72 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5062.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 17.7ms, AutomataDifference: 3552.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 5480.8ms, InitialAbstractionConstructionTime: 14.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 941 SDtfs, 1948 SDslu, 201 SDs, 0 SdLazy, 1688 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1324.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1805.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 202.8ms AutomataMinimizationTime, 16 MinimizatonAttempts, 435 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 65 LocationsWithAnnotation, 65 PreInvPairs, 189 NumberOfFragments, 1000 HoareAnnotationTreeSize, 65 FomulaSimplifications, 4033300448 FormulaSimplificationTreeSizeReduction, 2410.0ms HoareSimplificationTime, 65 FomulaSimplificationsInter, 5915929 FormulaSimplificationTreeSizeReductionInter, 3048.4ms 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 16 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((0 <= main__i && main__j == 0) && main__i < main__len) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && !(__VERIFIER_assert__cond == 0))) || ((1 <= main__j && (((((0 <= main__j && 1 <= main__i) && \old(__return_334) == __return_334) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize) || ((((0 <= main__j && 1 <= main__i) && main__j + 4 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize))) && main__j + 4 <= main__bufsize) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((((0 <= main__i && main__i < main__len) && 0 <= main__j) && main__j + 5 <= main__bufsize) && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (0 <= main__i && \old(__return_334) == __return_334) && main__limit + 4 <= main__bufsize - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...