/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 05:52:24,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 05:52:24,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 05:52:24,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 05:52:24,350 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 05:52:24,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 05:52:24,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 05:52:24,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 05:52:24,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 05:52:24,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 05:52:24,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 05:52:24,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 05:52:24,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 05:52:24,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 05:52:24,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 05:52:24,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 05:52:24,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 05:52:24,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 05:52:24,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 05:52:24,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 05:52:24,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 05:52:24,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 05:52:24,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 05:52:24,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 05:52:24,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 05:52:24,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 05:52:24,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 05:52:24,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 05:52:24,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 05:52:24,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 05:52:24,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 05:52:24,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 05:52:24,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 05:52:24,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 05:52:24,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 05:52:24,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 05:52:24,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 05:52:24,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 05:52:24,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 05:52:24,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 05:52:24,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 05:52:24,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2021-05-06 05:52:24,380 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 05:52:24,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 05:52:24,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 05:52:24,381 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 05:52:24,382 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 05:52:24,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 05:52:24,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 05:52:24,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 05:52:24,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-06 05:52:24,384 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-05-06 05:52:24,384 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-06 05:52:24,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 05:52:24,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 05:52:24,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 05:52:24,654 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 05:52:24,655 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 05:52:24,656 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-06 05:52:24,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c145b4277/7a5ab81da8bc4833b2136ffb5d365d8b/FLAG8bc57b9e3 [2021-05-06 05:52:25,045 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 05:52:25,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-05-06 05:52:25,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c145b4277/7a5ab81da8bc4833b2136ffb5d365d8b/FLAG8bc57b9e3 [2021-05-06 05:52:25,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c145b4277/7a5ab81da8bc4833b2136ffb5d365d8b [2021-05-06 05:52:25,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 05:52:25,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-05-06 05:52:25,465 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 05:52:25,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 05:52:25,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 05:52:25,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa921a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25, skipping insertion in model container [2021-05-06 05:52:25,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 05:52:25,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 05:52:25,594 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-06 05:52:25,597 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-06 05:52:25,598 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-06 05:52:25,599 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-06 05:52:25,600 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-06 05:52:25,601 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-06 05:52:25,603 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-06 05:52:25,604 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-06 05:52:25,605 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-06 05:52:25,606 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-06 05:52:25,607 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-06 05:52:25,608 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-06 05:52:25,609 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-06 05:52:25,609 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-06 05:52:25,611 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-06 05:52:25,612 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-06 05:52:25,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:52:25,622 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 05:52:25,642 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-05-06 05:52:25,643 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-05-06 05:52:25,647 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-05-06 05:52:25,653 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-06 05:52:25,654 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-06 05:52:25,655 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-06 05:52:25,656 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-06 05:52:25,661 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-06 05:52:25,662 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-06 05:52:25,662 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-06 05:52:25,663 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-06 05:52:25,664 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-06 05:52:25,665 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-06 05:52:25,666 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-06 05:52:25,667 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-06 05:52:25,668 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-06 05:52:25,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 05:52:25,709 INFO L208 MainTranslator]: Completed translation [2021-05-06 05:52:25,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25 WrapperNode [2021-05-06 05:52:25,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 05:52:25,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 05:52:25,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 05:52:25,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 05:52:25,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (1/1) ... [2021-05-06 05:52:25,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 05:52:25,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 05:52:25,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 05:52:25,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 05:52:25,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (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-06 05:52:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 05:52:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 05:52:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 05:52:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 05:52:25,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 05:52:25,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 05:52:25,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 05:52:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 05:52:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 05:52:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 05:52:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 05:52:25,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 05:52:26,142 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 05:52:26,142 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 05:52:26,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:26 BoogieIcfgContainer [2021-05-06 05:52:26,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 05:52:26,144 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2021-05-06 05:52:26,144 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2021-05-06 05:52:26,144 INFO L275 PluginConnector]: IcfgTransformer initialized [2021-05-06 05:52:26,146 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:26" (1/1) ... [2021-05-06 05:52:26,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:52:26 BasicIcfg [2021-05-06 05:52:26,171 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2021-05-06 05:52:26,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 05:52:26,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 05:52:26,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 05:52:26,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 05:52:25" (1/4) ... [2021-05-06 05:52:26,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:52:26, skipping insertion in model container [2021-05-06 05:52:26,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 05:52:25" (2/4) ... [2021-05-06 05:52:26,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 05:52:26, skipping insertion in model container [2021-05-06 05:52:26,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 05:52:26" (3/4) ... [2021-05-06 05:52:26,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4067bc89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:52:26, skipping insertion in model container [2021-05-06 05:52:26,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.05 05:52:26" (4/4) ... [2021-05-06 05:52:26,178 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.cJordan [2021-05-06 05:52:26,183 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2021-05-06 05:52:26,185 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-05-06 05:52:26,196 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-05-06 05:52:26,216 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 05:52:26,216 INFO L377 AbstractCegarLoop]: Hoare is false [2021-05-06 05:52:26,216 INFO L378 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2021-05-06 05:52:26,216 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 05:52:26,216 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 05:52:26,217 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 05:52:26,217 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 05:52:26,217 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 05:52:26,232 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-06 05:52:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-06 05:52:26,238 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:26,238 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:26,239 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-06 05:52:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2053356655, now seen corresponding path program 1 times [2021-05-06 05:52:26,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:26,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699224939] [2021-05-06 05:52:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:26,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:26,479 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-06 05:52:26,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:26,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699224939] [2021-05-06 05:52:26,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699224939] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:26,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:26,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 05:52:26,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563200780] [2021-05-06 05:52:26,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 05:52:26,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:26,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 05:52:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 05:52:26,493 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-06 05:52:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:26,609 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2021-05-06 05:52:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:26,610 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-06 05:52:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:26,615 INFO L225 Difference]: With dead ends: 84 [2021-05-06 05:52:26,615 INFO L226 Difference]: Without dead ends: 76 [2021-05-06 05:52:26,616 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 93.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-06 05:52:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2021-05-06 05:52:26,636 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-06 05:52:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-05-06 05:52:26,638 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 13 [2021-05-06 05:52:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:26,638 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-05-06 05:52:26,638 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-06 05:52:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-05-06 05:52:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 05:52:26,638 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:26,639 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:26,639 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 05:52:26,639 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-06 05:52:26,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:26,640 INFO L82 PathProgramCache]: Analyzing trace with hash 770454336, now seen corresponding path program 1 times [2021-05-06 05:52:26,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:26,641 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600696893] [2021-05-06 05:52:26,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:26,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:26,738 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-06 05:52:26,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:26,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600696893] [2021-05-06 05:52:26,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600696893] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:26,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:26,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:26,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065496925] [2021-05-06 05:52:26,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:26,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:26,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:26,740 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-06 05:52:26,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:26,933 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2021-05-06 05:52:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:26,934 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-06 05:52:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:26,936 INFO L225 Difference]: With dead ends: 75 [2021-05-06 05:52:26,936 INFO L226 Difference]: Without dead ends: 75 [2021-05-06 05:52:26,937 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-05-06 05:52:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2021-05-06 05:52:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-05-06 05:52:26,942 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 14 [2021-05-06 05:52:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:26,942 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-05-06 05:52:26,942 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-06 05:52:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-05-06 05:52:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 05:52:26,943 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:26,943 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:26,943 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 05:52:26,943 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-06 05:52:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 770485154, now seen corresponding path program 1 times [2021-05-06 05:52:26,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:26,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080848286] [2021-05-06 05:52:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,015 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-06 05:52:27,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:27,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080848286] [2021-05-06 05:52:27,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080848286] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:27,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:27,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:27,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363222929] [2021-05-06 05:52:27,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:27,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:27,017 INFO L87 Difference]: Start difference. First operand 57 states and 61 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-06 05:52:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:27,250 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2021-05-06 05:52:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:27,251 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-06 05:52:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:27,251 INFO L225 Difference]: With dead ends: 97 [2021-05-06 05:52:27,251 INFO L226 Difference]: Without dead ends: 97 [2021-05-06 05:52:27,252 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 134.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:52:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-06 05:52:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2021-05-06 05:52:27,255 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-06 05:52:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-05-06 05:52:27,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 14 [2021-05-06 05:52:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:27,256 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-05-06 05:52:27,256 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-06 05:52:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-05-06 05:52:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-06 05:52:27,257 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:27,257 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:27,257 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 05:52:27,257 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-06 05:52:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1884762791, now seen corresponding path program 1 times [2021-05-06 05:52:27,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:27,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417005769] [2021-05-06 05:52:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,312 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-06 05:52:27,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:27,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417005769] [2021-05-06 05:52:27,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417005769] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:27,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:27,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:27,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385936950] [2021-05-06 05:52:27,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:27,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:27,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:27,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:27,313 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-06 05:52:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:27,471 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2021-05-06 05:52:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:27,472 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-06 05:52:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:27,473 INFO L225 Difference]: With dead ends: 94 [2021-05-06 05:52:27,473 INFO L226 Difference]: Without dead ends: 94 [2021-05-06 05:52:27,473 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 64.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-05-06 05:52:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 54. [2021-05-06 05:52:27,475 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-06 05:52:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-05-06 05:52:27,476 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2021-05-06 05:52:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:27,476 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-05-06 05:52:27,476 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-06 05:52:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-05-06 05:52:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 05:52:27,477 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:27,477 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:27,477 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 05:52:27,477 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-06 05:52:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1672280616, now seen corresponding path program 1 times [2021-05-06 05:52:27,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:27,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228200289] [2021-05-06 05:52:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,538 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-06 05:52:27,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:27,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228200289] [2021-05-06 05:52:27,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228200289] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:27,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:27,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:27,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753921274] [2021-05-06 05:52:27,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:27,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:27,540 INFO L87 Difference]: Start difference. First operand 54 states and 58 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-06 05:52:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:27,715 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-05-06 05:52:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:27,721 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-06 05:52:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:27,723 INFO L225 Difference]: With dead ends: 71 [2021-05-06 05:52:27,723 INFO L226 Difference]: Without dead ends: 71 [2021-05-06 05:52:27,724 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 105.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:52:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-05-06 05:52:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2021-05-06 05:52:27,732 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-06 05:52:27,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-05-06 05:52:27,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2021-05-06 05:52:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:27,732 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-05-06 05:52:27,732 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-06 05:52:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-05-06 05:52:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-06 05:52:27,733 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:27,733 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:27,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 05:52:27,733 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-06 05:52:27,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1701896842, now seen corresponding path program 1 times [2021-05-06 05:52:27,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:27,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420201785] [2021-05-06 05:52:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:27,828 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-06 05:52:27,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:27,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420201785] [2021-05-06 05:52:27,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420201785] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:27,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:27,829 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:27,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299803549] [2021-05-06 05:52:27,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:27,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:27,832 INFO L87 Difference]: Start difference. First operand 52 states and 56 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-06 05:52:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:28,038 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2021-05-06 05:52:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:28,039 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-06 05:52:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:28,039 INFO L225 Difference]: With dead ends: 89 [2021-05-06 05:52:28,039 INFO L226 Difference]: Without dead ends: 89 [2021-05-06 05:52:28,040 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 121.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:52:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-05-06 05:52:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 50. [2021-05-06 05:52:28,044 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-06 05:52:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-05-06 05:52:28,047 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2021-05-06 05:52:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:28,048 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-05-06 05:52:28,048 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-06 05:52:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-05-06 05:52:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 05:52:28,048 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:28,048 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:28,049 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 05:52:28,049 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-06 05:52:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash 301092767, now seen corresponding path program 1 times [2021-05-06 05:52:28,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:28,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375117897] [2021-05-06 05:52:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,137 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-06 05:52:28,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:28,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375117897] [2021-05-06 05:52:28,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375117897] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:28,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:28,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:28,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80560427] [2021-05-06 05:52:28,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:28,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:28,140 INFO L87 Difference]: Start difference. First operand 50 states and 54 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-06 05:52:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:28,357 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-05-06 05:52:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:28,357 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-06 05:52:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:28,358 INFO L225 Difference]: With dead ends: 77 [2021-05-06 05:52:28,358 INFO L226 Difference]: Without dead ends: 77 [2021-05-06 05:52:28,359 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 156.8ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-05-06 05:52:28,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2021-05-06 05:52:28,366 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-06 05:52:28,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-05-06 05:52:28,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 17 [2021-05-06 05:52:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:28,368 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-05-06 05:52:28,368 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-06 05:52:28,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-05-06 05:52:28,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-06 05:52:28,368 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:28,368 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:28,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 05:52:28,369 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-06 05:52:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:28,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1219195777, now seen corresponding path program 1 times [2021-05-06 05:52:28,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:28,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337951901] [2021-05-06 05:52:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,427 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-06 05:52:28,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:28,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337951901] [2021-05-06 05:52:28,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337951901] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:28,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:28,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:28,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524201731] [2021-05-06 05:52:28,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:28,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:28,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:28,430 INFO L87 Difference]: Start difference. First operand 48 states and 52 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-06 05:52:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:28,563 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2021-05-06 05:52:28,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:28,564 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-06 05:52:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:28,565 INFO L225 Difference]: With dead ends: 85 [2021-05-06 05:52:28,565 INFO L226 Difference]: Without dead ends: 85 [2021-05-06 05:52:28,565 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:28,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-06 05:52:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-05-06 05:52:28,566 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-06 05:52:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-05-06 05:52:28,567 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 17 [2021-05-06 05:52:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:28,567 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-05-06 05:52:28,567 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-06 05:52:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-05-06 05:52:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-06 05:52:28,567 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:28,568 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:28,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-06 05:52:28,572 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-06 05:52:28,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash 743942414, now seen corresponding path program 1 times [2021-05-06 05:52:28,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:28,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868013612] [2021-05-06 05:52:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,642 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-06 05:52:28,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:28,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868013612] [2021-05-06 05:52:28,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868013612] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:28,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:28,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:28,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990601851] [2021-05-06 05:52:28,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:28,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:28,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:28,643 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-06 05:52:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:28,806 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-06 05:52:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:28,806 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-06 05:52:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:28,806 INFO L225 Difference]: With dead ends: 59 [2021-05-06 05:52:28,807 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 05:52:28,807 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:52:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 05:52:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2021-05-06 05:52:28,808 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-06 05:52:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-05-06 05:52:28,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 18 [2021-05-06 05:52:28,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:28,810 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-05-06 05:52:28,810 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-06 05:52:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-05-06 05:52:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-05-06 05:52:28,812 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:28,812 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:28,812 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-06 05:52:28,812 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-06 05:52:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:28,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1587379587, now seen corresponding path program 1 times [2021-05-06 05:52:28,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:28,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272654304] [2021-05-06 05:52:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,865 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-06 05:52:28,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:28,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272654304] [2021-05-06 05:52:28,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272654304] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:28,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:28,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:28,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671718139] [2021-05-06 05:52:28,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:28,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:28,868 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-06 05:52:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:28,950 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2021-05-06 05:52:28,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-06 05:52:28,951 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-06 05:52:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:28,951 INFO L225 Difference]: With dead ends: 59 [2021-05-06 05:52:28,952 INFO L226 Difference]: Without dead ends: 59 [2021-05-06 05:52:28,952 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:28,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-06 05:52:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2021-05-06 05:52:28,953 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-06 05:52:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-05-06 05:52:28,953 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 19 [2021-05-06 05:52:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:28,953 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-05-06 05:52:28,954 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-06 05:52:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-05-06 05:52:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 05:52:28,954 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:28,954 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:28,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-06 05:52:28,954 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-06 05:52:28,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1964128178, now seen corresponding path program 1 times [2021-05-06 05:52:28,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:28,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035296149] [2021-05-06 05:52:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:28,997 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-06 05:52:28,997 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:28,997 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035296149] [2021-05-06 05:52:28,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035296149] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:28,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:28,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 05:52:28,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594049337] [2021-05-06 05:52:28,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 05:52:28,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 05:52:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 05:52:28,998 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-06 05:52:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:29,149 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2021-05-06 05:52:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:29,150 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-06 05:52:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:29,150 INFO L225 Difference]: With dead ends: 67 [2021-05-06 05:52:29,150 INFO L226 Difference]: Without dead ends: 67 [2021-05-06 05:52:29,151 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-06 05:52:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-05-06 05:52:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2021-05-06 05:52:29,152 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-06 05:52:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-05-06 05:52:29,152 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2021-05-06 05:52:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:29,153 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-05-06 05:52:29,153 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-06 05:52:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-05-06 05:52:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 05:52:29,153 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:29,153 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:29,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-06 05:52:29,153 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-06 05:52:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 758432615, now seen corresponding path program 1 times [2021-05-06 05:52:29,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:29,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741974635] [2021-05-06 05:52:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,202 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-06 05:52:29,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:29,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741974635] [2021-05-06 05:52:29,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741974635] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:29,202 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:29,202 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:29,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359094665] [2021-05-06 05:52:29,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:29,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:29,203 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-06 05:52:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:29,404 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-05-06 05:52:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 05:52:29,405 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-06 05:52:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:29,405 INFO L225 Difference]: With dead ends: 72 [2021-05-06 05:52:29,405 INFO L226 Difference]: Without dead ends: 72 [2021-05-06 05:52:29,406 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-06 05:52:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-05-06 05:52:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2021-05-06 05:52:29,407 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-06 05:52:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-05-06 05:52:29,407 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2021-05-06 05:52:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:29,407 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-05-06 05:52:29,407 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-06 05:52:29,407 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-05-06 05:52:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 05:52:29,408 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:29,408 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:29,408 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-06 05:52:29,408 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-06 05:52:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2036575830, now seen corresponding path program 1 times [2021-05-06 05:52:29,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:29,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460093794] [2021-05-06 05:52:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,461 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-06 05:52:29,461 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:29,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460093794] [2021-05-06 05:52:29,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460093794] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:29,461 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:29,461 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:52:29,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939396216] [2021-05-06 05:52:29,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:29,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:29,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:29,462 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-06 05:52:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:29,690 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2021-05-06 05:52:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 05:52:29,690 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-06 05:52:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:29,691 INFO L225 Difference]: With dead ends: 60 [2021-05-06 05:52:29,691 INFO L226 Difference]: Without dead ends: 60 [2021-05-06 05:52:29,691 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 169.7ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-06 05:52:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-06 05:52:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2021-05-06 05:52:29,692 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-06 05:52:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-05-06 05:52:29,692 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2021-05-06 05:52:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-05-06 05:52:29,693 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-06 05:52:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-05-06 05:52:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-05-06 05:52:29,693 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:29,693 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:29,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-06 05:52:29,693 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-06 05:52:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1290657461, now seen corresponding path program 1 times [2021-05-06 05:52:29,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:29,694 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206398640] [2021-05-06 05:52:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:29,741 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-06 05:52:29,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:29,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206398640] [2021-05-06 05:52:29,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206398640] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:29,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:29,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 05:52:29,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784993895] [2021-05-06 05:52:29,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 05:52:29,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 05:52:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-06 05:52:29,750 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-06 05:52:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:29,988 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2021-05-06 05:52:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 05:52:29,988 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-06 05:52:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:29,989 INFO L225 Difference]: With dead ends: 85 [2021-05-06 05:52:29,989 INFO L226 Difference]: Without dead ends: 85 [2021-05-06 05:52:29,990 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-06 05:52:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-05-06 05:52:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 34. [2021-05-06 05:52:29,992 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-06 05:52:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-06 05:52:29,993 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 23 [2021-05-06 05:52:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-06 05:52:29,993 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-06 05:52:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-06 05:52:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 05:52:29,993 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:29,993 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:29,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-06 05:52:29,994 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-06 05:52:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1355674374, now seen corresponding path program 1 times [2021-05-06 05:52:29,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:29,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430273791] [2021-05-06 05:52:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:30,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:30,046 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-06 05:52:30,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:30,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430273791] [2021-05-06 05:52:30,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430273791] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:30,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:30,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:52:30,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493238782] [2021-05-06 05:52:30,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:30,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:30,048 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-06 05:52:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:30,270 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-05-06 05:52:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 05:52:30,270 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-06 05:52:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:30,271 INFO L225 Difference]: With dead ends: 58 [2021-05-06 05:52:30,271 INFO L226 Difference]: Without dead ends: 58 [2021-05-06 05:52:30,271 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 160.3ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-05-06 05:52:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-06 05:52:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 32. [2021-05-06 05:52:30,272 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-06 05:52:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-05-06 05:52:30,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 24 [2021-05-06 05:52:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:30,273 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-05-06 05:52:30,273 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-06 05:52:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-05-06 05:52:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-05-06 05:52:30,273 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 05:52:30,273 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 05:52:30,273 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-06 05:52:30,273 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-06 05:52:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 05:52:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 923768623, now seen corresponding path program 1 times [2021-05-06 05:52:30,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-06 05:52:30,274 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647684711] [2021-05-06 05:52:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 05:52:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:30,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 05:52:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 05:52:30,328 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-06 05:52:30,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-06 05:52:30,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647684711] [2021-05-06 05:52:30,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647684711] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 05:52:30,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 05:52:30,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 05:52:30,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177083730] [2021-05-06 05:52:30,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 05:52:30,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-06 05:52:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 05:52:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-05-06 05:52:30,329 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-06 05:52:30,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 05:52:30,721 INFO L93 Difference]: Finished difference Result 123 states and 145 transitions. [2021-05-06 05:52:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 05:52:30,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-05-06 05:52:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 05:52:30,722 INFO L225 Difference]: With dead ends: 123 [2021-05-06 05:52:30,722 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 05:52:30,722 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 182.2ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-05-06 05:52:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 05:52:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 05:52:30,722 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-06 05:52:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 05:52:30,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-05-06 05:52:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 05:52:30,722 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 05:52:30,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 05:52:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 05:52:30,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 05:52:30,723 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-06 05:52:30,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 05:52:30 BasicIcfg [2021-05-06 05:52:30,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 05:52:30,730 INFO L168 Benchmark]: Toolchain (without parser) took 5265.09 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 151.4 MB in the beginning and 174.9 MB in the end (delta: -23.5 MB). Peak memory consumption was 61.3 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,730 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 185.6 MB. Free memory was 168.1 MB in the beginning and 168.0 MB in the end (delta: 92.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 05:52:30,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.79 ms. Allocated memory is still 185.6 MB. Free memory was 151.2 MB in the beginning and 169.4 MB in the end (delta: -18.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,731 INFO L168 Benchmark]: Boogie Preprocessor took 41.77 ms. Allocated memory is still 185.6 MB. Free memory was 169.4 MB in the beginning and 167.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,731 INFO L168 Benchmark]: RCFGBuilder took 383.94 ms. Allocated memory is still 185.6 MB. Free memory was 167.3 MB in the beginning and 143.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,732 INFO L168 Benchmark]: IcfgTransformer took 27.66 ms. Allocated memory is still 185.6 MB. Free memory was 143.1 MB in the beginning and 141.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,732 INFO L168 Benchmark]: TraceAbstraction took 4554.19 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 141.6 MB in the beginning and 174.9 MB in the end (delta: -33.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 8.0 GB. [2021-05-06 05:52:30,739 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 185.6 MB. Free memory was 168.1 MB in the beginning and 168.0 MB in the end (delta: 92.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 250.79 ms. Allocated memory is still 185.6 MB. Free memory was 151.2 MB in the beginning and 169.4 MB in the end (delta: -18.1 MB). Peak memory consumption was 20.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.77 ms. Allocated memory is still 185.6 MB. Free memory was 169.4 MB in the beginning and 167.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 383.94 ms. Allocated memory is still 185.6 MB. Free memory was 167.3 MB in the beginning and 143.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 8.0 GB. * IcfgTransformer took 27.66 ms. Allocated memory is still 185.6 MB. Free memory was 143.1 MB in the beginning and 141.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4554.19 ms. Allocated memory was 185.6 MB in the beginning and 268.4 MB in the end (delta: 82.8 MB). Free memory was 141.6 MB in the beginning and 174.9 MB in the end (delta: -33.3 MB). Peak memory consumption was 50.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4509.1ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 17.9ms, AutomataDifference: 3172.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 931 SDtfs, 1965 SDslu, 201 SDs, 0 SdLazy, 1664 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1332.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1812.3ms 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: 63.1ms AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.1ms SsaConstructionTime, 150.4ms SatisfiabilityAnalysisTime, 917.3ms InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...