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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:33:00,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:33:00,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:33:00,622 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:33:00,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:33:00,624 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:33:00,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:33:00,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:33:00,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:33:00,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:33:00,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:33:00,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:33:00,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:33:00,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:33:00,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:33:00,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:33:00,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:33:00,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:33:00,638 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:33:00,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:33:00,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:33:00,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:33:00,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:33:00,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:33:00,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:33:00,651 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:33:00,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:33:00,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:33:00,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:33:00,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:33:00,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:33:00,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:33:00,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:33:00,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:33:00,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:33:00,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:33:00,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:33:00,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:33:00,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:33:00,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:33:00,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:33:00,667 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:33:00,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:33:00,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:33:00,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:33:00,700 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:33:00,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:33:00,702 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:33:00,702 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:33:00,703 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:33:00,703 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:33:00,703 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:33:00,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:33:00,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:33:00,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:33:00,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:33:00,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:33:00,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:33:00,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:33:00,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:33:00,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:33:00,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:33:00,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:33:00,708 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:33:00,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:33:00,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:33:00,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:33:00,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:33:00,709 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:33:00,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:33:00,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:33:00,710 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:33:00,765 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:33:00,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:33:00,782 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:33:00,783 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:33:00,783 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:33:00,784 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:00,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937c13ab/4ab924ce6e11481c82438fc8f0abff32/FLAGa860933e6 [2019-09-10 06:33:01,586 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:33:01,587 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:01,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937c13ab/4ab924ce6e11481c82438fc8f0abff32/FLAGa860933e6 [2019-09-10 06:33:01,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7937c13ab/4ab924ce6e11481c82438fc8f0abff32 [2019-09-10 06:33:01,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:33:01,688 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:33:01,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:01,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:33:01,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:33:01,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:01" (1/1) ... [2019-09-10 06:33:01,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7669911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:01, skipping insertion in model container [2019-09-10 06:33:01,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:33:01" (1/1) ... [2019-09-10 06:33:01,707 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:33:01,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:33:03,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:03,137 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:33:04,183 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:33:04,232 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:33:04,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04 WrapperNode [2019-09-10 06:33:04,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:33:04,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:33:04,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:33:04,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:33:04,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... [2019-09-10 06:33:04,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:33:04,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:33:04,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:33:04,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:33:04,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:33:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:33:04,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:33:04,544 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:33:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:33:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:33:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:33:04,544 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:33:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:33:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:33:04,545 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:33:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:33:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:33:04,546 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:33:04,547 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:33:04,548 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 06:33:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:33:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:33:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:33:04,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:33:04,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:33:08,822 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:33:08,823 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:33:08,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:08 BoogieIcfgContainer [2019-09-10 06:33:08,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:33:08,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:33:08,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:33:08,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:33:08,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:33:01" (1/3) ... [2019-09-10 06:33:08,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a5e18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:08, skipping insertion in model container [2019-09-10 06:33:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:33:04" (2/3) ... [2019-09-10 06:33:08,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a5e18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:33:08, skipping insertion in model container [2019-09-10 06:33:08,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:33:08" (3/3) ... [2019-09-10 06:33:08,840 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 06:33:08,851 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:33:08,877 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:33:08,896 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:33:08,928 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:33:08,928 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:33:08,928 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:33:08,928 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:33:08,928 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:33:08,928 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:33:08,928 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:33:08,929 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:33:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states. [2019-09-10 06:33:09,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-09-10 06:33:09,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:09,022 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:09,024 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1613772581, now seen corresponding path program 1 times [2019-09-10 06:33:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:09,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:09,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:09,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:10,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:10,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:10,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:10,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:10,149 INFO L87 Difference]: Start difference. First operand 1439 states. Second operand 3 states. [2019-09-10 06:33:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:10,436 INFO L93 Difference]: Finished difference Result 2017 states and 3548 transitions. [2019-09-10 06:33:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:10,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 360 [2019-09-10 06:33:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:10,479 INFO L225 Difference]: With dead ends: 2017 [2019-09-10 06:33:10,479 INFO L226 Difference]: Without dead ends: 2009 [2019-09-10 06:33:10,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2019-09-10 06:33:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2007. [2019-09-10 06:33:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-09-10 06:33:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3353 transitions. [2019-09-10 06:33:10,623 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3353 transitions. Word has length 360 [2019-09-10 06:33:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:10,629 INFO L475 AbstractCegarLoop]: Abstraction has 2007 states and 3353 transitions. [2019-09-10 06:33:10,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3353 transitions. [2019-09-10 06:33:10,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-09-10 06:33:10,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:10,646 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:10,646 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 476465467, now seen corresponding path program 1 times [2019-09-10 06:33:10,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:10,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:10,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:10,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:11,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:11,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:11,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:11,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:11,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:11,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:11,024 INFO L87 Difference]: Start difference. First operand 2007 states and 3353 transitions. Second operand 3 states. [2019-09-10 06:33:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:11,179 INFO L93 Difference]: Finished difference Result 3001 states and 4969 transitions. [2019-09-10 06:33:11,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:11,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-09-10 06:33:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:11,207 INFO L225 Difference]: With dead ends: 3001 [2019-09-10 06:33:11,208 INFO L226 Difference]: Without dead ends: 3001 [2019-09-10 06:33:11,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2019-09-10 06:33:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2999. [2019-09-10 06:33:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-09-10 06:33:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 4968 transitions. [2019-09-10 06:33:11,323 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 4968 transitions. Word has length 362 [2019-09-10 06:33:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:11,326 INFO L475 AbstractCegarLoop]: Abstraction has 2999 states and 4968 transitions. [2019-09-10 06:33:11,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 4968 transitions. [2019-09-10 06:33:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-09-10 06:33:11,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:11,346 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:11,347 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1279553581, now seen corresponding path program 1 times [2019-09-10 06:33:11,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:11,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:11,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:11,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:11,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:11,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:11,942 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:11,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:11,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:11,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:11,944 INFO L87 Difference]: Start difference. First operand 2999 states and 4968 transitions. Second operand 3 states. [2019-09-10 06:33:12,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:12,094 INFO L93 Difference]: Finished difference Result 4672 states and 7675 transitions. [2019-09-10 06:33:12,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:12,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2019-09-10 06:33:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:12,135 INFO L225 Difference]: With dead ends: 4672 [2019-09-10 06:33:12,135 INFO L226 Difference]: Without dead ends: 4672 [2019-09-10 06:33:12,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4672 states. [2019-09-10 06:33:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4672 to 4670. [2019-09-10 06:33:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-09-10 06:33:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 7674 transitions. [2019-09-10 06:33:12,292 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 7674 transitions. Word has length 364 [2019-09-10 06:33:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:12,292 INFO L475 AbstractCegarLoop]: Abstraction has 4670 states and 7674 transitions. [2019-09-10 06:33:12,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 7674 transitions. [2019-09-10 06:33:12,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-10 06:33:12,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:12,308 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:12,308 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2054229851, now seen corresponding path program 1 times [2019-09-10 06:33:12,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:12,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:12,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:12,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:12,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:12,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:12,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:12,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:12,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:12,658 INFO L87 Difference]: Start difference. First operand 4670 states and 7674 transitions. Second operand 3 states. [2019-09-10 06:33:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:12,791 INFO L93 Difference]: Finished difference Result 7379 states and 12021 transitions. [2019-09-10 06:33:12,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:12,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 366 [2019-09-10 06:33:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:12,828 INFO L225 Difference]: With dead ends: 7379 [2019-09-10 06:33:12,828 INFO L226 Difference]: Without dead ends: 7379 [2019-09-10 06:33:12,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7379 states. [2019-09-10 06:33:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7379 to 7377. [2019-09-10 06:33:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7377 states. [2019-09-10 06:33:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7377 states to 7377 states and 12020 transitions. [2019-09-10 06:33:13,088 INFO L78 Accepts]: Start accepts. Automaton has 7377 states and 12020 transitions. Word has length 366 [2019-09-10 06:33:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:13,090 INFO L475 AbstractCegarLoop]: Abstraction has 7377 states and 12020 transitions. [2019-09-10 06:33:13,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 7377 states and 12020 transitions. [2019-09-10 06:33:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-10 06:33:13,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:13,112 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:13,112 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash -660941057, now seen corresponding path program 1 times [2019-09-10 06:33:13,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:13,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:13,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:13,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:13,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:13,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:13,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:13,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:13,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:13,522 INFO L87 Difference]: Start difference. First operand 7377 states and 12020 transitions. Second operand 3 states. [2019-09-10 06:33:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:13,685 INFO L93 Difference]: Finished difference Result 11514 states and 18563 transitions. [2019-09-10 06:33:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:13,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 368 [2019-09-10 06:33:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:13,766 INFO L225 Difference]: With dead ends: 11514 [2019-09-10 06:33:13,767 INFO L226 Difference]: Without dead ends: 11514 [2019-09-10 06:33:13,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11514 states. [2019-09-10 06:33:14,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11514 to 11512. [2019-09-10 06:33:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11512 states. [2019-09-10 06:33:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11512 states to 11512 states and 18562 transitions. [2019-09-10 06:33:14,169 INFO L78 Accepts]: Start accepts. Automaton has 11512 states and 18562 transitions. Word has length 368 [2019-09-10 06:33:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:14,170 INFO L475 AbstractCegarLoop]: Abstraction has 11512 states and 18562 transitions. [2019-09-10 06:33:14,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11512 states and 18562 transitions. [2019-09-10 06:33:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-10 06:33:14,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:14,208 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:14,208 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:14,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash 451806091, now seen corresponding path program 1 times [2019-09-10 06:33:14,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:14,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:14,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:14,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:14,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:14,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:14,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:14,735 INFO L87 Difference]: Start difference. First operand 11512 states and 18562 transitions. Second operand 3 states. [2019-09-10 06:33:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:14,930 INFO L93 Difference]: Finished difference Result 16283 states and 26411 transitions. [2019-09-10 06:33:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:14,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-09-10 06:33:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:14,980 INFO L225 Difference]: With dead ends: 16283 [2019-09-10 06:33:14,981 INFO L226 Difference]: Without dead ends: 16283 [2019-09-10 06:33:14,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16283 states. [2019-09-10 06:33:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16283 to 16281. [2019-09-10 06:33:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16281 states. [2019-09-10 06:33:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16281 states to 16281 states and 26410 transitions. [2019-09-10 06:33:15,464 INFO L78 Accepts]: Start accepts. Automaton has 16281 states and 26410 transitions. Word has length 370 [2019-09-10 06:33:15,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:15,466 INFO L475 AbstractCegarLoop]: Abstraction has 16281 states and 26410 transitions. [2019-09-10 06:33:15,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16281 states and 26410 transitions. [2019-09-10 06:33:15,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-10 06:33:15,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:15,499 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:15,499 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 384532741, now seen corresponding path program 1 times [2019-09-10 06:33:15,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:15,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:15,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:15,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:16,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:33:16,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:16,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:33:16,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:33:16,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:33:16,081 INFO L87 Difference]: Start difference. First operand 16281 states and 26410 transitions. Second operand 5 states. [2019-09-10 06:33:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:16,601 INFO L93 Difference]: Finished difference Result 37489 states and 61709 transitions. [2019-09-10 06:33:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:33:16,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 371 [2019-09-10 06:33:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:16,700 INFO L225 Difference]: With dead ends: 37489 [2019-09-10 06:33:16,701 INFO L226 Difference]: Without dead ends: 37489 [2019-09-10 06:33:16,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37489 states. [2019-09-10 06:33:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37489 to 29290. [2019-09-10 06:33:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29290 states. [2019-09-10 06:33:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29290 states to 29290 states and 48034 transitions. [2019-09-10 06:33:18,331 INFO L78 Accepts]: Start accepts. Automaton has 29290 states and 48034 transitions. Word has length 371 [2019-09-10 06:33:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:18,332 INFO L475 AbstractCegarLoop]: Abstraction has 29290 states and 48034 transitions. [2019-09-10 06:33:18,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:33:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 29290 states and 48034 transitions. [2019-09-10 06:33:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-10 06:33:18,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:18,367 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:18,367 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash 138433294, now seen corresponding path program 1 times [2019-09-10 06:33:18,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:18,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:19,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:19,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:19,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:19,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:19,298 INFO L87 Difference]: Start difference. First operand 29290 states and 48034 transitions. Second operand 7 states. [2019-09-10 06:33:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:19,934 INFO L93 Difference]: Finished difference Result 49538 states and 81911 transitions. [2019-09-10 06:33:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:33:19,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 371 [2019-09-10 06:33:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:20,090 INFO L225 Difference]: With dead ends: 49538 [2019-09-10 06:33:20,090 INFO L226 Difference]: Without dead ends: 49538 [2019-09-10 06:33:20,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:33:20,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49538 states. [2019-09-10 06:33:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49538 to 32694. [2019-09-10 06:33:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2019-09-10 06:33:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 53774 transitions. [2019-09-10 06:33:21,036 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 53774 transitions. Word has length 371 [2019-09-10 06:33:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:21,037 INFO L475 AbstractCegarLoop]: Abstraction has 32694 states and 53774 transitions. [2019-09-10 06:33:21,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 53774 transitions. [2019-09-10 06:33:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:33:21,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:21,080 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:21,080 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1000016727, now seen corresponding path program 1 times [2019-09-10 06:33:21,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:21,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:21,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:21,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:21,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:21,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:21,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:21,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:21,952 INFO L87 Difference]: Start difference. First operand 32694 states and 53774 transitions. Second operand 7 states. [2019-09-10 06:33:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:22,864 INFO L93 Difference]: Finished difference Result 90982 states and 151035 transitions. [2019-09-10 06:33:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:33:22,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:33:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:23,133 INFO L225 Difference]: With dead ends: 90982 [2019-09-10 06:33:23,134 INFO L226 Difference]: Without dead ends: 90982 [2019-09-10 06:33:23,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:33:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90982 states. [2019-09-10 06:33:25,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90982 to 39920. [2019-09-10 06:33:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39920 states. [2019-09-10 06:33:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39920 states to 39920 states and 65902 transitions. [2019-09-10 06:33:25,385 INFO L78 Accepts]: Start accepts. Automaton has 39920 states and 65902 transitions. Word has length 372 [2019-09-10 06:33:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:25,386 INFO L475 AbstractCegarLoop]: Abstraction has 39920 states and 65902 transitions. [2019-09-10 06:33:25,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 39920 states and 65902 transitions. [2019-09-10 06:33:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:33:25,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:25,421 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:25,421 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1696383086, now seen corresponding path program 1 times [2019-09-10 06:33:25,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:25,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:25,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:25,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:25,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:25,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:33:25,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:25,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:33:25,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:33:25,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:33:25,849 INFO L87 Difference]: Start difference. First operand 39920 states and 65902 transitions. Second operand 5 states. [2019-09-10 06:33:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:26,360 INFO L93 Difference]: Finished difference Result 107930 states and 178801 transitions. [2019-09-10 06:33:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:33:26,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 372 [2019-09-10 06:33:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:26,649 INFO L225 Difference]: With dead ends: 107930 [2019-09-10 06:33:26,649 INFO L226 Difference]: Without dead ends: 107930 [2019-09-10 06:33:26,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107930 states. [2019-09-10 06:33:28,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107930 to 80538. [2019-09-10 06:33:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80538 states. [2019-09-10 06:33:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80538 states to 80538 states and 133122 transitions. [2019-09-10 06:33:28,332 INFO L78 Accepts]: Start accepts. Automaton has 80538 states and 133122 transitions. Word has length 372 [2019-09-10 06:33:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:28,332 INFO L475 AbstractCegarLoop]: Abstraction has 80538 states and 133122 transitions. [2019-09-10 06:33:28,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:33:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80538 states and 133122 transitions. [2019-09-10 06:33:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:33:28,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:28,358 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:28,359 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -235962621, now seen corresponding path program 1 times [2019-09-10 06:33:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:28,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:28,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:29,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:29,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:29,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:29,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:29,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:29,320 INFO L87 Difference]: Start difference. First operand 80538 states and 133122 transitions. Second operand 7 states. [2019-09-10 06:33:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:31,585 INFO L93 Difference]: Finished difference Result 213572 states and 354115 transitions. [2019-09-10 06:33:31,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:33:31,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:33:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:32,028 INFO L225 Difference]: With dead ends: 213572 [2019-09-10 06:33:32,029 INFO L226 Difference]: Without dead ends: 213572 [2019-09-10 06:33:32,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:33:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213572 states. [2019-09-10 06:33:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213572 to 84110. [2019-09-10 06:33:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84110 states. [2019-09-10 06:33:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84110 states to 84110 states and 139090 transitions. [2019-09-10 06:33:34,539 INFO L78 Accepts]: Start accepts. Automaton has 84110 states and 139090 transitions. Word has length 372 [2019-09-10 06:33:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:34,542 INFO L475 AbstractCegarLoop]: Abstraction has 84110 states and 139090 transitions. [2019-09-10 06:33:34,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 84110 states and 139090 transitions. [2019-09-10 06:33:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:33:34,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:34,566 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:34,566 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash -903330698, now seen corresponding path program 1 times [2019-09-10 06:33:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:34,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:34,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:34,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:35,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 06:33:35,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:35,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 06:33:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 06:33:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:33:35,376 INFO L87 Difference]: Start difference. First operand 84110 states and 139090 transitions. Second operand 7 states. [2019-09-10 06:33:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:36,312 INFO L93 Difference]: Finished difference Result 217416 states and 360547 transitions. [2019-09-10 06:33:36,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 06:33:36,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 372 [2019-09-10 06:33:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:36,706 INFO L225 Difference]: With dead ends: 217416 [2019-09-10 06:33:36,706 INFO L226 Difference]: Without dead ends: 217416 [2019-09-10 06:33:36,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:33:36,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217416 states. [2019-09-10 06:33:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217416 to 87682. [2019-09-10 06:33:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87682 states. [2019-09-10 06:33:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87682 states to 87682 states and 145058 transitions. [2019-09-10 06:33:40,638 INFO L78 Accepts]: Start accepts. Automaton has 87682 states and 145058 transitions. Word has length 372 [2019-09-10 06:33:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:40,639 INFO L475 AbstractCegarLoop]: Abstraction has 87682 states and 145058 transitions. [2019-09-10 06:33:40,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 06:33:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 87682 states and 145058 transitions. [2019-09-10 06:33:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-10 06:33:40,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:40,655 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:40,655 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash -346878678, now seen corresponding path program 1 times [2019-09-10 06:33:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:40,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:40,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:40,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:40,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:40,994 INFO L87 Difference]: Start difference. First operand 87682 states and 145058 transitions. Second operand 3 states. [2019-09-10 06:33:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:41,683 INFO L93 Difference]: Finished difference Result 172289 states and 284867 transitions. [2019-09-10 06:33:41,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:41,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-10 06:33:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:41,935 INFO L225 Difference]: With dead ends: 172289 [2019-09-10 06:33:41,936 INFO L226 Difference]: Without dead ends: 172289 [2019-09-10 06:33:41,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172289 states. [2019-09-10 06:33:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172289 to 172287. [2019-09-10 06:33:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172287 states. [2019-09-10 06:33:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172287 states to 172287 states and 284866 transitions. [2019-09-10 06:33:44,327 INFO L78 Accepts]: Start accepts. Automaton has 172287 states and 284866 transitions. Word has length 372 [2019-09-10 06:33:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:44,328 INFO L475 AbstractCegarLoop]: Abstraction has 172287 states and 284866 transitions. [2019-09-10 06:33:44,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:44,328 INFO L276 IsEmpty]: Start isEmpty. Operand 172287 states and 284866 transitions. [2019-09-10 06:33:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:33:44,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:44,362 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:44,362 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:44,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2030214534, now seen corresponding path program 1 times [2019-09-10 06:33:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:44,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:44,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:44,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:44,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:44,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:44,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:44,637 INFO L87 Difference]: Start difference. First operand 172287 states and 284866 transitions. Second operand 3 states. [2019-09-10 06:33:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:49,066 INFO L93 Difference]: Finished difference Result 340231 states and 561081 transitions. [2019-09-10 06:33:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:49,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-10 06:33:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:33:49,534 INFO L225 Difference]: With dead ends: 340231 [2019-09-10 06:33:49,535 INFO L226 Difference]: Without dead ends: 340231 [2019-09-10 06:33:49,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:49,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340231 states. [2019-09-10 06:33:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340231 to 340229. [2019-09-10 06:33:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340229 states. [2019-09-10 06:33:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340229 states to 340229 states and 561080 transitions. [2019-09-10 06:33:53,205 INFO L78 Accepts]: Start accepts. Automaton has 340229 states and 561080 transitions. Word has length 373 [2019-09-10 06:33:53,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:33:53,205 INFO L475 AbstractCegarLoop]: Abstraction has 340229 states and 561080 transitions. [2019-09-10 06:33:53,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:33:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 340229 states and 561080 transitions. [2019-09-10 06:33:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:33:53,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:33:53,246 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:33:53,246 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:33:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:33:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1049430464, now seen corresponding path program 1 times [2019-09-10 06:33:53,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:33:53,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:33:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:33:53,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:33:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:33:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:33:53,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:33:53,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:33:53,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:33:53,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:33:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:33:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:33:53,559 INFO L87 Difference]: Start difference. First operand 340229 states and 561080 transitions. Second operand 3 states. [2019-09-10 06:33:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:33:59,837 INFO L93 Difference]: Finished difference Result 671569 states and 1104502 transitions. [2019-09-10 06:33:59,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:33:59,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-10 06:33:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:01,053 INFO L225 Difference]: With dead ends: 671569 [2019-09-10 06:34:01,053 INFO L226 Difference]: Without dead ends: 671569 [2019-09-10 06:34:01,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:34:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671569 states. [2019-09-10 06:34:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671569 to 671567. [2019-09-10 06:34:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671567 states. [2019-09-10 06:34:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671567 states to 671567 states and 1104501 transitions. [2019-09-10 06:34:23,986 INFO L78 Accepts]: Start accepts. Automaton has 671567 states and 1104501 transitions. Word has length 373 [2019-09-10 06:34:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:34:23,986 INFO L475 AbstractCegarLoop]: Abstraction has 671567 states and 1104501 transitions. [2019-09-10 06:34:23,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:34:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 671567 states and 1104501 transitions. [2019-09-10 06:34:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:34:24,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:34:24,058 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:34:24,058 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:34:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:34:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1775706260, now seen corresponding path program 1 times [2019-09-10 06:34:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:34:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:24,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:34:24,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:34:24,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:34:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:34:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:34:24,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:34:24,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:34:24,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:34:24,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:34:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:34:24,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:34:24,469 INFO L87 Difference]: Start difference. First operand 671567 states and 1104501 transitions. Second operand 5 states. [2019-09-10 06:34:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:34:41,061 INFO L93 Difference]: Finished difference Result 2127205 states and 3499856 transitions. [2019-09-10 06:34:41,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:34:41,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 373 [2019-09-10 06:34:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:34:44,757 INFO L225 Difference]: With dead ends: 2127205 [2019-09-10 06:34:44,757 INFO L226 Difference]: Without dead ends: 2127205 [2019-09-10 06:34:44,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:34:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127205 states. [2019-09-10 06:35:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127205 to 1551199. [2019-09-10 06:35:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1551199 states. [2019-09-10 06:36:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551199 states to 1551199 states and 2548961 transitions. [2019-09-10 06:36:03,075 INFO L78 Accepts]: Start accepts. Automaton has 1551199 states and 2548961 transitions. Word has length 373 [2019-09-10 06:36:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:36:03,076 INFO L475 AbstractCegarLoop]: Abstraction has 1551199 states and 2548961 transitions. [2019-09-10 06:36:03,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:36:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1551199 states and 2548961 transitions. [2019-09-10 06:36:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-10 06:36:03,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:36:03,141 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:36:03,141 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:36:03,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:36:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash -814009974, now seen corresponding path program 1 times [2019-09-10 06:36:03,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:36:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:36:03,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:36:03,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:36:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:36:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:36:03,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:36:03,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:36:03,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:36:03,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:36:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:36:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:36:03,450 INFO L87 Difference]: Start difference. First operand 1551199 states and 2548961 transitions. Second operand 3 states.