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_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:21:45,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:21:45,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:21:45,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:21:45,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:21:45,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:21:45,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:21:45,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:21:45,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:21:45,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:21:45,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:21:45,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:21:45,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:21:45,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:21:45,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:21:45,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:21:45,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:21:45,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:21:45,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:21:45,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:21:45,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:21:45,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:21:45,565 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:21:45,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:21:45,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:21:45,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:21:45,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:21:45,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:21:45,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:21:45,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:21:45,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:21:45,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:21:45,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:21:45,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:21:45,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:21:45,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:21:45,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:21:45,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:21:45,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:21:45,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:21:45,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:21:45,578 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 07:21:45,593 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:21:45,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:21:45,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:21:45,594 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:21:45,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:21:45,595 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:21:45,595 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:21:45,595 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:21:45,595 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:21:45,596 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:21:45,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:21:45,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:21:45,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:21:45,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:21:45,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:21:45,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:21:45,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:21:45,598 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:21:45,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:21:45,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:21:45,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:21:45,599 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:21:45,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:21:45,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:21:45,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:21:45,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:21:45,600 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:21:45,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:21:45,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:21:45,600 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:21:45,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:21:45,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:21:45,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:21:45,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:21:45,651 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:21:45,652 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 07:21:45,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328073396/896a30c1d43946f4ae1a5d0bfe266a7b/FLAGe7edfddb0 [2019-09-10 07:21:46,321 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:21:46,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 07:21:46,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328073396/896a30c1d43946f4ae1a5d0bfe266a7b/FLAGe7edfddb0 [2019-09-10 07:21:46,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/328073396/896a30c1d43946f4ae1a5d0bfe266a7b [2019-09-10 07:21:46,603 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:21:46,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:21:46,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:21:46,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:21:46,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:21:46,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:21:46" (1/1) ... [2019-09-10 07:21:46,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60cd48a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:46, skipping insertion in model container [2019-09-10 07:21:46,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:21:46" (1/1) ... [2019-09-10 07:21:46,623 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:21:46,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:21:47,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:21:47,346 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:21:47,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:21:47,882 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:21:47,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47 WrapperNode [2019-09-10 07:21:47,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:21:47,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:21:47,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:21:47,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:21:47,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:47,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (1/1) ... [2019-09-10 07:21:48,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:21:48,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:21:48,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:21:48,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:21:48,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (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 07:21:48,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:21:48,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:21:48,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:21:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:21:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:21:48,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:21:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:21:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:21:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:21:48,098 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:21:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:21:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:21:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:21:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:21:48,101 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:21:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:21:48,102 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:21:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:21:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:21:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:21:48,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:21:50,024 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:21:50,025 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:21:50,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:21:50 BoogieIcfgContainer [2019-09-10 07:21:50,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:21:50,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:21:50,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:21:50,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:21:50,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:21:46" (1/3) ... [2019-09-10 07:21:50,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d01252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:21:50, skipping insertion in model container [2019-09-10 07:21:50,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:21:47" (2/3) ... [2019-09-10 07:21:50,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d01252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:21:50, skipping insertion in model container [2019-09-10 07:21:50,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:21:50" (3/3) ... [2019-09-10 07:21:50,042 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.BOUNDED-12.pals.c.p+lhb-reducer.c [2019-09-10 07:21:50,055 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:21:50,083 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:21:50,105 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:21:50,145 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:21:50,146 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:21:50,146 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:21:50,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:21:50,146 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:21:50,146 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:21:50,147 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:21:50,147 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:21:50,191 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states. [2019-09-10 07:21:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 07:21:50,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:50,226 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] [2019-09-10 07:21:50,227 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash 58728648, now seen corresponding path program 1 times [2019-09-10 07:21:50,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:50,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:50,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:50,805 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 07:21:50,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:50,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 07:21:50,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:50,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 07:21:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 07:21:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 07:21:50,837 INFO L87 Difference]: Start difference. First operand 492 states. Second operand 4 states. [2019-09-10 07:21:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:51,078 INFO L93 Difference]: Finished difference Result 498 states and 809 transitions. [2019-09-10 07:21:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:51,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-10 07:21:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:51,111 INFO L225 Difference]: With dead ends: 498 [2019-09-10 07:21:51,111 INFO L226 Difference]: Without dead ends: 488 [2019-09-10 07:21:51,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:21:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-09-10 07:21:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2019-09-10 07:21:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-09-10 07:21:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 752 transitions. [2019-09-10 07:21:51,236 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 752 transitions. Word has length 123 [2019-09-10 07:21:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:51,236 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 752 transitions. [2019-09-10 07:21:51,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 07:21:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 752 transitions. [2019-09-10 07:21:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:21:51,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:51,249 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] [2019-09-10 07:21:51,249 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1001904736, now seen corresponding path program 1 times [2019-09-10 07:21:51,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:51,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:51,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:51,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:51,508 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 07:21:51,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:51,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:51,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:51,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:51,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:51,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:51,512 INFO L87 Difference]: Start difference. First operand 488 states and 752 transitions. Second operand 3 states. [2019-09-10 07:21:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:51,597 INFO L93 Difference]: Finished difference Result 778 states and 1211 transitions. [2019-09-10 07:21:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:51,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 07:21:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:51,603 INFO L225 Difference]: With dead ends: 778 [2019-09-10 07:21:51,603 INFO L226 Difference]: Without dead ends: 778 [2019-09-10 07:21:51,606 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 07:21:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-10 07:21:51,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-10 07:21:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-10 07:21:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1210 transitions. [2019-09-10 07:21:51,637 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1210 transitions. Word has length 163 [2019-09-10 07:21:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:51,639 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1210 transitions. [2019-09-10 07:21:51,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1210 transitions. [2019-09-10 07:21:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-10 07:21:51,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:51,647 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] [2019-09-10 07:21:51,648 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -103162106, now seen corresponding path program 1 times [2019-09-10 07:21:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:51,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:51,909 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 07:21:51,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:51,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:51,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:51,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:51,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:51,918 INFO L87 Difference]: Start difference. First operand 776 states and 1210 transitions. Second operand 3 states. [2019-09-10 07:21:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:51,990 INFO L93 Difference]: Finished difference Result 1281 states and 2009 transitions. [2019-09-10 07:21:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:52,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-10 07:21:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:52,014 INFO L225 Difference]: With dead ends: 1281 [2019-09-10 07:21:52,015 INFO L226 Difference]: Without dead ends: 1281 [2019-09-10 07:21:52,015 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 07:21:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-09-10 07:21:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1279. [2019-09-10 07:21:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2019-09-10 07:21:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 2008 transitions. [2019-09-10 07:21:52,057 INFO L78 Accepts]: Start accepts. Automaton has 1279 states and 2008 transitions. Word has length 163 [2019-09-10 07:21:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:52,057 INFO L475 AbstractCegarLoop]: Abstraction has 1279 states and 2008 transitions. [2019-09-10 07:21:52,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1279 states and 2008 transitions. [2019-09-10 07:21:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-10 07:21:52,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:52,064 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] [2019-09-10 07:21:52,064 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:52,065 INFO L82 PathProgramCache]: Analyzing trace with hash 9213278, now seen corresponding path program 1 times [2019-09-10 07:21:52,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:52,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:52,234 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 07:21:52,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:52,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:52,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:52,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:52,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:52,236 INFO L87 Difference]: Start difference. First operand 1279 states and 2008 transitions. Second operand 3 states. [2019-09-10 07:21:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:52,298 INFO L93 Difference]: Finished difference Result 2156 states and 3391 transitions. [2019-09-10 07:21:52,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:52,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-10 07:21:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:52,313 INFO L225 Difference]: With dead ends: 2156 [2019-09-10 07:21:52,314 INFO L226 Difference]: Without dead ends: 2156 [2019-09-10 07:21:52,314 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 07:21:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-09-10 07:21:52,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2154. [2019-09-10 07:21:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2019-09-10 07:21:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 3390 transitions. [2019-09-10 07:21:52,367 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 3390 transitions. Word has length 165 [2019-09-10 07:21:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:52,369 INFO L475 AbstractCegarLoop]: Abstraction has 2154 states and 3390 transitions. [2019-09-10 07:21:52,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 3390 transitions. [2019-09-10 07:21:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-10 07:21:52,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:52,376 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] [2019-09-10 07:21:52,376 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1951784104, now seen corresponding path program 1 times [2019-09-10 07:21:52,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:52,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:52,559 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 07:21:52,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:52,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:52,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:52,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:52,561 INFO L87 Difference]: Start difference. First operand 2154 states and 3390 transitions. Second operand 3 states. [2019-09-10 07:21:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:52,630 INFO L93 Difference]: Finished difference Result 3639 states and 5717 transitions. [2019-09-10 07:21:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:52,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-09-10 07:21:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:52,649 INFO L225 Difference]: With dead ends: 3639 [2019-09-10 07:21:52,649 INFO L226 Difference]: Without dead ends: 3639 [2019-09-10 07:21:52,650 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 07:21:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3639 states. [2019-09-10 07:21:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3639 to 3637. [2019-09-10 07:21:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3637 states. [2019-09-10 07:21:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5716 transitions. [2019-09-10 07:21:52,730 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5716 transitions. Word has length 167 [2019-09-10 07:21:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:52,731 INFO L475 AbstractCegarLoop]: Abstraction has 3637 states and 5716 transitions. [2019-09-10 07:21:52,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5716 transitions. [2019-09-10 07:21:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-10 07:21:52,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:52,741 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] [2019-09-10 07:21:52,741 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1864971758, now seen corresponding path program 1 times [2019-09-10 07:21:52,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:52,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:52,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:52,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:52,842 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 07:21:52,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:52,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:52,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:52,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:52,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:52,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:52,844 INFO L87 Difference]: Start difference. First operand 3637 states and 5716 transitions. Second operand 3 states. [2019-09-10 07:21:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:52,935 INFO L93 Difference]: Finished difference Result 6066 states and 9483 transitions. [2019-09-10 07:21:52,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:52,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-10 07:21:52,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:52,965 INFO L225 Difference]: With dead ends: 6066 [2019-09-10 07:21:52,965 INFO L226 Difference]: Without dead ends: 6066 [2019-09-10 07:21:52,966 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 07:21:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2019-09-10 07:21:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 6064. [2019-09-10 07:21:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6064 states. [2019-09-10 07:21:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6064 states to 6064 states and 9482 transitions. [2019-09-10 07:21:53,146 INFO L78 Accepts]: Start accepts. Automaton has 6064 states and 9482 transitions. Word has length 169 [2019-09-10 07:21:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:53,147 INFO L475 AbstractCegarLoop]: Abstraction has 6064 states and 9482 transitions. [2019-09-10 07:21:53,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6064 states and 9482 transitions. [2019-09-10 07:21:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-10 07:21:53,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:53,170 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] [2019-09-10 07:21:53,174 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:53,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1410615810, now seen corresponding path program 1 times [2019-09-10 07:21:53,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:53,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:53,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:53,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:53,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:53,334 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 07:21:53,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:53,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:53,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:53,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:53,336 INFO L87 Difference]: Start difference. First operand 6064 states and 9482 transitions. Second operand 3 states. [2019-09-10 07:21:53,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:53,465 INFO L93 Difference]: Finished difference Result 9837 states and 15233 transitions. [2019-09-10 07:21:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:53,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-10 07:21:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:53,527 INFO L225 Difference]: With dead ends: 9837 [2019-09-10 07:21:53,527 INFO L226 Difference]: Without dead ends: 9837 [2019-09-10 07:21:53,527 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 07:21:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9837 states. [2019-09-10 07:21:53,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9837 to 9835. [2019-09-10 07:21:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9835 states. [2019-09-10 07:21:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9835 states to 9835 states and 15232 transitions. [2019-09-10 07:21:53,835 INFO L78 Accepts]: Start accepts. Automaton has 9835 states and 15232 transitions. Word has length 171 [2019-09-10 07:21:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:53,836 INFO L475 AbstractCegarLoop]: Abstraction has 9835 states and 15232 transitions. [2019-09-10 07:21:53,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:21:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9835 states and 15232 transitions. [2019-09-10 07:21:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 07:21:53,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:53,870 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] [2019-09-10 07:21:53,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:53,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:53,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1514862974, now seen corresponding path program 1 times [2019-09-10 07:21:53,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:53,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:54,428 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 07:21:54,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:54,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:21:54,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:54,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:21:54,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:21:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:21:54,431 INFO L87 Difference]: Start difference. First operand 9835 states and 15232 transitions. Second operand 8 states. [2019-09-10 07:21:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:55,599 INFO L93 Difference]: Finished difference Result 49921 states and 75446 transitions. [2019-09-10 07:21:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:21:55,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-10 07:21:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:55,715 INFO L225 Difference]: With dead ends: 49921 [2019-09-10 07:21:55,716 INFO L226 Difference]: Without dead ends: 49921 [2019-09-10 07:21:55,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:21:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49921 states. [2019-09-10 07:21:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49921 to 49911. [2019-09-10 07:21:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49911 states. [2019-09-10 07:21:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49911 states to 49911 states and 75441 transitions. [2019-09-10 07:21:58,182 INFO L78 Accepts]: Start accepts. Automaton has 49911 states and 75441 transitions. Word has length 173 [2019-09-10 07:21:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:21:58,182 INFO L475 AbstractCegarLoop]: Abstraction has 49911 states and 75441 transitions. [2019-09-10 07:21:58,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:21:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 49911 states and 75441 transitions. [2019-09-10 07:21:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 07:21:58,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:21:58,349 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] [2019-09-10 07:21:58,349 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:21:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:21:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash -518428648, now seen corresponding path program 1 times [2019-09-10 07:21:58,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:21:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:58,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:21:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:21:58,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:21:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:21:58,538 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 07:21:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:21:58,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:21:58,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:21:58,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:21:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:21:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:21:58,541 INFO L87 Difference]: Start difference. First operand 49911 states and 75441 transitions. Second operand 3 states. [2019-09-10 07:21:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:58,859 INFO L93 Difference]: Finished difference Result 58472 states and 88554 transitions. [2019-09-10 07:21:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:21:58,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 07:21:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:59,000 INFO L225 Difference]: With dead ends: 58472 [2019-09-10 07:21:59,001 INFO L226 Difference]: Without dead ends: 58472 [2019-09-10 07:21:59,002 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 07:21:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58472 states. [2019-09-10 07:22:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58472 to 58470. [2019-09-10 07:22:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58470 states. [2019-09-10 07:22:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58470 states to 58470 states and 88553 transitions. [2019-09-10 07:22:01,046 INFO L78 Accepts]: Start accepts. Automaton has 58470 states and 88553 transitions. Word has length 176 [2019-09-10 07:22:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:01,046 INFO L475 AbstractCegarLoop]: Abstraction has 58470 states and 88553 transitions. [2019-09-10 07:22:01,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 58470 states and 88553 transitions. [2019-09-10 07:22:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 07:22:01,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:01,132 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] [2019-09-10 07:22:01,133 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2078310394, now seen corresponding path program 1 times [2019-09-10 07:22:01,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:01,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:01,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:01,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:01,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:01,290 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 07:22:01,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:01,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:01,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:01,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:01,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:01,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:01,294 INFO L87 Difference]: Start difference. First operand 58470 states and 88553 transitions. Second operand 3 states. [2019-09-10 07:22:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:01,621 INFO L93 Difference]: Finished difference Result 79355 states and 120201 transitions. [2019-09-10 07:22:01,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:01,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 07:22:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:01,840 INFO L225 Difference]: With dead ends: 79355 [2019-09-10 07:22:01,841 INFO L226 Difference]: Without dead ends: 79355 [2019-09-10 07:22:01,841 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 07:22:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79355 states. [2019-09-10 07:22:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79355 to 79353. [2019-09-10 07:22:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79353 states. [2019-09-10 07:22:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79353 states to 79353 states and 120200 transitions. [2019-09-10 07:22:05,686 INFO L78 Accepts]: Start accepts. Automaton has 79353 states and 120200 transitions. Word has length 176 [2019-09-10 07:22:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:05,686 INFO L475 AbstractCegarLoop]: Abstraction has 79353 states and 120200 transitions. [2019-09-10 07:22:05,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 79353 states and 120200 transitions. [2019-09-10 07:22:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 07:22:05,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:05,801 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] [2019-09-10 07:22:05,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:05,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:05,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1898062312, now seen corresponding path program 1 times [2019-09-10 07:22:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:05,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:05,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:05,922 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 07:22:05,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:05,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:05,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:05,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:05,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:05,924 INFO L87 Difference]: Start difference. First operand 79353 states and 120200 transitions. Second operand 3 states. [2019-09-10 07:22:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:06,380 INFO L93 Difference]: Finished difference Result 140709 states and 211430 transitions. [2019-09-10 07:22:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:06,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 07:22:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:06,565 INFO L225 Difference]: With dead ends: 140709 [2019-09-10 07:22:06,565 INFO L226 Difference]: Without dead ends: 140709 [2019-09-10 07:22:06,566 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 07:22:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140709 states. [2019-09-10 07:22:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140709 to 140707. [2019-09-10 07:22:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140707 states. [2019-09-10 07:22:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140707 states to 140707 states and 211429 transitions. [2019-09-10 07:22:08,875 INFO L78 Accepts]: Start accepts. Automaton has 140707 states and 211429 transitions. Word has length 176 [2019-09-10 07:22:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:08,876 INFO L475 AbstractCegarLoop]: Abstraction has 140707 states and 211429 transitions. [2019-09-10 07:22:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 140707 states and 211429 transitions. [2019-09-10 07:22:09,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 07:22:09,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22: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] [2019-09-10 07:22:09,023 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash 205320917, now seen corresponding path program 1 times [2019-09-10 07:22:09,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:09,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:09,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:09,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:09,132 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 07:22:09,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:09,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:22:09,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:09,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:22:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:22:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:22:09,134 INFO L87 Difference]: Start difference. First operand 140707 states and 211429 transitions. Second operand 3 states. [2019-09-10 07:22:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:10,247 INFO L93 Difference]: Finished difference Result 226718 states and 336807 transitions. [2019-09-10 07:22:10,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:22:10,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-09-10 07:22:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:10,513 INFO L225 Difference]: With dead ends: 226718 [2019-09-10 07:22:10,513 INFO L226 Difference]: Without dead ends: 226718 [2019-09-10 07:22:10,513 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 07:22:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226718 states. [2019-09-10 07:22:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226718 to 226716. [2019-09-10 07:22:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226716 states. [2019-09-10 07:22:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226716 states to 226716 states and 336806 transitions. [2019-09-10 07:22:16,887 INFO L78 Accepts]: Start accepts. Automaton has 226716 states and 336806 transitions. Word has length 177 [2019-09-10 07:22:16,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:16,888 INFO L475 AbstractCegarLoop]: Abstraction has 226716 states and 336806 transitions. [2019-09-10 07:22:16,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:22:16,888 INFO L276 IsEmpty]: Start isEmpty. Operand 226716 states and 336806 transitions. [2019-09-10 07:22:17,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 07:22:17,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:17,192 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] [2019-09-10 07:22:17,192 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1304183970, now seen corresponding path program 1 times [2019-09-10 07:22:17,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:17,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:17,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:17,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:17,384 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 07:22:17,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:17,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:22:17,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:17,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:22:17,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:22:17,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:22:17,386 INFO L87 Difference]: Start difference. First operand 226716 states and 336806 transitions. Second operand 6 states. [2019-09-10 07:22:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:23,781 INFO L93 Difference]: Finished difference Result 522070 states and 770434 transitions. [2019-09-10 07:22:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:22:23,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 177 [2019-09-10 07:22:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:24,482 INFO L225 Difference]: With dead ends: 522070 [2019-09-10 07:22:24,482 INFO L226 Difference]: Without dead ends: 522070 [2019-09-10 07:22:24,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:22:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522070 states. [2019-09-10 07:22:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522070 to 500882. [2019-09-10 07:22:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500882 states. [2019-09-10 07:22:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500882 states to 500882 states and 739424 transitions. [2019-09-10 07:22:34,846 INFO L78 Accepts]: Start accepts. Automaton has 500882 states and 739424 transitions. Word has length 177 [2019-09-10 07:22:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:34,846 INFO L475 AbstractCegarLoop]: Abstraction has 500882 states and 739424 transitions. [2019-09-10 07:22:34,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:22:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 500882 states and 739424 transitions. [2019-09-10 07:22:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 07:22:43,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:43,539 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] [2019-09-10 07:22:43,540 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 621077182, now seen corresponding path program 1 times [2019-09-10 07:22:43,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:43,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:43,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:43,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:43,745 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 07:22:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:22:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:22:43,746 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:43,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:22:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:22:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:22:43,747 INFO L87 Difference]: Start difference. First operand 500882 states and 739424 transitions. Second operand 8 states. [2019-09-10 07:22:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:22:51,687 INFO L93 Difference]: Finished difference Result 1868948 states and 2723304 transitions. [2019-09-10 07:22:51,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:22:51,688 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2019-09-10 07:22:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:22:54,803 INFO L225 Difference]: With dead ends: 1868948 [2019-09-10 07:22:54,803 INFO L226 Difference]: Without dead ends: 1868948 [2019-09-10 07:22:54,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-09-10 07:23:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868948 states. [2019-09-10 07:23:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868948 to 977991. [2019-09-10 07:23:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977991 states. [2019-09-10 07:23:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977991 states to 977991 states and 1418633 transitions. [2019-09-10 07:23:43,074 INFO L78 Accepts]: Start accepts. Automaton has 977991 states and 1418633 transitions. Word has length 177 [2019-09-10 07:23:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:23:43,075 INFO L475 AbstractCegarLoop]: Abstraction has 977991 states and 1418633 transitions. [2019-09-10 07:23:43,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:23:43,075 INFO L276 IsEmpty]: Start isEmpty. Operand 977991 states and 1418633 transitions. [2019-09-10 07:23:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 07:23:55,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:23:55,301 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] [2019-09-10 07:23:55,301 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:23:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:23:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1208547835, now seen corresponding path program 1 times [2019-09-10 07:23:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:23:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:55,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:23:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:23:55,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:23:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:23:55,397 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 07:23:55,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:23:55,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:23:55,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:23:55,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:23:55,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:23:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:23:55,399 INFO L87 Difference]: Start difference. First operand 977991 states and 1418633 transitions. Second operand 3 states. [2019-09-10 07:24:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:24:01,995 INFO L93 Difference]: Finished difference Result 1466185 states and 2090806 transitions. [2019-09-10 07:24:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:24:01,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-10 07:24:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:24:04,206 INFO L225 Difference]: With dead ends: 1466185 [2019-09-10 07:24:04,206 INFO L226 Difference]: Without dead ends: 1402015 [2019-09-10 07:24:04,207 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 07:24:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402015 states. [2019-09-10 07:25:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402015 to 1391677. [2019-09-10 07:25:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391677 states. [2019-09-10 07:25:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391677 states to 1391677 states and 1988267 transitions. [2019-09-10 07:25:18,550 INFO L78 Accepts]: Start accepts. Automaton has 1391677 states and 1988267 transitions. Word has length 181 [2019-09-10 07:25:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:18,551 INFO L475 AbstractCegarLoop]: Abstraction has 1391677 states and 1988267 transitions. [2019-09-10 07:25:18,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1391677 states and 1988267 transitions. [2019-09-10 07:25:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-10 07:25:21,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:21,155 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] [2019-09-10 07:25:21,155 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1152398536, now seen corresponding path program 1 times [2019-09-10 07:25:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:21,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:21,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:21,285 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 07:25:21,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:21,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:25:21,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:21,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:25:21,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:25:21,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:21,288 INFO L87 Difference]: Start difference. First operand 1391677 states and 1988267 transitions. Second operand 6 states.