/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 17:45:51,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 17:45:51,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 17:45:51,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 17:45:51,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 17:45:51,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 17:45:51,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 17:45:51,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 17:45:51,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 17:45:51,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 17:45:51,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 17:45:51,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 17:45:51,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 17:45:51,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 17:45:51,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 17:45:51,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 17:45:51,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 17:45:51,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 17:45:51,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 17:45:51,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 17:45:51,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 17:45:51,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 17:45:51,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 17:45:51,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 17:45:51,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 17:45:51,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 17:45:51,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 17:45:51,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 17:45:51,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 17:45:51,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 17:45:51,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 17:45:51,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 17:45:51,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 17:45:51,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 17:45:51,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 17:45:51,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 17:45:51,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 17:45:51,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 17:45:51,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 17:45:51,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 17:45:51,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 17:45:51,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 17:45:51,595 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 17:45:51,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 17:45:51,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 17:45:51,598 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 17:45:51,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 17:45:51,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 17:45:51,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 17:45:51,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 17:45:51,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 17:45:51,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 17:45:51,600 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 17:45:51,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 17:45:51,601 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 17:45:51,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 17:45:51,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 17:45:51,601 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 17:45:51,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 17:45:51,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 17:45:51,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 17:45:51,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 17:45:51,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 17:45:51,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 17:45:51,603 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 17:45:52,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 17:45:52,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 17:45:52,149 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 17:45:52,151 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 17:45:52,152 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 17:45:52,153 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 17:45:52,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3fc326dcf/99081180f74243708b1a0be35d170131/FLAGedeb20753 [2020-09-04 17:45:52,786 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 17:45:52,787 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 17:45:52,800 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3fc326dcf/99081180f74243708b1a0be35d170131/FLAGedeb20753 [2020-09-04 17:45:53,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3fc326dcf/99081180f74243708b1a0be35d170131 [2020-09-04 17:45:53,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 17:45:53,122 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 17:45:53,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 17:45:53,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 17:45:53,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 17:45:53,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2362c63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53, skipping insertion in model container [2020-09-04 17:45:53,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 17:45:53,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 17:45:53,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:45:53,465 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 17:45:53,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 17:45:53,625 INFO L208 MainTranslator]: Completed translation [2020-09-04 17:45:53,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53 WrapperNode [2020-09-04 17:45:53,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 17:45:53,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 17:45:53,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 17:45:53,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 17:45:53,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... [2020-09-04 17:45:53,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 17:45:53,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 17:45:53,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 17:45:53,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 17:45:53,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 17:45:53,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 17:45:53,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 17:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 17:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2020-09-04 17:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2020-09-04 17:45:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 17:45:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 17:45:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-09-04 17:45:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 17:45:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2020-09-04 17:45:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2020-09-04 17:45:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2020-09-04 17:45:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-09-04 17:45:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2020-09-04 17:45:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2020-09-04 17:45:53,770 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2020-09-04 17:45:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2020-09-04 17:45:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2020-09-04 17:45:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2020-09-04 17:45:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-09-04 17:45:53,771 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2020-09-04 17:45:53,772 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2020-09-04 17:45:53,773 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 17:45:53,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 17:45:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 17:45:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 17:45:53,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 17:45:54,299 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 17:45:54,300 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-09-04 17:45:54,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:45:54 BoogieIcfgContainer [2020-09-04 17:45:54,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 17:45:54,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 17:45:54,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 17:45:54,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 17:45:54,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 05:45:53" (1/3) ... [2020-09-04 17:45:54,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbcc10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:45:54, skipping insertion in model container [2020-09-04 17:45:54,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 05:45:53" (2/3) ... [2020-09-04 17:45:54,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dbcc10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 05:45:54, skipping insertion in model container [2020-09-04 17:45:54,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 05:45:54" (3/3) ... [2020-09-04 17:45:54,325 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-09-04 17:45:54,335 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 17:45:54,346 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 17:45:54,369 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 17:45:54,394 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 17:45:54,394 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 17:45:54,394 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 17:45:54,394 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 17:45:54,394 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 17:45:54,394 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 17:45:54,395 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 17:45:54,395 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 17:45:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2020-09-04 17:45:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 17:45:54,432 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:54,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:54,434 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash 593727157, now seen corresponding path program 1 times [2020-09-04 17:45:54,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:54,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2048318080] [2020-09-04 17:45:54,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:54,528 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:54,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:54,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 17:45:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:54,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2048318080] [2020-09-04 17:45:54,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:54,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 17:45:54,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963416820] [2020-09-04 17:45:54,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 17:45:54,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 17:45:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:45:54,763 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2020-09-04 17:45:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:55,133 INFO L93 Difference]: Finished difference Result 254 states and 290 transitions. [2020-09-04 17:45:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 17:45:55,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-09-04 17:45:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:55,150 INFO L225 Difference]: With dead ends: 254 [2020-09-04 17:45:55,150 INFO L226 Difference]: Without dead ends: 111 [2020-09-04 17:45:55,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 17:45:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-09-04 17:45:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-09-04 17:45:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-04 17:45:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2020-09-04 17:45:55,237 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 51 [2020-09-04 17:45:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:55,237 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2020-09-04 17:45:55,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 17:45:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2020-09-04 17:45:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 17:45:55,241 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:55,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:55,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 17:45:55,242 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1128985001, now seen corresponding path program 1 times [2020-09-04 17:45:55,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:55,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370369576] [2020-09-04 17:45:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:55,246 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2020-09-04 17:45:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:55,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370369576] [2020-09-04 17:45:55,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:55,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 17:45:55,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317225811] [2020-09-04 17:45:55,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 17:45:55,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:55,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 17:45:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:45:55,349 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 4 states. [2020-09-04 17:45:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:55,616 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2020-09-04 17:45:55,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 17:45:55,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-09-04 17:45:55,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:55,619 INFO L225 Difference]: With dead ends: 212 [2020-09-04 17:45:55,620 INFO L226 Difference]: Without dead ends: 117 [2020-09-04 17:45:55,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:45:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-09-04 17:45:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2020-09-04 17:45:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-04 17:45:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2020-09-04 17:45:55,638 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 63 [2020-09-04 17:45:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:55,639 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2020-09-04 17:45:55,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 17:45:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2020-09-04 17:45:55,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-09-04 17:45:55,642 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:55,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:55,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 17:45:55,643 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:55,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1210839627, now seen corresponding path program 1 times [2020-09-04 17:45:55,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:55,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [981108133] [2020-09-04 17:45:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:55,680 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 17:45:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:55,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [981108133] [2020-09-04 17:45:55,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:55,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:45:55,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956508721] [2020-09-04 17:45:55,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:45:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:45:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:45:55,835 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 6 states. [2020-09-04 17:45:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:56,099 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2020-09-04 17:45:56,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 17:45:56,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2020-09-04 17:45:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:56,102 INFO L225 Difference]: With dead ends: 219 [2020-09-04 17:45:56,102 INFO L226 Difference]: Without dead ends: 124 [2020-09-04 17:45:56,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:45:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2020-09-04 17:45:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2020-09-04 17:45:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 17:45:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2020-09-04 17:45:56,120 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 70 [2020-09-04 17:45:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:56,120 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2020-09-04 17:45:56,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:45:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2020-09-04 17:45:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-09-04 17:45:56,124 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:56,124 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:56,124 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 17:45:56,125 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:56,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash -257337495, now seen corresponding path program 2 times [2020-09-04 17:45:56,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:56,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1333348091] [2020-09-04 17:45:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:56,135 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 17:45:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:56,319 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1333348091] [2020-09-04 17:45:56,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:56,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:45:56,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323687200] [2020-09-04 17:45:56,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:45:56,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:56,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:45:56,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:45:56,322 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 8 states. [2020-09-04 17:45:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:56,653 INFO L93 Difference]: Finished difference Result 226 states and 246 transitions. [2020-09-04 17:45:56,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 17:45:56,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2020-09-04 17:45:56,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:56,655 INFO L225 Difference]: With dead ends: 226 [2020-09-04 17:45:56,655 INFO L226 Difference]: Without dead ends: 131 [2020-09-04 17:45:56,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:45:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-09-04 17:45:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2020-09-04 17:45:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-09-04 17:45:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2020-09-04 17:45:56,671 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 77 [2020-09-04 17:45:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:56,671 INFO L479 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2020-09-04 17:45:56,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:45:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2020-09-04 17:45:56,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-09-04 17:45:56,673 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:56,674 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:56,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 17:45:56,674 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:56,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:56,675 INFO L82 PathProgramCache]: Analyzing trace with hash 883135627, now seen corresponding path program 3 times [2020-09-04 17:45:56,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:56,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1332679673] [2020-09-04 17:45:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:56,681 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-09-04 17:45:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:56,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1332679673] [2020-09-04 17:45:56,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:56,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:45:56,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63072102] [2020-09-04 17:45:56,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:45:56,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:45:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:45:56,858 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 10 states. [2020-09-04 17:45:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:57,190 INFO L93 Difference]: Finished difference Result 233 states and 253 transitions. [2020-09-04 17:45:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 17:45:57,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2020-09-04 17:45:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:57,194 INFO L225 Difference]: With dead ends: 233 [2020-09-04 17:45:57,194 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 17:45:57,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:45:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 17:45:57,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2020-09-04 17:45:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-09-04 17:45:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2020-09-04 17:45:57,228 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 84 [2020-09-04 17:45:57,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:57,228 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2020-09-04 17:45:57,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:45:57,228 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2020-09-04 17:45:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-04 17:45:57,234 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:57,234 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:57,235 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 17:45:57,235 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash -687690455, now seen corresponding path program 4 times [2020-09-04 17:45:57,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:57,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112192261] [2020-09-04 17:45:57,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:57,249 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:57,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:57,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-09-04 17:45:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:57,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112192261] [2020-09-04 17:45:57,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:57,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 17:45:57,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694450194] [2020-09-04 17:45:57,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 17:45:57,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:57,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 17:45:57,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:45:57,476 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 12 states. [2020-09-04 17:45:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:57,820 INFO L93 Difference]: Finished difference Result 240 states and 260 transitions. [2020-09-04 17:45:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:45:57,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2020-09-04 17:45:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:57,822 INFO L225 Difference]: With dead ends: 240 [2020-09-04 17:45:57,822 INFO L226 Difference]: Without dead ends: 145 [2020-09-04 17:45:57,823 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-09-04 17:45:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-04 17:45:57,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2020-09-04 17:45:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-04 17:45:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2020-09-04 17:45:57,847 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 91 [2020-09-04 17:45:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:57,847 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2020-09-04 17:45:57,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 17:45:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2020-09-04 17:45:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-09-04 17:45:57,849 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:57,850 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:57,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 17:45:57,850 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:57,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash -722319669, now seen corresponding path program 5 times [2020-09-04 17:45:57,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:57,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [632584797] [2020-09-04 17:45:57,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:57,863 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2020-09-04 17:45:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:58,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [632584797] [2020-09-04 17:45:58,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:58,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 17:45:58,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720356241] [2020-09-04 17:45:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 17:45:58,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 17:45:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-09-04 17:45:58,031 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 14 states. [2020-09-04 17:45:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:58,530 INFO L93 Difference]: Finished difference Result 247 states and 267 transitions. [2020-09-04 17:45:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 17:45:58,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2020-09-04 17:45:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:58,533 INFO L225 Difference]: With dead ends: 247 [2020-09-04 17:45:58,533 INFO L226 Difference]: Without dead ends: 152 [2020-09-04 17:45:58,535 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2020-09-04 17:45:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-09-04 17:45:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2020-09-04 17:45:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-09-04 17:45:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2020-09-04 17:45:58,555 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 98 [2020-09-04 17:45:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:58,556 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2020-09-04 17:45:58,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 17:45:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2020-09-04 17:45:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-09-04 17:45:58,558 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:58,558 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:58,558 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 17:45:58,558 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:58,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1819472617, now seen corresponding path program 6 times [2020-09-04 17:45:58,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:58,560 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [857311407] [2020-09-04 17:45:58,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:58,570 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-09-04 17:45:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:58,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [857311407] [2020-09-04 17:45:58,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:58,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 17:45:58,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36804073] [2020-09-04 17:45:58,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 17:45:58,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:58,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 17:45:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:45:58,830 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 16 states. [2020-09-04 17:45:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:45:59,432 INFO L93 Difference]: Finished difference Result 254 states and 274 transitions. [2020-09-04 17:45:59,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 17:45:59,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-09-04 17:45:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:45:59,434 INFO L225 Difference]: With dead ends: 254 [2020-09-04 17:45:59,434 INFO L226 Difference]: Without dead ends: 159 [2020-09-04 17:45:59,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2020-09-04 17:45:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-09-04 17:45:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2020-09-04 17:45:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2020-09-04 17:45:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2020-09-04 17:45:59,457 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 105 [2020-09-04 17:45:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:45:59,458 INFO L479 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2020-09-04 17:45:59,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 17:45:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2020-09-04 17:45:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-09-04 17:45:59,465 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:45:59,465 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:45:59,469 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 17:45:59,469 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:45:59,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:45:59,470 INFO L82 PathProgramCache]: Analyzing trace with hash -612628213, now seen corresponding path program 7 times [2020-09-04 17:45:59,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:45:59,470 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1990714443] [2020-09-04 17:45:59,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:45:59,480 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:45:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:59,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:45:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:59,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-09-04 17:45:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:45:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:45:59,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1990714443] [2020-09-04 17:45:59,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:45:59,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 17:45:59,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240469099] [2020-09-04 17:45:59,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 17:45:59,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:45:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 17:45:59,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-09-04 17:45:59,781 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 18 states. [2020-09-04 17:46:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:00,237 INFO L93 Difference]: Finished difference Result 256 states and 276 transitions. [2020-09-04 17:46:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 17:46:00,238 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 112 [2020-09-04 17:46:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:00,239 INFO L225 Difference]: With dead ends: 256 [2020-09-04 17:46:00,240 INFO L226 Difference]: Without dead ends: 161 [2020-09-04 17:46:00,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-09-04 17:46:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-09-04 17:46:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-09-04 17:46:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-09-04 17:46:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-09-04 17:46:00,250 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 112 [2020-09-04 17:46:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:00,251 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-09-04 17:46:00,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 17:46:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-09-04 17:46:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-09-04 17:46:00,254 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:00,254 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:00,254 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 17:46:00,255 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:00,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:00,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1175857321, now seen corresponding path program 8 times [2020-09-04 17:46:00,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:00,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1992396315] [2020-09-04 17:46:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:00,266 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 17:46:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:00,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1992396315] [2020-09-04 17:46:00,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:00,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 17:46:00,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287905669] [2020-09-04 17:46:00,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 17:46:00,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 17:46:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:00,363 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 4 states. [2020-09-04 17:46:00,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:00,543 INFO L93 Difference]: Finished difference Result 249 states and 269 transitions. [2020-09-04 17:46:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 17:46:00,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2020-09-04 17:46:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:00,546 INFO L225 Difference]: With dead ends: 249 [2020-09-04 17:46:00,546 INFO L226 Difference]: Without dead ends: 162 [2020-09-04 17:46:00,548 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-09-04 17:46:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-09-04 17:46:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-09-04 17:46:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2020-09-04 17:46:00,561 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 119 [2020-09-04 17:46:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:00,574 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2020-09-04 17:46:00,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 17:46:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2020-09-04 17:46:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 17:46:00,575 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:00,576 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:00,576 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 17:46:00,576 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1395739916, now seen corresponding path program 1 times [2020-09-04 17:46:00,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:00,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2070126252] [2020-09-04 17:46:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:00,585 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-09-04 17:46:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:00,803 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2070126252] [2020-09-04 17:46:00,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:00,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:46:00,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891287323] [2020-09-04 17:46:00,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:46:00,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:00,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:46:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:46:00,807 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 8 states. [2020-09-04 17:46:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:01,245 INFO L93 Difference]: Finished difference Result 427 states and 473 transitions. [2020-09-04 17:46:01,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 17:46:01,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2020-09-04 17:46:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:01,253 INFO L225 Difference]: With dead ends: 427 [2020-09-04 17:46:01,253 INFO L226 Difference]: Without dead ends: 336 [2020-09-04 17:46:01,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-09-04 17:46:01,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2020-09-04 17:46:01,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 199. [2020-09-04 17:46:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-09-04 17:46:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2020-09-04 17:46:01,277 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 121 [2020-09-04 17:46:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:01,277 INFO L479 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2020-09-04 17:46:01,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:46:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2020-09-04 17:46:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 17:46:01,279 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:01,279 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:01,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 17:46:01,280 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:01,280 INFO L82 PathProgramCache]: Analyzing trace with hash 454539305, now seen corresponding path program 1 times [2020-09-04 17:46:01,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:01,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854227851] [2020-09-04 17:46:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:01,285 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 17:46:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:01,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854227851] [2020-09-04 17:46:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:01,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 17:46:01,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536873401] [2020-09-04 17:46:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 17:46:01,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:01,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 17:46:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:01,362 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 4 states. [2020-09-04 17:46:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:01,585 INFO L93 Difference]: Finished difference Result 289 states and 317 transitions. [2020-09-04 17:46:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 17:46:01,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2020-09-04 17:46:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:01,587 INFO L225 Difference]: With dead ends: 289 [2020-09-04 17:46:01,588 INFO L226 Difference]: Without dead ends: 200 [2020-09-04 17:46:01,588 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-09-04 17:46:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-09-04 17:46:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-04 17:46:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2020-09-04 17:46:01,602 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 124 [2020-09-04 17:46:01,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:01,603 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2020-09-04 17:46:01,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 17:46:01,603 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2020-09-04 17:46:01,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2020-09-04 17:46:01,605 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:01,606 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:01,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 17:46:01,606 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1684557317, now seen corresponding path program 1 times [2020-09-04 17:46:01,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:01,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820646006] [2020-09-04 17:46:01,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:01,617 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-09-04 17:46:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:01,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820646006] [2020-09-04 17:46:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:01,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:46:01,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997823103] [2020-09-04 17:46:01,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:46:01,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:46:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:46:01,862 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand 10 states. [2020-09-04 17:46:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:02,592 INFO L93 Difference]: Finished difference Result 499 states and 555 transitions. [2020-09-04 17:46:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 17:46:02,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 124 [2020-09-04 17:46:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:02,595 INFO L225 Difference]: With dead ends: 499 [2020-09-04 17:46:02,596 INFO L226 Difference]: Without dead ends: 406 [2020-09-04 17:46:02,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2020-09-04 17:46:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-09-04 17:46:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 204. [2020-09-04 17:46:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-09-04 17:46:02,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 221 transitions. [2020-09-04 17:46:02,613 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 221 transitions. Word has length 124 [2020-09-04 17:46:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:02,614 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 221 transitions. [2020-09-04 17:46:02,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:46:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 221 transitions. [2020-09-04 17:46:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 17:46:02,615 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:02,616 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:02,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 17:46:02,616 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1120204730, now seen corresponding path program 1 times [2020-09-04 17:46:02,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:02,622 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [477256168] [2020-09-04 17:46:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:02,626 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:02,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:02,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-09-04 17:46:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:02,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [477256168] [2020-09-04 17:46:02,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:02,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 17:46:02,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022681367] [2020-09-04 17:46:02,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 17:46:02,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 17:46:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 17:46:02,809 INFO L87 Difference]: Start difference. First operand 204 states and 221 transitions. Second operand 10 states. [2020-09-04 17:46:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:03,358 INFO L93 Difference]: Finished difference Result 450 states and 497 transitions. [2020-09-04 17:46:03,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 17:46:03,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-09-04 17:46:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:03,361 INFO L225 Difference]: With dead ends: 450 [2020-09-04 17:46:03,361 INFO L226 Difference]: Without dead ends: 346 [2020-09-04 17:46:03,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-09-04 17:46:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-09-04 17:46:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 214. [2020-09-04 17:46:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-09-04 17:46:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 233 transitions. [2020-09-04 17:46:03,381 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 233 transitions. Word has length 126 [2020-09-04 17:46:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:03,381 INFO L479 AbstractCegarLoop]: Abstraction has 214 states and 233 transitions. [2020-09-04 17:46:03,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 17:46:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 233 transitions. [2020-09-04 17:46:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-09-04 17:46:03,383 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:03,383 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:03,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 17:46:03,384 INFO L427 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:03,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2135603949, now seen corresponding path program 1 times [2020-09-04 17:46:03,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:03,385 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081949722] [2020-09-04 17:46:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:03,390 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:03,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:03,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-09-04 17:46:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:03,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081949722] [2020-09-04 17:46:03,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:03,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 17:46:03,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275616235] [2020-09-04 17:46:03,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 17:46:03,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:03,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 17:46:03,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 17:46:03,568 INFO L87 Difference]: Start difference. First operand 214 states and 233 transitions. Second operand 12 states. [2020-09-04 17:46:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:04,319 INFO L93 Difference]: Finished difference Result 488 states and 541 transitions. [2020-09-04 17:46:04,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 17:46:04,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2020-09-04 17:46:04,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:04,322 INFO L225 Difference]: With dead ends: 488 [2020-09-04 17:46:04,322 INFO L226 Difference]: Without dead ends: 384 [2020-09-04 17:46:04,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-09-04 17:46:04,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2020-09-04 17:46:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 195. [2020-09-04 17:46:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-09-04 17:46:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 211 transitions. [2020-09-04 17:46:04,344 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 211 transitions. Word has length 129 [2020-09-04 17:46:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:04,345 INFO L479 AbstractCegarLoop]: Abstraction has 195 states and 211 transitions. [2020-09-04 17:46:04,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 17:46:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 211 transitions. [2020-09-04 17:46:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-04 17:46:04,347 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:04,347 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:04,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 17:46:04,347 INFO L427 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -374659365, now seen corresponding path program 1 times [2020-09-04 17:46:04,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:04,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1140295613] [2020-09-04 17:46:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:04,361 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:04,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:04,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 17:46:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:04,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1140295613] [2020-09-04 17:46:04,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:04,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 17:46:04,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022237377] [2020-09-04 17:46:04,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 17:46:04,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 17:46:04,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:46:04,522 INFO L87 Difference]: Start difference. First operand 195 states and 211 transitions. Second operand 8 states. [2020-09-04 17:46:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:05,029 INFO L93 Difference]: Finished difference Result 454 states and 505 transitions. [2020-09-04 17:46:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 17:46:05,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 131 [2020-09-04 17:46:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:05,034 INFO L225 Difference]: With dead ends: 454 [2020-09-04 17:46:05,034 INFO L226 Difference]: Without dead ends: 361 [2020-09-04 17:46:05,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-09-04 17:46:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2020-09-04 17:46:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 258. [2020-09-04 17:46:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2020-09-04 17:46:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 284 transitions. [2020-09-04 17:46:05,054 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 284 transitions. Word has length 131 [2020-09-04 17:46:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:05,055 INFO L479 AbstractCegarLoop]: Abstraction has 258 states and 284 transitions. [2020-09-04 17:46:05,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 17:46:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 284 transitions. [2020-09-04 17:46:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-09-04 17:46:05,057 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:05,057 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:05,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 17:46:05,057 INFO L427 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1298582752, now seen corresponding path program 1 times [2020-09-04 17:46:05,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:05,059 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49449110] [2020-09-04 17:46:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:05,062 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-09-04 17:46:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:05,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49449110] [2020-09-04 17:46:05,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:05,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-04 17:46:05,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999272413] [2020-09-04 17:46:05,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 17:46:05,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:05,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 17:46:05,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:05,137 INFO L87 Difference]: Start difference. First operand 258 states and 284 transitions. Second operand 4 states. [2020-09-04 17:46:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:05,322 INFO L93 Difference]: Finished difference Result 375 states and 415 transitions. [2020-09-04 17:46:05,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 17:46:05,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2020-09-04 17:46:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:05,324 INFO L225 Difference]: With dead ends: 375 [2020-09-04 17:46:05,325 INFO L226 Difference]: Without dead ends: 259 [2020-09-04 17:46:05,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 17:46:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-09-04 17:46:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2020-09-04 17:46:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2020-09-04 17:46:05,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2020-09-04 17:46:05,347 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 131 [2020-09-04 17:46:05,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:05,347 INFO L479 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2020-09-04 17:46:05,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 17:46:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2020-09-04 17:46:05,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-09-04 17:46:05,349 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 17:46:05,349 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 17:46:05,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 17:46:05,350 INFO L427 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 17:46:05,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 17:46:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -729212679, now seen corresponding path program 1 times [2020-09-04 17:46:05,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 17:46:05,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989699825] [2020-09-04 17:46:05,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 17:46:05,361 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 17:46:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 17:46:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-09-04 17:46:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 17:46:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 17:46:05,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989699825] [2020-09-04 17:46:05,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 17:46:05,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 17:46:05,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542912481] [2020-09-04 17:46:05,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 17:46:05,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 17:46:05,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 17:46:05,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 17:46:05,477 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand 6 states. [2020-09-04 17:46:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 17:46:05,719 INFO L93 Difference]: Finished difference Result 259 states and 283 transitions. [2020-09-04 17:46:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 17:46:05,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2020-09-04 17:46:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 17:46:05,720 INFO L225 Difference]: With dead ends: 259 [2020-09-04 17:46:05,720 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 17:46:05,721 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 17:46:05,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 17:46:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 17:46:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 17:46:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 17:46:05,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2020-09-04 17:46:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 17:46:05,723 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 17:46:05,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 17:46:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 17:46:05,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 17:46:05,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 17:46:05,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 17:46:07,047 INFO L271 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,047 INFO L271 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,047 INFO L271 CegarLoopResult]: At program point L60-2(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,048 INFO L271 CegarLoopResult]: At program point L60-4(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,048 INFO L271 CegarLoopResult]: At program point L60-5(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L60-6(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L60-7(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L60-8(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L60-9(line 60) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L52-1(lines 52 73) the Hoare annotation is: true [2020-09-04 17:46:07,049 INFO L264 CegarLoopResult]: At program point L60-11(line 60) the Hoare annotation is: (or (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (not |parse_expression_list_#t~short17|)) [2020-09-04 17:46:07,049 INFO L271 CegarLoopResult]: At program point L52-3(lines 52 73) the Hoare annotation is: true [2020-09-04 17:46:07,050 INFO L264 CegarLoopResult]: At program point L60-12(line 60) the Hoare annotation is: (or (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (not |parse_expression_list_#t~short17|)) [2020-09-04 17:46:07,050 INFO L271 CegarLoopResult]: At program point L52-4(lines 52 73) the Hoare annotation is: true [2020-09-04 17:46:07,050 INFO L271 CegarLoopResult]: At program point L60-13(lines 54 72) the Hoare annotation is: true [2020-09-04 17:46:07,050 INFO L271 CegarLoopResult]: At program point L69(line 69) the Hoare annotation is: true [2020-09-04 17:46:07,050 INFO L271 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: true [2020-09-04 17:46:07,050 INFO L271 CegarLoopResult]: At program point L53-1(line 53) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L62(lines 62 64) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L54-1(line 54) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L54-2(lines 54 72) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L54-3(lines 54 72) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: true [2020-09-04 17:46:07,051 INFO L271 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: true [2020-09-04 17:46:07,052 INFO L271 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,052 INFO L271 CegarLoopResult]: At program point L56-2(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,052 INFO L271 CegarLoopResult]: At program point L56-4(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,052 INFO L271 CegarLoopResult]: At program point L56-5(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,053 INFO L271 CegarLoopResult]: At program point L56-6(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,053 INFO L271 CegarLoopResult]: At program point L56-7(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,053 INFO L271 CegarLoopResult]: At program point L56-8(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,053 INFO L271 CegarLoopResult]: At program point L56-9(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,053 INFO L264 CegarLoopResult]: At program point L56-11(line 56) the Hoare annotation is: |parse_expression_list_#t~short7| [2020-09-04 17:46:07,054 INFO L264 CegarLoopResult]: At program point L56-12(line 56) the Hoare annotation is: |parse_expression_list_#t~short7| [2020-09-04 17:46:07,054 INFO L264 CegarLoopResult]: At program point L56-13(line 56) the Hoare annotation is: |parse_expression_list_#t~short7| [2020-09-04 17:46:07,054 INFO L271 CegarLoopResult]: At program point L56-14(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,054 INFO L271 CegarLoopResult]: At program point L56-15(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,054 INFO L271 CegarLoopResult]: At program point L73(lines 52 73) the Hoare annotation is: true [2020-09-04 17:46:07,054 INFO L271 CegarLoopResult]: At program point L56-16(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,054 INFO L271 CegarLoopResult]: At program point L73-1(line 73) the Hoare annotation is: true [2020-09-04 17:46:07,055 INFO L271 CegarLoopResult]: At program point L56-17(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,055 INFO L271 CegarLoopResult]: At program point L73-2(line 73) the Hoare annotation is: true [2020-09-04 17:46:07,055 INFO L271 CegarLoopResult]: At program point L56-18(line 56) the Hoare annotation is: true [2020-09-04 17:46:07,055 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-09-04 17:46:07,055 INFO L264 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-09-04 17:46:07,055 INFO L271 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,055 INFO L271 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,056 INFO L271 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,056 INFO L271 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,056 INFO L271 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,056 INFO L271 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,056 INFO L271 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: true [2020-09-04 17:46:07,057 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 17:46:07,057 INFO L264 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (= |old(#valid)| |#valid|) (= parse_expression_list_~start~0 0)) [2020-09-04 17:46:07,057 INFO L264 CegarLoopResult]: At program point L49-2(line 49) the Hoare annotation is: (and (<= (+ parse_expression_list_~i~0 1) 0) (= |old(#valid)| |#valid|) (= parse_expression_list_~start~0 0)) [2020-09-04 17:46:07,057 INFO L264 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-09-04 17:46:07,057 INFO L264 CegarLoopResult]: At program point L66-1(line 66) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-09-04 17:46:07,057 INFO L271 CegarLoopResult]: At program point parse_expression_listFINAL(lines 47 75) the Hoare annotation is: true [2020-09-04 17:46:07,058 INFO L264 CegarLoopResult]: At program point parse_expression_listENTRY(lines 47 75) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 17:46:07,058 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ parse_expression_list_~i~0 1) 0) (<= (+ parse_expression_list_~j~0 1) 0) (= |old(#valid)| |#valid|) (= parse_expression_list_~start~0 0)) [2020-09-04 17:46:07,058 INFO L264 CegarLoopResult]: At program point L50-1(lines 48 75) the Hoare annotation is: (and (<= (+ parse_expression_list_~i~0 1) 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) [2020-09-04 17:46:07,058 INFO L271 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,058 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,060 INFO L271 CegarLoopResult]: At program point L50-4(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,060 INFO L271 CegarLoopResult]: At program point L50-5(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,060 INFO L271 CegarLoopResult]: At program point L50-6(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,060 INFO L271 CegarLoopResult]: At program point L50-7(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,061 INFO L271 CegarLoopResult]: At program point L50-8(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,061 INFO L271 CegarLoopResult]: At program point L50-9(line 50) the Hoare annotation is: true [2020-09-04 17:46:07,061 INFO L264 CegarLoopResult]: At program point L67(lines 61 70) the Hoare annotation is: (< parse_expression_list_~j~0 (+ parse_expression_list_~start~0 1)) [2020-09-04 17:46:07,061 INFO L271 CegarLoopResult]: At program point parse_expression_listEXIT(lines 47 75) the Hoare annotation is: true [2020-09-04 17:46:07,061 INFO L271 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-3(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-4(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-6(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-7(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,062 INFO L271 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: true [2020-09-04 17:46:07,062 INFO L264 CegarLoopResult]: At program point L59-8(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,063 INFO L271 CegarLoopResult]: At program point L59-10(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,063 INFO L264 CegarLoopResult]: At program point L59-11(line 59) the Hoare annotation is: (or (not |parse_expression_list_#t~short14|) (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (and (<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0))) [2020-09-04 17:46:07,063 INFO L264 CegarLoopResult]: At program point L59-12(line 59) the Hoare annotation is: (or (not |parse_expression_list_#t~short14|) (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (and (<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0))) [2020-09-04 17:46:07,063 INFO L264 CegarLoopResult]: At program point L59-13(line 59) the Hoare annotation is: (or (not |parse_expression_list_#t~short14|) (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (and (<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0))) [2020-09-04 17:46:07,063 INFO L264 CegarLoopResult]: At program point L59-14(line 59) the Hoare annotation is: (or (not |parse_expression_list_#t~short14|) (and (<= parse_expression_list_~i~0 0) (<= (+ parse_expression_list_~j~0 1) 0) (= parse_expression_list_~start~0 0)) (and (<= (+ parse_expression_list_~i~0 1) parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 2) parse_expression_list_~start~0))) [2020-09-04 17:46:07,063 INFO L264 CegarLoopResult]: At program point L59-16(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,064 INFO L264 CegarLoopResult]: At program point L59-17(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,065 INFO L264 CegarLoopResult]: At program point L59-18(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,065 INFO L264 CegarLoopResult]: At program point L59-19(line 59) the Hoare annotation is: (or (<= (+ parse_expression_list_~j~0 1) parse_expression_list_~start~0) |parse_expression_list_#t~short14|) [2020-09-04 17:46:07,065 INFO L271 CegarLoopResult]: At program point L59-20(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L59-21(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L59-22(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L59-23(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L59-24(line 59) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,066 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point r_strncpyFINAL(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,067 INFO L271 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point r_strncpyEXIT(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point L31-3(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point L31-4(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point r_strncpyENTRY(line 31) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,068 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 17:46:07,069 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 76 85) the Hoare annotation is: true [2020-09-04 17:46:07,069 INFO L271 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: true [2020-09-04 17:46:07,069 INFO L271 CegarLoopResult]: At program point L83-1(line 83) the Hoare annotation is: true [2020-09-04 17:46:07,069 INFO L264 CegarLoopResult]: At program point L79-2(lines 79 81) the Hoare annotation is: (<= main_~i~1 7) [2020-09-04 17:46:07,069 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 76 85) the Hoare annotation is: true [2020-09-04 17:46:07,069 INFO L264 CegarLoopResult]: At program point L79-3(line 79) the Hoare annotation is: (<= main_~i~1 7) [2020-09-04 17:46:07,069 INFO L271 CegarLoopResult]: At program point L79-4(line 79) the Hoare annotation is: true [2020-09-04 17:46:07,070 INFO L271 CegarLoopResult]: At program point L79-5(lines 79 81) the Hoare annotation is: true [2020-09-04 17:46:07,070 INFO L271 CegarLoopResult]: At program point L79-6(lines 79 81) the Hoare annotation is: true [2020-09-04 17:46:07,071 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 76 85) the Hoare annotation is: (= |old(#valid)| |#valid|) [2020-09-04 17:46:07,071 INFO L271 CegarLoopResult]: At program point L84(line 84) the Hoare annotation is: true [2020-09-04 17:46:07,072 INFO L271 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: true [2020-09-04 17:46:07,072 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (<= main_~i~1 7) [2020-09-04 17:46:07,072 INFO L264 CegarLoopResult]: At program point L80-1(line 80) the Hoare annotation is: (<= main_~i~1 7) [2020-09-04 17:46:07,072 INFO L271 CegarLoopResult]: At program point L78(line 78) the Hoare annotation is: true [2020-09-04 17:46:07,072 INFO L264 CegarLoopResult]: At program point L80-2(line 80) the Hoare annotation is: (<= main_~i~1 7) [2020-09-04 17:46:07,073 INFO L271 CegarLoopResult]: At program point L78-1(line 78) the Hoare annotation is: true [2020-09-04 17:46:07,073 INFO L271 CegarLoopResult]: At program point L78-2(line 78) the Hoare annotation is: true [2020-09-04 17:46:07,073 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2020-09-04 17:46:07,073 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 3 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:46:07,074 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:46:07,074 INFO L264 CegarLoopResult]: At program point L4(lines 4 6) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:46:07,074 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 17:46:07,074 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 17:46:07,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 05:46:07 BoogieIcfgContainer [2020-09-04 17:46:07,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 17:46:07,109 INFO L168 Benchmark]: Toolchain (without parser) took 13984.73 ms. Allocated memory was 144.7 MB in the beginning and 375.4 MB in the end (delta: 230.7 MB). Free memory was 100.9 MB in the beginning and 161.0 MB in the end (delta: -60.2 MB). Peak memory consumption was 170.5 MB. Max. memory is 7.1 GB. [2020-09-04 17:46:07,110 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 17:46:07,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.56 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 178.4 MB in the end (delta: -77.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-09-04 17:46:07,117 INFO L168 Benchmark]: Boogie Preprocessor took 59.80 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-09-04 17:46:07,119 INFO L168 Benchmark]: RCFGBuilder took 624.78 ms. Allocated memory is still 201.3 MB. Free memory was 175.8 MB in the beginning and 140.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2020-09-04 17:46:07,120 INFO L168 Benchmark]: TraceAbstraction took 12791.40 ms. Allocated memory was 201.3 MB in the beginning and 375.4 MB in the end (delta: 174.1 MB). Free memory was 140.3 MB in the beginning and 161.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. [2020-09-04 17:46:07,125 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 498.56 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 178.4 MB in the end (delta: -77.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.80 ms. Allocated memory is still 201.3 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 624.78 ms. Allocated memory is still 201.3 MB. Free memory was 175.8 MB in the beginning and 140.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12791.40 ms. Allocated memory was 201.3 MB in the beginning and 375.4 MB in the end (delta: 174.1 MB). Free memory was 140.3 MB in the beginning and 161.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 47]: Procedure Contract for parse_expression_list Derived contract for procedure parse_expression_list: 1 - ProcedureContractResult [Line: 31]: Procedure Contract for r_strncpy Derived contract for procedure r_strncpy: 1 - ProcedureContractResult [Line: 76]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 3]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 11.3s, OverallIterations: 18, TraceHistogramMax: 8, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2217 SDtfs, 2157 SDslu, 6884 SDs, 0 SdLazy, 4320 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 798 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 135 LocationsWithAnnotation, 1219 PreInvPairs, 1604 NumberOfFragments, 439 HoareAnnotationTreeSize, 1219 FomulaSimplifications, 12191 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 135 FomulaSimplificationsInter, 318 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...